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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 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 113K 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-05b-CTLCardinality-2024-00
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-01
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-02
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-03
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-04
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-05
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-06
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-07
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-08
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-09
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-10
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2024-11
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2023-12
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2023-13
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2023-14
FORMULA_NAME AutoFlight-PT-05b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716258268812

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 02:24:31] [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-21 02:24:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:24:31] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-21 02:24:31] [INFO ] Transformed 482 places.
[2024-05-21 02:24:31] [INFO ] Transformed 480 transitions.
[2024-05-21 02:24:31] [INFO ] Found NUPN structural information;
[2024-05-21 02:24:31] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 463 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
FORMULA AutoFlight-PT-05b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 432 transition count 430
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 432 transition count 430
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 107 place count 432 transition count 423
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 124 place count 415 transition count 406
Iterating global reduction 1 with 17 rules applied. Total rules applied 141 place count 415 transition count 406
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 413 transition count 404
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 413 transition count 404
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 412 transition count 403
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 412 transition count 403
Applied a total of 147 rules in 279 ms. Remains 412 /482 variables (removed 70) and now considering 403/480 (removed 77) transitions.
// Phase 1: matrix 403 rows 412 cols
[2024-05-21 02:24:32] [INFO ] Computed 34 invariants in 45 ms
[2024-05-21 02:24:32] [INFO ] Implicit Places using invariants in 711 ms returned []
[2024-05-21 02:24:32] [INFO ] Invariant cache hit.
[2024-05-21 02:24:33] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2024-05-21 02:24:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 02:24:44] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 34 ms to minimize.
[2024-05-21 02:24:44] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 5 ms to minimize.
[2024-05-21 02:24:44] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 5 ms to minimize.
[2024-05-21 02:24:45] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 5 ms to minimize.
[2024-05-21 02:24:45] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2024-05-21 02:24:45] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 3 ms to minimize.
[2024-05-21 02:24:45] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 3 ms to minimize.
[2024-05-21 02:24:45] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 3 ms to minimize.
[2024-05-21 02:24:45] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 02:24:46] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 4 ms to minimize.
[2024-05-21 02:24:46] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 6 ms to minimize.
[2024-05-21 02:24:46] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 6 ms to minimize.
[2024-05-21 02:24:46] [INFO ] Deduced a trap composed of 65 places in 399 ms of which 7 ms to minimize.
[2024-05-21 02:24:47] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 7 ms to minimize.
[2024-05-21 02:24:47] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 6 ms to minimize.
[2024-05-21 02:24:47] [INFO ] Deduced a trap composed of 50 places in 294 ms of which 5 ms to minimize.
[2024-05-21 02:24:48] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 5 ms to minimize.
[2024-05-21 02:24:48] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 5 ms to minimize.
[2024-05-21 02:24:48] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 5 ms to minimize.
[2024-05-21 02:24:49] [INFO ] Deduced a trap composed of 60 places in 298 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 02:24:55] [INFO ] Deduced a trap composed of 57 places in 335 ms of which 6 ms to minimize.
[2024-05-21 02:24:55] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 4 ms to minimize.
[2024-05-21 02:24:56] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 4 ms to minimize.
[2024-05-21 02:24:56] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 4 ms to minimize.
[2024-05-21 02:24:56] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-05-21 02:24:56] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-05-21 02:24:57] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 3 ms to minimize.
[2024-05-21 02:24:57] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-21 02:24:57] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 7 ms to minimize.
[2024-05-21 02:24:57] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-21 02:24:57] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 3 ms to minimize.
[2024-05-21 02:24:57] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 5 ms to minimize.
[2024-05-21 02:24:57] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 5 ms to minimize.
[2024-05-21 02:24:58] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 10 ms to minimize.
[2024-05-21 02:24:58] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 3 ms to minimize.
[2024-05-21 02:24:58] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 5 ms to minimize.
[2024-05-21 02:24:58] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 4 ms to minimize.
[2024-05-21 02:24:59] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 7 ms to minimize.
[2024-05-21 02:24:59] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 4 ms to minimize.
[2024-05-21 02:25:01] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 02:25:01] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 4 ms to minimize.
[2024-05-21 02:25:02] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 5 ms to minimize.
[2024-05-21 02:25:02] [INFO ] Deduced a trap composed of 63 places in 302 ms of which 6 ms to minimize.
[2024-05-21 02:25:03] [INFO ] Deduced a trap composed of 75 places in 294 ms of which 5 ms to minimize.
[2024-05-21 02:25:03] [INFO ] Deduced a trap composed of 65 places in 331 ms of which 6 ms to minimize.
[2024-05-21 02:25:03] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 5 ms to minimize.
SMT process timed out in 30235ms, After SMT, problems are : Problem set: 0 solved, 402 unsolved
Search for dead transitions found 0 dead transitions in 30265ms
Starting structural reductions in LTL mode, iteration 1 : 412/482 places, 403/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31899 ms. Remains : 412/482 places, 403/480 transitions.
Support contains 79 out of 412 places after structural reductions.
[2024-05-21 02:25:04] [INFO ] Flatten gal took : 127 ms
[2024-05-21 02:25:04] [INFO ] Flatten gal took : 53 ms
[2024-05-21 02:25:04] [INFO ] Input system was already deterministic with 403 transitions.
Support contains 75 out of 412 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (160 resets) in 2866 ms. (13 steps per ms) remains 9/51 properties
BEST_FIRST walk for 40004 steps (14 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (13 resets) in 136 ms. (291 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (15 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (14 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (13 resets) in 108 ms. (367 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (14 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
[2024-05-21 02:25:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 189/202 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 184/386 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 26/412 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 403/815 variables, 412/446 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/815 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/815 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 446 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 189/202 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 3 ms to minimize.
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 184/386 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 3 ms to minimize.
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 7 (OVERLAPS) 26/412 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 14 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 4 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 4 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 4 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 13/55 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 403/815 variables, 412/467 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/815 variables, 6/473 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 02:25:10] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 3 ms to minimize.
[2024-05-21 02:25:10] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/815 variables, 2/475 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 02:25:10] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/815 variables, 1/476 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/815 variables, 0/476 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/815 variables, 0/476 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 476 constraints, problems are : Problem set: 2 solved, 6 unsolved in 4279 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 24/24 constraints]
After SMT, in 5362ms problems are : Problem set: 2 solved, 6 unsolved
Parikh walk visited 1 properties in 6013 ms.
Support contains 7 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 403/403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 412 transition count 256
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 167 rules applied. Total rules applied 314 place count 265 transition count 236
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 324 place count 255 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 324 place count 255 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 420 place count 207 transition count 188
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 436 place count 191 transition count 172
Iterating global reduction 3 with 16 rules applied. Total rules applied 452 place count 191 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 453 place count 191 transition count 171
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 453 place count 191 transition count 163
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 469 place count 183 transition count 163
Performed 63 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 595 place count 120 transition count 93
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 615 place count 120 transition count 73
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 635 place count 100 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 636 place count 99 transition count 72
Reduce places removed 21 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 5 with 41 rules applied. Total rules applied 677 place count 78 transition count 52
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 697 place count 58 transition count 52
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 697 place count 58 transition count 37
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 727 place count 43 transition count 37
Applied a total of 727 rules in 108 ms. Remains 43 /412 variables (removed 369) and now considering 37/403 (removed 366) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 43/412 places, 37/403 transitions.
RANDOM walk for 9620 steps (234 resets) in 142 ms. (67 steps per ms) remains 0/5 properties
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-21 02:25:17] [INFO ] Flatten gal took : 27 ms
[2024-05-21 02:25:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-05b-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 02:25:17] [INFO ] Flatten gal took : 28 ms
[2024-05-21 02:25:17] [INFO ] Input system was already deterministic with 403 transitions.
Support contains 69 out of 412 places (down from 71) after GAL structural reductions.
Computed a total of 113 stabilizing places and 113 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 389 transition count 380
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 389 transition count 380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 389 transition count 377
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 381 transition count 369
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 381 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 378 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 378 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 375 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 375 transition count 363
Applied a total of 77 rules in 84 ms. Remains 375 /412 variables (removed 37) and now considering 363/403 (removed 40) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-21 02:25:17] [INFO ] Computed 34 invariants in 5 ms
[2024-05-21 02:25:17] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 02:25:17] [INFO ] Invariant cache hit.
[2024-05-21 02:25:18] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 02:25:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 02:25:27] [INFO ] Deduced a trap composed of 49 places in 365 ms of which 7 ms to minimize.
[2024-05-21 02:25:27] [INFO ] Deduced a trap composed of 17 places in 352 ms of which 7 ms to minimize.
[2024-05-21 02:25:28] [INFO ] Deduced a trap composed of 62 places in 343 ms of which 6 ms to minimize.
[2024-05-21 02:25:28] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 6 ms to minimize.
[2024-05-21 02:25:28] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 6 ms to minimize.
[2024-05-21 02:25:29] [INFO ] Deduced a trap composed of 58 places in 374 ms of which 6 ms to minimize.
[2024-05-21 02:25:29] [INFO ] Deduced a trap composed of 55 places in 336 ms of which 6 ms to minimize.
[2024-05-21 02:25:29] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 5 ms to minimize.
[2024-05-21 02:25:30] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 5 ms to minimize.
[2024-05-21 02:25:30] [INFO ] Deduced a trap composed of 65 places in 300 ms of which 6 ms to minimize.
[2024-05-21 02:25:30] [INFO ] Deduced a trap composed of 56 places in 314 ms of which 5 ms to minimize.
[2024-05-21 02:25:30] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 4 ms to minimize.
[2024-05-21 02:25:31] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 5 ms to minimize.
[2024-05-21 02:25:31] [INFO ] Deduced a trap composed of 22 places in 314 ms of which 5 ms to minimize.
[2024-05-21 02:25:31] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 5 ms to minimize.
[2024-05-21 02:25:32] [INFO ] Deduced a trap composed of 62 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:25:32] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 5 ms to minimize.
[2024-05-21 02:25:32] [INFO ] Deduced a trap composed of 57 places in 262 ms of which 5 ms to minimize.
[2024-05-21 02:25:32] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 5 ms to minimize.
[2024-05-21 02:25:33] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 5 ms to minimize.
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 5 ms to minimize.
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 5 ms to minimize.
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 5 ms to minimize.
[2024-05-21 02:25:39] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 5 ms to minimize.
[2024-05-21 02:25:39] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 5 ms to minimize.
[2024-05-21 02:25:39] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 5 ms to minimize.
[2024-05-21 02:25:40] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 5 ms to minimize.
[2024-05-21 02:25:40] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 4 ms to minimize.
[2024-05-21 02:25:40] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 4 ms to minimize.
[2024-05-21 02:25:40] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 4 ms to minimize.
[2024-05-21 02:25:41] [INFO ] Deduced a trap composed of 82 places in 273 ms of which 5 ms to minimize.
[2024-05-21 02:25:41] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 4 ms to minimize.
[2024-05-21 02:25:41] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 5 ms to minimize.
[2024-05-21 02:25:42] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:25:42] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 5 ms to minimize.
[2024-05-21 02:25:42] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 4 ms to minimize.
[2024-05-21 02:25:43] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:25:43] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 5 ms to minimize.
[2024-05-21 02:25:43] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 02:25:44] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 4 ms to minimize.
[2024-05-21 02:25:44] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 5 ms to minimize.
[2024-05-21 02:25:44] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 5 ms to minimize.
[2024-05-21 02:25:45] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 4 ms to minimize.
[2024-05-21 02:25:45] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 4 ms to minimize.
[2024-05-21 02:25:45] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 4 ms to minimize.
[2024-05-21 02:25:46] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 4 ms to minimize.
[2024-05-21 02:25:46] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 5 ms to minimize.
[2024-05-21 02:25:46] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 4 ms to minimize.
[2024-05-21 02:25:46] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:25:46] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:25:47] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:25:47] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 5 ms to minimize.
[2024-05-21 02:25:48] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 4 ms to minimize.
[2024-05-21 02:25:48] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/738 variables, and 89 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 55/89 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 02:25:55] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 5 ms to minimize.
[2024-05-21 02:25:55] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 4 ms to minimize.
[2024-05-21 02:25:55] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 4 ms to minimize.
[2024-05-21 02:25:55] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 4 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 4 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 4 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 3 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 4 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-21 02:25:57] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-21 02:25:57] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
[2024-05-21 02:25:57] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 3 ms to minimize.
[2024-05-21 02:25:57] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 4 ms to minimize.
[2024-05-21 02:25:57] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
[2024-05-21 02:25:58] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 4 ms to minimize.
[2024-05-21 02:25:59] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 4 ms to minimize.
[2024-05-21 02:26:00] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 19/108 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (OVERLAPS) 363/738 variables, 375/483 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 362/845 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 02:26:10] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 4 ms to minimize.
[2024-05-21 02:26:11] [INFO ] Deduced a trap composed of 68 places in 203 ms of which 4 ms to minimize.
[2024-05-21 02:26:11] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 4 ms to minimize.
[2024-05-21 02:26:11] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:26:11] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 5 ms to minimize.
[2024-05-21 02:26:12] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-21 02:26:13] [INFO ] Deduced a trap composed of 101 places in 244 ms of which 5 ms to minimize.
[2024-05-21 02:26:13] [INFO ] Deduced a trap composed of 60 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:26:15] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 5 ms to minimize.
[2024-05-21 02:26:15] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 5 ms to minimize.
[2024-05-21 02:26:15] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 4 ms to minimize.
[2024-05-21 02:26:15] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 5 ms to minimize.
[2024-05-21 02:26:16] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 4 ms to minimize.
[2024-05-21 02:26:17] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 4 ms to minimize.
[2024-05-21 02:26:17] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 860 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 89/89 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 375/412 places, 363/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60944 ms. Remains : 375/412 places, 363/403 transitions.
[2024-05-21 02:26:18] [INFO ] Flatten gal took : 38 ms
[2024-05-21 02:26:18] [INFO ] Flatten gal took : 40 ms
[2024-05-21 02:26:18] [INFO ] Input system was already deterministic with 363 transitions.
[2024-05-21 02:26:18] [INFO ] Flatten gal took : 31 ms
[2024-05-21 02:26:18] [INFO ] Flatten gal took : 31 ms
[2024-05-21 02:26:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2398667588521703734.gal : 33 ms
[2024-05-21 02:26:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality18067484743532610545.ctl : 13 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/CTLCardinality2398667588521703734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18067484743532610545.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.
Detected timeout of ITS tools.
[2024-05-21 02:26:48] [INFO ] Flatten gal took : 19 ms
[2024-05-21 02:26:48] [INFO ] Applying decomposition
[2024-05-21 02:26:49] [INFO ] Flatten gal took : 17 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/graph6971613020899090442.txt' '-o' '/tmp/graph6971613020899090442.bin' '-w' '/tmp/graph6971613020899090442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6971613020899090442.bin' '-l' '-1' '-v' '-w' '/tmp/graph6971613020899090442.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:26:49] [INFO ] Decomposing Gal with order
[2024-05-21 02:26:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:26:49] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 02:26:49] [INFO ] Flatten gal took : 88 ms
[2024-05-21 02:26:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-21 02:26:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality3895779575552771796.gal : 13 ms
[2024-05-21 02:26:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality17471578632578325.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/CTLCardinality3895779575552771796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17471578632578325.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.89155e+27,0.915037,32400,5345,16,61219,245,636,70868,35,408,0


Converting to forward existential form...Done !
original formula: A(EF((i3.u25.p86==1)) U AX(FALSE))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!(E(TRUE U (i3.u25.p86==1))) * !(!(EX(!(FALSE))...171
Reverse transition relation is NOT exact ! Due to transitions t110, t113, t136, t139, t162, t165, t183, t190, t212, t227, t234, t271, t350, t351, t352, t35...849
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 411 transition count 255
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 167 rules applied. Total rules applied 314 place count 264 transition count 235
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 325 place count 255 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 327 place count 253 transition count 233
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 327 place count 253 transition count 186
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 421 place count 206 transition count 186
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 437 place count 190 transition count 170
Iterating global reduction 4 with 16 rules applied. Total rules applied 453 place count 190 transition count 170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 453 place count 190 transition count 162
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 469 place count 182 transition count 162
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 585 place count 124 transition count 104
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 592 place count 124 transition count 97
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 606 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 607 place count 116 transition count 89
Reduce places removed 9 places and 0 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 5 with 13 rules applied. Total rules applied 620 place count 107 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 624 place count 103 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 624 place count 103 transition count 80
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 634 place count 98 transition count 80
Applied a total of 634 rules in 61 ms. Remains 98 /412 variables (removed 314) and now considering 80/403 (removed 323) transitions.
// Phase 1: matrix 80 rows 98 cols
[2024-05-21 02:27:19] [INFO ] Computed 25 invariants in 1 ms
[2024-05-21 02:27:19] [INFO ] Implicit Places using invariants in 119 ms returned [38, 57, 74, 83, 87, 92, 97]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 121 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/412 places, 80/403 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 85 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 83 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 83 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 80 transition count 69
Applied a total of 22 rules in 20 ms. Remains 80 /91 variables (removed 11) and now considering 69/80 (removed 11) transitions.
// Phase 1: matrix 69 rows 80 cols
[2024-05-21 02:27:19] [INFO ] Computed 18 invariants in 0 ms
[2024-05-21 02:27:19] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 02:27:19] [INFO ] Invariant cache hit.
[2024-05-21 02:27:19] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 80/412 places, 69/403 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 397 ms. Remains : 80/412 places, 69/403 transitions.
[2024-05-21 02:27:19] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:27:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:27:19] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-21 02:27:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:27:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:27:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9275663878749300930.gal : 1 ms
[2024-05-21 02:27:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality7802390713816555466.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/CTLCardinality9275663878749300930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7802390713816555466.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(((p332==0) + ((AG((p379==0)) * (p284==0)) * (p411==1))))
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !((p332==0))),TRUE) * !((p379==0)))] = FALSE * [((FwdU(Init,TRUE) * !((p332==0))) * ...241
(forward)formula 0,0,0.022773,4188,1,0,11,1895,11,4,400,1835,2
FORMULA AutoFlight-PT-05b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 391 transition count 382
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 391 transition count 382
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 391 transition count 379
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 385 transition count 373
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 385 transition count 373
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 382 transition count 370
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 382 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 379 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 379 transition count 367
Applied a total of 69 rules in 64 ms. Remains 379 /412 variables (removed 33) and now considering 367/403 (removed 36) transitions.
// Phase 1: matrix 367 rows 379 cols
[2024-05-21 02:27:20] [INFO ] Computed 34 invariants in 6 ms
[2024-05-21 02:27:20] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 02:27:20] [INFO ] Invariant cache hit.
[2024-05-21 02:27:20] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-05-21 02:27:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:27:29] [INFO ] Deduced a trap composed of 59 places in 300 ms of which 6 ms to minimize.
[2024-05-21 02:27:29] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 6 ms to minimize.
[2024-05-21 02:27:30] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 6 ms to minimize.
[2024-05-21 02:27:30] [INFO ] Deduced a trap composed of 54 places in 309 ms of which 6 ms to minimize.
[2024-05-21 02:27:30] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 6 ms to minimize.
[2024-05-21 02:27:30] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 5 ms to minimize.
[2024-05-21 02:27:31] [INFO ] Deduced a trap composed of 63 places in 289 ms of which 6 ms to minimize.
[2024-05-21 02:27:31] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 5 ms to minimize.
[2024-05-21 02:27:31] [INFO ] Deduced a trap composed of 60 places in 280 ms of which 5 ms to minimize.
[2024-05-21 02:27:32] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 5 ms to minimize.
[2024-05-21 02:27:32] [INFO ] Deduced a trap composed of 58 places in 263 ms of which 6 ms to minimize.
[2024-05-21 02:27:32] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 5 ms to minimize.
[2024-05-21 02:27:32] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 5 ms to minimize.
[2024-05-21 02:27:33] [INFO ] Deduced a trap composed of 16 places in 291 ms of which 6 ms to minimize.
[2024-05-21 02:27:33] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-21 02:27:33] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 5 ms to minimize.
[2024-05-21 02:27:34] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 5 ms to minimize.
[2024-05-21 02:27:34] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-21 02:27:34] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 3 ms to minimize.
[2024-05-21 02:27:34] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:27:40] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 5 ms to minimize.
[2024-05-21 02:27:40] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 5 ms to minimize.
[2024-05-21 02:27:40] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 4 ms to minimize.
[2024-05-21 02:27:40] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 5 ms to minimize.
[2024-05-21 02:27:41] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 4 ms to minimize.
[2024-05-21 02:27:41] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 5 ms to minimize.
[2024-05-21 02:27:41] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 4 ms to minimize.
[2024-05-21 02:27:42] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 5 ms to minimize.
[2024-05-21 02:27:42] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-21 02:27:42] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 5 ms to minimize.
[2024-05-21 02:27:44] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 5 ms to minimize.
[2024-05-21 02:27:44] [INFO ] Deduced a trap composed of 58 places in 235 ms of which 5 ms to minimize.
[2024-05-21 02:27:45] [INFO ] Deduced a trap composed of 71 places in 224 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:27:48] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-05-21 02:27:48] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-21 02:27:49] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 4 ms to minimize.
[2024-05-21 02:27:50] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 4 ms to minimize.
[2024-05-21 02:27:50] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:27:50] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 4 ms to minimize.
[2024-05-21 02:27:50] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 4 ms to minimize.
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 30082ms
Starting structural reductions in LTL mode, iteration 1 : 379/412 places, 367/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30736 ms. Remains : 379/412 places, 367/403 transitions.
[2024-05-21 02:27:50] [INFO ] Flatten gal took : 22 ms
[2024-05-21 02:27:50] [INFO ] Flatten gal took : 20 ms
[2024-05-21 02:27:50] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-21 02:27:50] [INFO ] Flatten gal took : 21 ms
[2024-05-21 02:27:50] [INFO ] Flatten gal took : 20 ms
[2024-05-21 02:27:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality12240384053263916513.gal : 4 ms
[2024-05-21 02:27:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality16391709107072975112.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/CTLCardinality12240384053263916513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16391709107072975112.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.
Detected timeout of ITS tools.
[2024-05-21 02:28:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:28:20] [INFO ] Applying decomposition
[2024-05-21 02:28:20] [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/graph12126086311602957177.txt' '-o' '/tmp/graph12126086311602957177.bin' '-w' '/tmp/graph12126086311602957177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12126086311602957177.bin' '-l' '-1' '-v' '-w' '/tmp/graph12126086311602957177.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:28:20] [INFO ] Decomposing Gal with order
[2024-05-21 02:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:28:21] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-21 02:28:21] [INFO ] Flatten gal took : 48 ms
[2024-05-21 02:28:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 02:28:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality15353167658636395326.gal : 17 ms
[2024-05-21 02:28:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality2151388383179011251.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/CTLCardinality15353167658636395326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2151388383179011251.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,7.5224e+27,1.36936,38660,7368,22,75668,306,730,95050,42,515,0


Converting to forward existential form...Done !
original formula: EG((EG(((i9.i0.u31.p98==1)||(i5.u14.p35==0))) + EF(AX(AX((i2.i0.u64.p224==1))))))
=> equivalent forward existential formula: [FwdG(Init,(EG(((i9.i0.u31.p98==1)||(i5.u14.p35==0))) + E(TRUE U !(EX(!(!(EX(!((i2.i0.u64.p224==1))))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t124, t127, t137, t140, t163, t166, t215, t237, t260, t275, t354, t355, t356, t358, t359, i0....935
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 392 transition count 383
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 392 transition count 383
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 392 transition count 380
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 386 transition count 374
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 386 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 385 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 385 transition count 373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 384 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 384 transition count 372
Applied a total of 59 rules in 53 ms. Remains 384 /412 variables (removed 28) and now considering 372/403 (removed 31) transitions.
// Phase 1: matrix 372 rows 384 cols
[2024-05-21 02:28:51] [INFO ] Computed 34 invariants in 4 ms
[2024-05-21 02:28:51] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 02:28:51] [INFO ] Invariant cache hit.
[2024-05-21 02:28:51] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-05-21 02:28:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/384 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:29:00] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 7 ms to minimize.
[2024-05-21 02:29:01] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 6 ms to minimize.
[2024-05-21 02:29:01] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 6 ms to minimize.
[2024-05-21 02:29:01] [INFO ] Deduced a trap composed of 57 places in 251 ms of which 5 ms to minimize.
[2024-05-21 02:29:02] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 6 ms to minimize.
[2024-05-21 02:29:02] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 6 ms to minimize.
[2024-05-21 02:29:02] [INFO ] Deduced a trap composed of 72 places in 275 ms of which 6 ms to minimize.
[2024-05-21 02:29:03] [INFO ] Deduced a trap composed of 52 places in 327 ms of which 6 ms to minimize.
[2024-05-21 02:29:03] [INFO ] Deduced a trap composed of 64 places in 296 ms of which 6 ms to minimize.
[2024-05-21 02:29:03] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 6 ms to minimize.
[2024-05-21 02:29:04] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 6 ms to minimize.
[2024-05-21 02:29:04] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 4 ms to minimize.
[2024-05-21 02:29:04] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 5 ms to minimize.
[2024-05-21 02:29:04] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 4 ms to minimize.
[2024-05-21 02:29:05] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 4 ms to minimize.
[2024-05-21 02:29:05] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 4 ms to minimize.
[2024-05-21 02:29:05] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 3 ms to minimize.
[2024-05-21 02:29:05] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 3 ms to minimize.
[2024-05-21 02:29:06] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 4 ms to minimize.
[2024-05-21 02:29:06] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:29:12] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 5 ms to minimize.
[2024-05-21 02:29:12] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-21 02:29:12] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-21 02:29:12] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 4 ms to minimize.
[2024-05-21 02:29:12] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 4 ms to minimize.
[2024-05-21 02:29:13] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 4 ms to minimize.
[2024-05-21 02:29:13] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:29:13] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:29:15] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 6 ms to minimize.
[2024-05-21 02:29:15] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 4 ms to minimize.
[2024-05-21 02:29:15] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 5 ms to minimize.
[2024-05-21 02:29:16] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 4 ms to minimize.
[2024-05-21 02:29:16] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 4 ms to minimize.
[2024-05-21 02:29:16] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 6 ms to minimize.
[2024-05-21 02:29:17] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 4 ms to minimize.
[2024-05-21 02:29:17] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 5 ms to minimize.
[2024-05-21 02:29:17] [INFO ] Deduced a trap composed of 61 places in 236 ms of which 5 ms to minimize.
[2024-05-21 02:29:17] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 5 ms to minimize.
[2024-05-21 02:29:18] [INFO ] Deduced a trap composed of 60 places in 239 ms of which 5 ms to minimize.
[2024-05-21 02:29:18] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:29:19] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 5 ms to minimize.
[2024-05-21 02:29:19] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 5 ms to minimize.
[2024-05-21 02:29:19] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 5 ms to minimize.
[2024-05-21 02:29:20] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 4 ms to minimize.
[2024-05-21 02:29:20] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 4 ms to minimize.
[2024-05-21 02:29:21] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-21 02:29:21] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 3 ms to minimize.
[2024-05-21 02:29:21] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 5 ms to minimize.
[2024-05-21 02:29:21] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 5 ms to minimize.
[2024-05-21 02:29:22] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 4 ms to minimize.
SMT process timed out in 30150ms, After SMT, problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 30161ms
Starting structural reductions in LTL mode, iteration 1 : 384/412 places, 372/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30836 ms. Remains : 384/412 places, 372/403 transitions.
[2024-05-21 02:29:22] [INFO ] Flatten gal took : 17 ms
[2024-05-21 02:29:22] [INFO ] Flatten gal took : 17 ms
[2024-05-21 02:29:22] [INFO ] Input system was already deterministic with 372 transitions.
[2024-05-21 02:29:22] [INFO ] Flatten gal took : 17 ms
[2024-05-21 02:29:22] [INFO ] Flatten gal took : 16 ms
[2024-05-21 02:29:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality9082747510548583620.gal : 4 ms
[2024-05-21 02:29:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality13125320988403074033.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/CTLCardinality9082747510548583620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13125320988403074033.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.
Detected timeout of ITS tools.
[2024-05-21 02:29:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 02:29:52] [INFO ] Applying decomposition
[2024-05-21 02:29:52] [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/graph12149061142114918270.txt' '-o' '/tmp/graph12149061142114918270.bin' '-w' '/tmp/graph12149061142114918270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12149061142114918270.bin' '-l' '-1' '-v' '-w' '/tmp/graph12149061142114918270.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:29:52] [INFO ] Decomposing Gal with order
[2024-05-21 02:29:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:29:52] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 02:29:52] [INFO ] Flatten gal took : 40 ms
[2024-05-21 02:29:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 02:29:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14308450166785310993.gal : 8 ms
[2024-05-21 02:29:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality9925684195287952975.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/CTLCardinality14308450166785310993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9925684195287952975.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,7.16682e+27,2.04489,57828,8292,23,112146,295,622,158435,36,648,0


Converting to forward existential form...Done !
original formula: EG(AX(((i11.u56.p180==0)||((i5.u24.p63==0)&&(i12.u60.p194==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((i11.u56.p180==0)||((i5.u24.p63==0)&&(i12.u60.p194==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t114, t124, t127, t137, t140, t153, t191, t217, t261, t280, t358, t359, t360, t361, t362, t36...906
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 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 391 transition count 382
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 391 transition count 382
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 391 transition count 379
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 385 transition count 373
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 385 transition count 373
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 382 transition count 370
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 382 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 379 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 379 transition count 367
Applied a total of 69 rules in 45 ms. Remains 379 /412 variables (removed 33) and now considering 367/403 (removed 36) transitions.
// Phase 1: matrix 367 rows 379 cols
[2024-05-21 02:30:22] [INFO ] Computed 34 invariants in 6 ms
[2024-05-21 02:30:22] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 02:30:22] [INFO ] Invariant cache hit.
[2024-05-21 02:30:23] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-05-21 02:30:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:30:33] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 7 ms to minimize.
[2024-05-21 02:30:33] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 6 ms to minimize.
[2024-05-21 02:30:34] [INFO ] Deduced a trap composed of 56 places in 355 ms of which 6 ms to minimize.
[2024-05-21 02:30:34] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 5 ms to minimize.
[2024-05-21 02:30:34] [INFO ] Deduced a trap composed of 18 places in 345 ms of which 6 ms to minimize.
[2024-05-21 02:30:35] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 7 ms to minimize.
[2024-05-21 02:30:35] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 5 ms to minimize.
[2024-05-21 02:30:35] [INFO ] Deduced a trap composed of 55 places in 293 ms of which 6 ms to minimize.
[2024-05-21 02:30:36] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 5 ms to minimize.
[2024-05-21 02:30:36] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 5 ms to minimize.
[2024-05-21 02:30:36] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 3 ms to minimize.
[2024-05-21 02:30:36] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 3 ms to minimize.
[2024-05-21 02:30:37] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 5 ms to minimize.
[2024-05-21 02:30:37] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 5 ms to minimize.
[2024-05-21 02:30:38] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 5 ms to minimize.
[2024-05-21 02:30:38] [INFO ] Deduced a trap composed of 20 places in 285 ms of which 5 ms to minimize.
[2024-05-21 02:30:38] [INFO ] Deduced a trap composed of 57 places in 254 ms of which 5 ms to minimize.
[2024-05-21 02:30:38] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 5 ms to minimize.
[2024-05-21 02:30:39] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 5 ms to minimize.
[2024-05-21 02:30:40] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:30:45] [INFO ] Deduced a trap composed of 52 places in 249 ms of which 5 ms to minimize.
[2024-05-21 02:30:45] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 5 ms to minimize.
[2024-05-21 02:30:45] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 4 ms to minimize.
[2024-05-21 02:30:46] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 5 ms to minimize.
[2024-05-21 02:30:46] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 4 ms to minimize.
[2024-05-21 02:30:46] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 5 ms to minimize.
[2024-05-21 02:30:46] [INFO ] Deduced a trap composed of 60 places in 293 ms of which 6 ms to minimize.
[2024-05-21 02:30:47] [INFO ] Deduced a trap composed of 58 places in 271 ms of which 6 ms to minimize.
[2024-05-21 02:30:47] [INFO ] Deduced a trap composed of 62 places in 275 ms of which 5 ms to minimize.
[2024-05-21 02:30:47] [INFO ] Deduced a trap composed of 83 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:30:48] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 5 ms to minimize.
[2024-05-21 02:30:48] [INFO ] Deduced a trap composed of 68 places in 237 ms of which 5 ms to minimize.
[2024-05-21 02:30:48] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 5 ms to minimize.
[2024-05-21 02:30:48] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 6 ms to minimize.
[2024-05-21 02:30:49] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 5 ms to minimize.
[2024-05-21 02:30:49] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 5 ms to minimize.
[2024-05-21 02:30:49] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 5 ms to minimize.
[2024-05-21 02:30:49] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 4 ms to minimize.
[2024-05-21 02:30:50] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 4 ms to minimize.
[2024-05-21 02:30:50] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:30:51] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 4 ms to minimize.
[2024-05-21 02:30:52] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 4 ms to minimize.
[2024-05-21 02:30:52] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 4 ms to minimize.
[2024-05-21 02:30:52] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 4 ms to minimize.
[2024-05-21 02:30:52] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 4 ms to minimize.
[2024-05-21 02:30:53] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:30:53] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 4 ms to minimize.
[2024-05-21 02:30:53] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 4 ms to minimize.
SMT process timed out in 30210ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Starting structural reductions in LTL mode, iteration 1 : 379/412 places, 367/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31204 ms. Remains : 379/412 places, 367/403 transitions.
[2024-05-21 02:30:53] [INFO ] Flatten gal took : 17 ms
[2024-05-21 02:30:53] [INFO ] Flatten gal took : 17 ms
[2024-05-21 02:30:53] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-21 02:30:53] [INFO ] Flatten gal took : 14 ms
[2024-05-21 02:30:53] [INFO ] Flatten gal took : 15 ms
[2024-05-21 02:30:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality8637798809475530371.gal : 4 ms
[2024-05-21 02:30:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality7685198315761272508.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/CTLCardinality8637798809475530371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7685198315761272508.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.
Detected timeout of ITS tools.
[2024-05-21 02:31:23] [INFO ] Flatten gal took : 9 ms
[2024-05-21 02:31:23] [INFO ] Applying decomposition
[2024-05-21 02:31:23] [INFO ] Flatten gal took : 9 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/graph11424521543982987774.txt' '-o' '/tmp/graph11424521543982987774.bin' '-w' '/tmp/graph11424521543982987774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11424521543982987774.bin' '-l' '-1' '-v' '-w' '/tmp/graph11424521543982987774.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:31:23] [INFO ] Decomposing Gal with order
[2024-05-21 02:31:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:31:23] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 02:31:24] [INFO ] Flatten gal took : 40 ms
[2024-05-21 02:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:31:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality12876277236025135810.gal : 7 ms
[2024-05-21 02:31:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4039337358226005181.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/CTLCardinality12876277236025135810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4039337358226005181.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,7.62768e+27,1.53475,37880,5100,21,67151,299,734,101027,38,653,0


Converting to forward existential form...Done !
original formula: AG(((i16.i1.u109.p354==0) * (!(E(AX(((i9.i0.u47.p177==0)||(i5.u21.p70==1))) U (i16.i0.u106.p348==1))) + !(A(AX(((i21.i0.u32.p111==0)||(i2...227
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((i16.i1.u109.p354==0)))] = FALSE * [(FwdU((FwdU(Init,TRUE) * !(!(!((E(!(EX(((i12.i1.u65.p...443
Reverse transition relation is NOT exact ! Due to transitions t111, t114, t137, t140, t163, t166, t186, t193, t216, t238, t260, t275, t354, t355, t356, t35...938
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 411 transition count 255
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 167 rules applied. Total rules applied 314 place count 264 transition count 235
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 324 place count 254 transition count 235
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 324 place count 254 transition count 184
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 426 place count 203 transition count 184
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 442 place count 187 transition count 168
Iterating global reduction 3 with 16 rules applied. Total rules applied 458 place count 187 transition count 168
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 458 place count 187 transition count 161
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 472 place count 180 transition count 161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 584 place count 124 transition count 105
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 591 place count 124 transition count 98
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 605 place count 117 transition count 91
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 606 place count 117 transition count 91
Applied a total of 606 rules in 43 ms. Remains 117 /412 variables (removed 295) and now considering 91/403 (removed 312) transitions.
// Phase 1: matrix 91 rows 117 cols
[2024-05-21 02:31:54] [INFO ] Computed 34 invariants in 1 ms
[2024-05-21 02:31:54] [INFO ] Implicit Places using invariants in 145 ms returned [38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 68, 85, 91, 97, 103, 109, 116]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 146 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 100/412 places, 91/403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 100 transition count 81
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 90 transition count 81
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 85 transition count 76
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 85 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 83 transition count 74
Applied a total of 34 rules in 8 ms. Remains 83 /100 variables (removed 17) and now considering 74/91 (removed 17) transitions.
// Phase 1: matrix 74 rows 83 cols
[2024-05-21 02:31:54] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 02:31:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 02:31:54] [INFO ] Invariant cache hit.
[2024-05-21 02:31:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 02:31:54] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 83/412 places, 74/403 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 415 ms. Remains : 83/412 places, 74/403 transitions.
[2024-05-21 02:31:54] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:31:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:31:54] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 02:31:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:31:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:31:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16223070008832562968.gal : 1 ms
[2024-05-21 02:31:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality17084727693360421549.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/CTLCardinality16223070008832562968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17084727693360421549.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.75736e+07,0.03688,4500,2,730,5,4232,6,0,408,3850,0


Converting to forward existential form...Done !
original formula: EG(((AF((p307!=1)) + (p346==0)) + AG((p122==0))))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((p307!=1)))) + (p346==0)) + !(E(TRUE U !((p122==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t62, t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,1,0.585876,19188,1,0,219,88973,181,92,2580,60668,287
FORMULA AutoFlight-PT-05b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 391 transition count 382
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 391 transition count 382
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 391 transition count 379
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 385 transition count 373
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 385 transition count 373
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 383 transition count 371
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 383 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 381 transition count 369
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 381 transition count 369
Applied a total of 65 rules in 78 ms. Remains 381 /412 variables (removed 31) and now considering 369/403 (removed 34) transitions.
// Phase 1: matrix 369 rows 381 cols
[2024-05-21 02:31:55] [INFO ] Computed 34 invariants in 6 ms
[2024-05-21 02:31:55] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 02:31:55] [INFO ] Invariant cache hit.
[2024-05-21 02:31:55] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-21 02:31:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:32:05] [INFO ] Deduced a trap composed of 54 places in 406 ms of which 7 ms to minimize.
[2024-05-21 02:32:05] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 6 ms to minimize.
[2024-05-21 02:32:06] [INFO ] Deduced a trap composed of 16 places in 348 ms of which 6 ms to minimize.
[2024-05-21 02:32:06] [INFO ] Deduced a trap composed of 59 places in 353 ms of which 6 ms to minimize.
[2024-05-21 02:32:06] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 5 ms to minimize.
[2024-05-21 02:32:07] [INFO ] Deduced a trap composed of 55 places in 300 ms of which 5 ms to minimize.
[2024-05-21 02:32:07] [INFO ] Deduced a trap composed of 73 places in 311 ms of which 5 ms to minimize.
[2024-05-21 02:32:07] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 5 ms to minimize.
[2024-05-21 02:32:08] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 5 ms to minimize.
[2024-05-21 02:32:08] [INFO ] Deduced a trap composed of 53 places in 265 ms of which 5 ms to minimize.
[2024-05-21 02:32:08] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:32:08] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 5 ms to minimize.
[2024-05-21 02:32:09] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 5 ms to minimize.
[2024-05-21 02:32:09] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 5 ms to minimize.
[2024-05-21 02:32:09] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 5 ms to minimize.
[2024-05-21 02:32:09] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 5 ms to minimize.
[2024-05-21 02:32:10] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 5 ms to minimize.
[2024-05-21 02:32:10] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 5 ms to minimize.
[2024-05-21 02:32:10] [INFO ] Deduced a trap composed of 54 places in 373 ms of which 7 ms to minimize.
[2024-05-21 02:32:11] [INFO ] Deduced a trap composed of 62 places in 337 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:32:16] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 6 ms to minimize.
[2024-05-21 02:32:16] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 5 ms to minimize.
[2024-05-21 02:32:16] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 5 ms to minimize.
[2024-05-21 02:32:17] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:32:17] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 4 ms to minimize.
[2024-05-21 02:32:17] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 4 ms to minimize.
[2024-05-21 02:32:17] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 4 ms to minimize.
[2024-05-21 02:32:18] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 4 ms to minimize.
[2024-05-21 02:32:18] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 4 ms to minimize.
[2024-05-21 02:32:18] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2024-05-21 02:32:18] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-05-21 02:32:19] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 5 ms to minimize.
[2024-05-21 02:32:19] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 5 ms to minimize.
[2024-05-21 02:32:19] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 4 ms to minimize.
[2024-05-21 02:32:19] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 4 ms to minimize.
[2024-05-21 02:32:20] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 5 ms to minimize.
[2024-05-21 02:32:20] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 4 ms to minimize.
[2024-05-21 02:32:20] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 02:32:21] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 5 ms to minimize.
[2024-05-21 02:32:21] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:32:22] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 4 ms to minimize.
[2024-05-21 02:32:22] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 4 ms to minimize.
[2024-05-21 02:32:23] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 4 ms to minimize.
[2024-05-21 02:32:23] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 4 ms to minimize.
[2024-05-21 02:32:23] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:32:24] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 4 ms to minimize.
[2024-05-21 02:32:24] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 3 ms to minimize.
[2024-05-21 02:32:24] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 4 ms to minimize.
[2024-05-21 02:32:24] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-05-21 02:32:24] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 4 ms to minimize.
[2024-05-21 02:32:25] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 4 ms to minimize.
[2024-05-21 02:32:25] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 4 ms to minimize.
[2024-05-21 02:32:25] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 5 ms to minimize.
[2024-05-21 02:32:25] [INFO ] Deduced a trap composed of 83 places in 208 ms of which 4 ms to minimize.
SMT process timed out in 30047ms, After SMT, problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 30052ms
Starting structural reductions in LTL mode, iteration 1 : 381/412 places, 369/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30854 ms. Remains : 381/412 places, 369/403 transitions.
[2024-05-21 02:32:25] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:32:25] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:32:26] [INFO ] Input system was already deterministic with 369 transitions.
[2024-05-21 02:32:26] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:32:26] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:32:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality7843829694478234484.gal : 4 ms
[2024-05-21 02:32:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality3842454592337467176.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/CTLCardinality7843829694478234484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3842454592337467176.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.
Detected timeout of ITS tools.
[2024-05-21 02:32:56] [INFO ] Flatten gal took : 7 ms
[2024-05-21 02:32:56] [INFO ] Applying decomposition
[2024-05-21 02:32:56] [INFO ] Flatten gal took : 8 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/graph10979957190607619948.txt' '-o' '/tmp/graph10979957190607619948.bin' '-w' '/tmp/graph10979957190607619948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10979957190607619948.bin' '-l' '-1' '-v' '-w' '/tmp/graph10979957190607619948.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:32:56] [INFO ] Decomposing Gal with order
[2024-05-21 02:32:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:32:56] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-21 02:32:56] [INFO ] Flatten gal took : 20 ms
[2024-05-21 02:32:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:32:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6286980949032366163.gal : 16 ms
[2024-05-21 02:32:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality7946628491503203738.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/CTLCardinality6286980949032366163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7946628491503203738.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,7.04497e+27,1.34551,40680,9106,16,75006,244,712,109078,35,527,0


Converting to forward existential form...Done !
original formula: AX((AX(((i6.i0.u33.p102==1) + (AX(((i3.u14.p37==0)||(i8.u102.p343==1))) * AX((i13.i2.u77.p270==1))))) + AF((i9.i1.u45.p151==1))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!(EX(!(((i6.i0.u33.p102==1) + (!(EX(!(((i3.u14.p37==0)||(i8.u102.p343==1))))) * !(EX(!((i13....213
Reverse transition relation is NOT exact ! Due to transitions t111, t114, t124, t127, t150, t153, t184, t191, t206, t213, t276, t356, t357, t358, t359, t36...965
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 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 393 transition count 384
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 393 transition count 384
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 393 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 386 transition count 375
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 386 transition count 375
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 383 transition count 372
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 383 transition count 372
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 381 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 381 transition count 370
Applied a total of 64 rules in 40 ms. Remains 381 /412 variables (removed 31) and now considering 370/403 (removed 33) transitions.
// Phase 1: matrix 370 rows 381 cols
[2024-05-21 02:33:26] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 02:33:26] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 02:33:26] [INFO ] Invariant cache hit.
[2024-05-21 02:33:26] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-05-21 02:33:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:33:36] [INFO ] Deduced a trap composed of 61 places in 352 ms of which 6 ms to minimize.
[2024-05-21 02:33:37] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 6 ms to minimize.
[2024-05-21 02:33:37] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 6 ms to minimize.
[2024-05-21 02:33:37] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 6 ms to minimize.
[2024-05-21 02:33:37] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 5 ms to minimize.
[2024-05-21 02:33:38] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 6 ms to minimize.
[2024-05-21 02:33:38] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:33:38] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 5 ms to minimize.
[2024-05-21 02:33:39] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 5 ms to minimize.
[2024-05-21 02:33:39] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 4 ms to minimize.
[2024-05-21 02:33:39] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 4 ms to minimize.
[2024-05-21 02:33:40] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 4 ms to minimize.
[2024-05-21 02:33:40] [INFO ] Deduced a trap composed of 56 places in 253 ms of which 4 ms to minimize.
[2024-05-21 02:33:40] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 5 ms to minimize.
[2024-05-21 02:33:40] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 4 ms to minimize.
[2024-05-21 02:33:40] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 4 ms to minimize.
[2024-05-21 02:33:41] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 4 ms to minimize.
[2024-05-21 02:33:41] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 5 ms to minimize.
[2024-05-21 02:33:41] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 5 ms to minimize.
[2024-05-21 02:33:42] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:33:47] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 5 ms to minimize.
[2024-05-21 02:33:47] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 5 ms to minimize.
[2024-05-21 02:33:47] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 5 ms to minimize.
[2024-05-21 02:33:48] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 5 ms to minimize.
[2024-05-21 02:33:48] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 4 ms to minimize.
[2024-05-21 02:33:48] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 4 ms to minimize.
[2024-05-21 02:33:48] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 3 ms to minimize.
[2024-05-21 02:33:48] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2024-05-21 02:33:49] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 4 ms to minimize.
[2024-05-21 02:33:49] [INFO ] Deduced a trap composed of 47 places in 324 ms of which 5 ms to minimize.
[2024-05-21 02:33:49] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 4 ms to minimize.
[2024-05-21 02:33:50] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 5 ms to minimize.
[2024-05-21 02:33:50] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 4 ms to minimize.
[2024-05-21 02:33:50] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 5 ms to minimize.
[2024-05-21 02:33:51] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 4 ms to minimize.
[2024-05-21 02:33:51] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 4 ms to minimize.
[2024-05-21 02:33:51] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 4 ms to minimize.
[2024-05-21 02:33:51] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 4 ms to minimize.
[2024-05-21 02:33:52] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 4 ms to minimize.
[2024-05-21 02:33:52] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:33:53] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-21 02:33:53] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-21 02:33:54] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 4 ms to minimize.
[2024-05-21 02:33:54] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-05-21 02:33:54] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 4 ms to minimize.
[2024-05-21 02:33:54] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 3 ms to minimize.
[2024-05-21 02:33:55] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 4 ms to minimize.
[2024-05-21 02:33:55] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 3 ms to minimize.
[2024-05-21 02:33:55] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 5 ms to minimize.
[2024-05-21 02:33:56] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 5 ms to minimize.
[2024-05-21 02:33:56] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/751 variables, and 85 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 51/85 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:34:02] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 5 ms to minimize.
[2024-05-21 02:34:02] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 4 ms to minimize.
[2024-05-21 02:34:02] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 4 ms to minimize.
[2024-05-21 02:34:03] [INFO ] Deduced a trap composed of 57 places in 211 ms of which 5 ms to minimize.
[2024-05-21 02:34:04] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:34:04] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 4 ms to minimize.
[2024-05-21 02:34:04] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 3 ms to minimize.
[2024-05-21 02:34:05] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 5 ms to minimize.
[2024-05-21 02:34:05] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:34:05] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 4 ms to minimize.
[2024-05-21 02:34:05] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 4 ms to minimize.
[2024-05-21 02:34:05] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 4 ms to minimize.
[2024-05-21 02:34:06] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 4 ms to minimize.
[2024-05-21 02:34:08] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 4 ms to minimize.
[2024-05-21 02:34:09] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:34:11] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-05-21 02:34:12] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 4 ms to minimize.
[2024-05-21 02:34:12] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 4 ms to minimize.
[2024-05-21 02:34:12] [INFO ] Deduced a trap composed of 68 places in 188 ms of which 4 ms to minimize.
[2024-05-21 02:34:12] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2024-05-21 02:34:13] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 4 ms to minimize.
[2024-05-21 02:34:14] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 4 ms to minimize.
[2024-05-21 02:34:15] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:34:19] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 8 ms to minimize.
[2024-05-21 02:34:21] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 4 ms to minimize.
[2024-05-21 02:34:21] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:34:25] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/751 variables, and 112 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 0/369 constraints, Known Traps: 78/78 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 381/412 places, 370/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 381/412 places, 370/403 transitions.
[2024-05-21 02:34:27] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:34:27] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:34:27] [INFO ] Input system was already deterministic with 370 transitions.
[2024-05-21 02:34:27] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:34:27] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:34:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality9111033062465965458.gal : 4 ms
[2024-05-21 02:34:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality4209084075262335435.ctl : 7 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/CTLCardinality9111033062465965458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4209084075262335435.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.
Detected timeout of ITS tools.
[2024-05-21 02:34:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:34:57] [INFO ] Applying decomposition
[2024-05-21 02:34:57] [INFO ] Flatten gal took : 8 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/graph5813399792960613429.txt' '-o' '/tmp/graph5813399792960613429.bin' '-w' '/tmp/graph5813399792960613429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5813399792960613429.bin' '-l' '-1' '-v' '-w' '/tmp/graph5813399792960613429.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:34:57] [INFO ] Decomposing Gal with order
[2024-05-21 02:34:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:34:57] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 02:34:57] [INFO ] Flatten gal took : 19 ms
[2024-05-21 02:34:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:34:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality3094300014824337046.gal : 5 ms
[2024-05-21 02:34:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10221237321505015290.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/CTLCardinality3094300014824337046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10221237321505015290.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,8.32602e+27,2.32769,68612,11747,24,133516,296,703,201378,46,677,0


Converting to forward existential form...Done !
original formula: (EF(EX((AF(((i24.i1.u139.p427==1)&&(i11.u45.p156==1))) * EF(((i24.i3.u161.p478==0)||(i4.u26.p82==1)))))) + AG(AX(((EF((i12.u102.p342==0))...226
=> equivalent forward existential formula: (([(EY(FwdU((Init * !(E(TRUE U EX((!(EG(!(((i24.i1.u139.p427==1)&&(i11.u45.p156==1))))) * E(TRUE U ((i24.i3.u161...639
Reverse transition relation is NOT exact ! Due to transitions t126, t129, t152, t155, t186, t216, t231, t238, t253, t262, t278, t356, t357, t358, t359, t36...954
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 390 transition count 381
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 390 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 390 transition count 379
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 382 transition count 371
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 382 transition count 371
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 379 transition count 368
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 379 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 376 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 376 transition count 365
Applied a total of 74 rules in 35 ms. Remains 376 /412 variables (removed 36) and now considering 365/403 (removed 38) transitions.
// Phase 1: matrix 365 rows 376 cols
[2024-05-21 02:35:27] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 02:35:27] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 02:35:27] [INFO ] Invariant cache hit.
[2024-05-21 02:35:27] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-05-21 02:35:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 02:35:37] [INFO ] Deduced a trap composed of 21 places in 348 ms of which 6 ms to minimize.
[2024-05-21 02:35:37] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 6 ms to minimize.
[2024-05-21 02:35:38] [INFO ] Deduced a trap composed of 16 places in 342 ms of which 6 ms to minimize.
[2024-05-21 02:35:38] [INFO ] Deduced a trap composed of 55 places in 308 ms of which 5 ms to minimize.
[2024-05-21 02:35:38] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 5 ms to minimize.
[2024-05-21 02:35:39] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:35:39] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 6 ms to minimize.
[2024-05-21 02:35:39] [INFO ] Deduced a trap composed of 69 places in 281 ms of which 5 ms to minimize.
[2024-05-21 02:35:39] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 5 ms to minimize.
[2024-05-21 02:35:40] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 4 ms to minimize.
[2024-05-21 02:35:40] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 5 ms to minimize.
[2024-05-21 02:35:40] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 5 ms to minimize.
[2024-05-21 02:35:40] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 5 ms to minimize.
[2024-05-21 02:35:41] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 4 ms to minimize.
[2024-05-21 02:35:41] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 5 ms to minimize.
[2024-05-21 02:35:41] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 5 ms to minimize.
[2024-05-21 02:35:41] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 4 ms to minimize.
[2024-05-21 02:35:42] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 5 ms to minimize.
[2024-05-21 02:35:42] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 6 ms to minimize.
[2024-05-21 02:35:42] [INFO ] Deduced a trap composed of 61 places in 224 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 02:35:47] [INFO ] Deduced a trap composed of 79 places in 284 ms of which 5 ms to minimize.
[2024-05-21 02:35:48] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 5 ms to minimize.
[2024-05-21 02:35:48] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 5 ms to minimize.
[2024-05-21 02:35:48] [INFO ] Deduced a trap composed of 55 places in 274 ms of which 5 ms to minimize.
[2024-05-21 02:35:49] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 4 ms to minimize.
[2024-05-21 02:35:49] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 5 ms to minimize.
[2024-05-21 02:35:49] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:35:50] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 5 ms to minimize.
[2024-05-21 02:35:51] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 5 ms to minimize.
[2024-05-21 02:35:51] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 5 ms to minimize.
[2024-05-21 02:35:52] [INFO ] Deduced a trap composed of 62 places in 235 ms of which 5 ms to minimize.
[2024-05-21 02:35:52] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 4 ms to minimize.
[2024-05-21 02:35:52] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 4 ms to minimize.
[2024-05-21 02:35:53] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 5 ms to minimize.
[2024-05-21 02:35:53] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 4 ms to minimize.
[2024-05-21 02:35:53] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 4 ms to minimize.
[2024-05-21 02:35:53] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 3 ms to minimize.
[2024-05-21 02:35:54] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 4 ms to minimize.
[2024-05-21 02:35:54] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-05-21 02:35:55] [INFO ] Deduced a trap composed of 84 places in 212 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 02:35:56] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 4 ms to minimize.
[2024-05-21 02:35:56] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2024-05-21 02:35:56] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-21 02:35:57] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/741 variables, and 78 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 02:36:03] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 4 ms to minimize.
[2024-05-21 02:36:04] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 5 ms to minimize.
[2024-05-21 02:36:04] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:36:05] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 4 ms to minimize.
[2024-05-21 02:36:06] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 4 ms to minimize.
[2024-05-21 02:36:07] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 5 ms to minimize.
[2024-05-21 02:36:07] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 02:36:10] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 3 ms to minimize.
[2024-05-21 02:36:11] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 4 ms to minimize.
[2024-05-21 02:36:11] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 3 ms to minimize.
[2024-05-21 02:36:11] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-21 02:36:13] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 02:36:16] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-21 02:36:19] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 4 ms to minimize.
[2024-05-21 02:36:19] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-05-21 02:36:20] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-21 02:36:22] [INFO ] Deduced a trap composed of 58 places in 215 ms of which 4 ms to minimize.
[2024-05-21 02:36:23] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:36:23] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:36:24] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/741 variables, and 98 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 0/364 constraints, Known Traps: 64/64 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 376/412 places, 365/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60640 ms. Remains : 376/412 places, 365/403 transitions.
[2024-05-21 02:36:28] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:36:28] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:36:28] [INFO ] Input system was already deterministic with 365 transitions.
[2024-05-21 02:36:28] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:36:28] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:36:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality17091155008927349340.gal : 3 ms
[2024-05-21 02:36:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3031633972751576854.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/CTLCardinality17091155008927349340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3031633972751576854.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.
Detected timeout of ITS tools.
[2024-05-21 02:36:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:36:58] [INFO ] Applying decomposition
[2024-05-21 02:36:58] [INFO ] Flatten gal took : 11 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/graph16173737746138582317.txt' '-o' '/tmp/graph16173737746138582317.bin' '-w' '/tmp/graph16173737746138582317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16173737746138582317.bin' '-l' '-1' '-v' '-w' '/tmp/graph16173737746138582317.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:36:58] [INFO ] Decomposing Gal with order
[2024-05-21 02:36:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:36:58] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 02:36:58] [INFO ] Flatten gal took : 28 ms
[2024-05-21 02:36:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 02:36:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17370500953701661054.gal : 6 ms
[2024-05-21 02:36:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3749952484271148989.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/CTLCardinality17370500953701661054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3749952484271148989.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,6.80606e+27,0.697193,18184,4048,18,29925,284,746,36008,43,573,0


Converting to forward existential form...Done !
original formula: ((EF(AX((i24.i1.u154.p475==1))) + !(E(AX((i4.i2.u24.p79==1)) U AF((i13.i0.u65.p250==1))))) + (EF(AG((i4.i2.u25.p86==1))) + AF(AG(((i24.i1...194
=> equivalent forward existential formula: [FwdG(((Init * !((E(TRUE U !(EX(!((i24.i1.u154.p475==1))))) + !(E(!(EX(!((i4.i2.u24.p79==1)))) U !(EG(!((i13.i0....299
Reverse transition relation is NOT exact ! Due to transitions t113, t136, t139, t149, t152, t183, t190, t205, t212, t227, t234, t258, t273, t352, t353, t35...891
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 390 transition count 381
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 390 transition count 381
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 390 transition count 378
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 382 transition count 370
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 382 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 379 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 379 transition count 367
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 376 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 376 transition count 364
Applied a total of 75 rules in 36 ms. Remains 376 /412 variables (removed 36) and now considering 364/403 (removed 39) transitions.
// Phase 1: matrix 364 rows 376 cols
[2024-05-21 02:37:28] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 02:37:28] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 02:37:28] [INFO ] Invariant cache hit.
[2024-05-21 02:37:28] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-21 02:37:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:38] [INFO ] Deduced a trap composed of 59 places in 335 ms of which 6 ms to minimize.
[2024-05-21 02:37:38] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 6 ms to minimize.
[2024-05-21 02:37:38] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 6 ms to minimize.
[2024-05-21 02:37:39] [INFO ] Deduced a trap composed of 55 places in 260 ms of which 6 ms to minimize.
[2024-05-21 02:37:39] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 4 ms to minimize.
[2024-05-21 02:37:39] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 4 ms to minimize.
[2024-05-21 02:37:39] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 4 ms to minimize.
[2024-05-21 02:37:40] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 4 ms to minimize.
[2024-05-21 02:37:40] [INFO ] Deduced a trap composed of 60 places in 267 ms of which 5 ms to minimize.
[2024-05-21 02:37:40] [INFO ] Deduced a trap composed of 57 places in 244 ms of which 4 ms to minimize.
[2024-05-21 02:37:40] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 5 ms to minimize.
[2024-05-21 02:37:41] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 4 ms to minimize.
[2024-05-21 02:37:41] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 5 ms to minimize.
[2024-05-21 02:37:42] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 4 ms to minimize.
[2024-05-21 02:37:42] [INFO ] Deduced a trap composed of 59 places in 246 ms of which 5 ms to minimize.
[2024-05-21 02:37:42] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 4 ms to minimize.
[2024-05-21 02:37:43] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:52] [INFO ] Deduced a trap composed of 58 places in 257 ms of which 5 ms to minimize.
[2024-05-21 02:37:53] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 7 ms to minimize.
[2024-05-21 02:37:54] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 5 ms to minimize.
[2024-05-21 02:37:55] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:57] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 5 ms to minimize.
[2024-05-21 02:37:58] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 4 ms to minimize.
[2024-05-21 02:37:58] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 4 ms to minimize.
SMT process timed out in 30074ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 30078ms
Starting structural reductions in LTL mode, iteration 1 : 376/412 places, 364/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30634 ms. Remains : 376/412 places, 364/403 transitions.
[2024-05-21 02:37:59] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:37:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:37:59] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-21 02:37:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:37:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:37:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality1922636062420574918.gal : 2 ms
[2024-05-21 02:37:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13254789538819550379.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/CTLCardinality1922636062420574918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13254789538819550379.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.
Detected timeout of ITS tools.
[2024-05-21 02:38:29] [INFO ] Flatten gal took : 7 ms
[2024-05-21 02:38:29] [INFO ] Applying decomposition
[2024-05-21 02:38:29] [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/graph18080749906377746890.txt' '-o' '/tmp/graph18080749906377746890.bin' '-w' '/tmp/graph18080749906377746890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18080749906377746890.bin' '-l' '-1' '-v' '-w' '/tmp/graph18080749906377746890.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:38:29] [INFO ] Decomposing Gal with order
[2024-05-21 02:38:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:38:29] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 02:38:29] [INFO ] Flatten gal took : 16 ms
[2024-05-21 02:38:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:38:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality293577788146480129.gal : 5 ms
[2024-05-21 02:38:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality14900492432311330021.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/CTLCardinality293577788146480129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14900492432311330021.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,5.96629e+27,1.29602,38104,5446,16,74959,246,703,96223,37,502,0


Converting to forward existential form...Done !
original formula: AG(EX((i10.i1.u58.p212==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((i10.i1.u58.p212==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t113, t123, t126, t136, t139, t152, t184, t191, t213, t228, t235, t250, t257, t351, t352, t35...931
(forward)formula 0,0,9.38752,323224,1,0,884112,246,3588,885993,140,502,2455403
FORMULA AutoFlight-PT-05b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 393 transition count 384
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 393 transition count 384
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 393 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 386 transition count 375
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 386 transition count 375
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 383 transition count 372
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 383 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 380 transition count 369
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 380 transition count 369
Applied a total of 66 rules in 36 ms. Remains 380 /412 variables (removed 32) and now considering 369/403 (removed 34) transitions.
// Phase 1: matrix 369 rows 380 cols
[2024-05-21 02:38:38] [INFO ] Computed 34 invariants in 7 ms
[2024-05-21 02:38:38] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 02:38:38] [INFO ] Invariant cache hit.
[2024-05-21 02:38:39] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-21 02:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:38:48] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-21 02:38:48] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 4 ms to minimize.
[2024-05-21 02:38:48] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 3 ms to minimize.
[2024-05-21 02:38:48] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 3 ms to minimize.
[2024-05-21 02:38:48] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-05-21 02:38:49] [INFO ] Deduced a trap composed of 57 places in 335 ms of which 6 ms to minimize.
[2024-05-21 02:38:49] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 6 ms to minimize.
[2024-05-21 02:38:50] [INFO ] Deduced a trap composed of 65 places in 307 ms of which 6 ms to minimize.
[2024-05-21 02:38:50] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 5 ms to minimize.
[2024-05-21 02:38:50] [INFO ] Deduced a trap composed of 57 places in 261 ms of which 5 ms to minimize.
[2024-05-21 02:38:51] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 5 ms to minimize.
[2024-05-21 02:38:51] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 5 ms to minimize.
[2024-05-21 02:38:51] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 5 ms to minimize.
[2024-05-21 02:38:51] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 5 ms to minimize.
[2024-05-21 02:38:52] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 5 ms to minimize.
[2024-05-21 02:38:52] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 4 ms to minimize.
[2024-05-21 02:38:52] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 4 ms to minimize.
[2024-05-21 02:38:52] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 4 ms to minimize.
[2024-05-21 02:38:53] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:38:53] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:38:58] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-21 02:38:58] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 5 ms to minimize.
[2024-05-21 02:38:59] [INFO ] Deduced a trap composed of 69 places in 273 ms of which 5 ms to minimize.
[2024-05-21 02:38:59] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 5 ms to minimize.
[2024-05-21 02:39:00] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 4 ms to minimize.
[2024-05-21 02:39:00] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:39:00] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 5 ms to minimize.
[2024-05-21 02:39:00] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 4 ms to minimize.
[2024-05-21 02:39:01] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 4 ms to minimize.
[2024-05-21 02:39:01] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-21 02:39:01] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 4 ms to minimize.
[2024-05-21 02:39:02] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 4 ms to minimize.
[2024-05-21 02:39:02] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 3 ms to minimize.
[2024-05-21 02:39:02] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 5 ms to minimize.
[2024-05-21 02:39:02] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 5 ms to minimize.
[2024-05-21 02:39:03] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 5 ms to minimize.
[2024-05-21 02:39:03] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 5 ms to minimize.
[2024-05-21 02:39:04] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 5 ms to minimize.
[2024-05-21 02:39:04] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 5 ms to minimize.
[2024-05-21 02:39:05] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:39:06] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 5 ms to minimize.
[2024-05-21 02:39:06] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 6 ms to minimize.
[2024-05-21 02:39:07] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 5 ms to minimize.
[2024-05-21 02:39:07] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:39:07] [INFO ] Deduced a trap composed of 53 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:39:07] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:39:08] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 5 ms to minimize.
[2024-05-21 02:39:08] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 4 ms to minimize.
[2024-05-21 02:39:08] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 4 ms to minimize.
[2024-05-21 02:39:08] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 5 ms to minimize.
[2024-05-21 02:39:09] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/749 variables, and 85 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 51/85 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:39:15] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 4 ms to minimize.
[2024-05-21 02:39:15] [INFO ] Deduced a trap composed of 58 places in 200 ms of which 4 ms to minimize.
[2024-05-21 02:39:16] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 4 ms to minimize.
[2024-05-21 02:39:16] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 4 ms to minimize.
[2024-05-21 02:39:18] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 3 ms to minimize.
[2024-05-21 02:39:18] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
[2024-05-21 02:39:18] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:39:19] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 5 ms to minimize.
[2024-05-21 02:39:19] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 4 ms to minimize.
[2024-05-21 02:39:20] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 5 ms to minimize.
[2024-05-21 02:39:20] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:39:22] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 4 ms to minimize.
[2024-05-21 02:39:22] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 4 ms to minimize.
[2024-05-21 02:39:22] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-21 02:39:23] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 4 ms to minimize.
[2024-05-21 02:39:23] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 4 ms to minimize.
[2024-05-21 02:39:23] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 4 ms to minimize.
[2024-05-21 02:39:24] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:39:29] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 4 ms to minimize.
[2024-05-21 02:39:31] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-21 02:39:35] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/749 variables, and 106 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 0/368 constraints, Known Traps: 72/72 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 380/412 places, 369/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 380/412 places, 369/403 transitions.
[2024-05-21 02:39:39] [INFO ] Flatten gal took : 14 ms
[2024-05-21 02:39:39] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:39:39] [INFO ] Input system was already deterministic with 369 transitions.
[2024-05-21 02:39:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:39:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:39:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality7758134153304676396.gal : 3 ms
[2024-05-21 02:39:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality12381172261270462087.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/CTLCardinality7758134153304676396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12381172261270462087.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.
Detected timeout of ITS tools.
[2024-05-21 02:40:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:40:09] [INFO ] Applying decomposition
[2024-05-21 02:40:09] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5560935973445271207.txt' '-o' '/tmp/graph5560935973445271207.bin' '-w' '/tmp/graph5560935973445271207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5560935973445271207.bin' '-l' '-1' '-v' '-w' '/tmp/graph5560935973445271207.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:40:09] [INFO ] Decomposing Gal with order
[2024-05-21 02:40:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:40:09] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 02:40:09] [INFO ] Flatten gal took : 18 ms
[2024-05-21 02:40:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:40:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality12916819576771454846.gal : 5 ms
[2024-05-21 02:40:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality3868639908017235663.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/CTLCardinality12916819576771454846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3868639908017235663.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,8.26617e+27,5.27092,126756,11665,18,243416,308,758,348264,44,726,0


Converting to forward existential form...Done !
original formula: (EG(A(!((AG((i9.i0.u47.p168==1)) * (i21.i0.u142.p428==1))) U (i7.i1.u29.p99==1))) * EX((E((((i12.i0.u2.p7==0)||(i0.i0.u77.p276==1))||(i2....319
=> equivalent forward existential formula: ([((FwdU(EY((Init * EG(!((E(!((i7.i1.u29.p99==1)) U (!(!((!(E(TRUE U !((i9.i0.u47.p168==1)))) * (i21.i0.u142.p42...774
Reverse transition relation is NOT exact ! Due to transitions t112, t115, t125, t128, t152, t155, t186, t193, t215, t232, t239, t255, t262, t357, t358, t36...965
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 392 transition count 383
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 392 transition count 383
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 392 transition count 380
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 386 transition count 374
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 386 transition count 374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 384 transition count 372
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 384 transition count 372
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 382 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 382 transition count 370
Applied a total of 63 rules in 32 ms. Remains 382 /412 variables (removed 30) and now considering 370/403 (removed 33) transitions.
// Phase 1: matrix 370 rows 382 cols
[2024-05-21 02:40:39] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 02:40:39] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 02:40:39] [INFO ] Invariant cache hit.
[2024-05-21 02:40:40] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-05-21 02:40:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:40:49] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 6 ms to minimize.
[2024-05-21 02:40:50] [INFO ] Deduced a trap composed of 57 places in 335 ms of which 5 ms to minimize.
[2024-05-21 02:40:50] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 6 ms to minimize.
[2024-05-21 02:40:50] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 5 ms to minimize.
[2024-05-21 02:40:51] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 6 ms to minimize.
[2024-05-21 02:40:51] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 5 ms to minimize.
[2024-05-21 02:40:51] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 5 ms to minimize.
[2024-05-21 02:40:52] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 6 ms to minimize.
[2024-05-21 02:40:52] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 6 ms to minimize.
[2024-05-21 02:40:52] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 5 ms to minimize.
[2024-05-21 02:40:53] [INFO ] Deduced a trap composed of 63 places in 269 ms of which 5 ms to minimize.
[2024-05-21 02:40:53] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 5 ms to minimize.
[2024-05-21 02:40:53] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 4 ms to minimize.
[2024-05-21 02:40:53] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:40:54] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 4 ms to minimize.
[2024-05-21 02:40:54] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 4 ms to minimize.
[2024-05-21 02:40:54] [INFO ] Deduced a trap composed of 56 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:40:55] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 5 ms to minimize.
[2024-05-21 02:40:55] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 4 ms to minimize.
[2024-05-21 02:40:55] [INFO ] Deduced a trap composed of 59 places in 243 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:41:00] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 5 ms to minimize.
[2024-05-21 02:41:02] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
[2024-05-21 02:41:02] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 5 ms to minimize.
[2024-05-21 02:41:02] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 5 ms to minimize.
[2024-05-21 02:41:03] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:41:07] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 4 ms to minimize.
[2024-05-21 02:41:07] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 4 ms to minimize.
[2024-05-21 02:41:07] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 4 ms to minimize.
[2024-05-21 02:41:08] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 3 ms to minimize.
[2024-05-21 02:41:08] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 4 ms to minimize.
[2024-05-21 02:41:08] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/752 variables, and 65 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/382 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 31/65 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:41:15] [INFO ] Deduced a trap composed of 60 places in 290 ms of which 5 ms to minimize.
[2024-05-21 02:41:16] [INFO ] Deduced a trap composed of 61 places in 286 ms of which 5 ms to minimize.
[2024-05-21 02:41:16] [INFO ] Deduced a trap composed of 62 places in 266 ms of which 6 ms to minimize.
[2024-05-21 02:41:16] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 4 ms to minimize.
[2024-05-21 02:41:17] [INFO ] Deduced a trap composed of 60 places in 268 ms of which 6 ms to minimize.
[2024-05-21 02:41:17] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 5 ms to minimize.
[2024-05-21 02:41:17] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 5 ms to minimize.
[2024-05-21 02:41:17] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 4 ms to minimize.
[2024-05-21 02:41:18] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 4 ms to minimize.
[2024-05-21 02:41:18] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 4 ms to minimize.
[2024-05-21 02:41:18] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 4 ms to minimize.
[2024-05-21 02:41:19] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:41:19] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:41:19] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 4 ms to minimize.
[2024-05-21 02:41:20] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 4 ms to minimize.
[2024-05-21 02:41:20] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 4 ms to minimize.
[2024-05-21 02:41:20] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-21 02:41:20] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-21 02:41:20] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 3 ms to minimize.
[2024-05-21 02:41:21] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:41:22] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 4 ms to minimize.
[2024-05-21 02:41:22] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:41:22] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 4 ms to minimize.
[2024-05-21 02:41:22] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 4 ms to minimize.
[2024-05-21 02:41:23] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 4 ms to minimize.
[2024-05-21 02:41:23] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 4 ms to minimize.
[2024-05-21 02:41:23] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 4 ms to minimize.
[2024-05-21 02:41:23] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 4 ms to minimize.
[2024-05-21 02:41:24] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 5 ms to minimize.
[2024-05-21 02:41:24] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 5 ms to minimize.
[2024-05-21 02:41:25] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 4 ms to minimize.
[2024-05-21 02:41:25] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 4 ms to minimize.
[2024-05-21 02:41:25] [INFO ] Deduced a trap composed of 84 places in 188 ms of which 4 ms to minimize.
[2024-05-21 02:41:25] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 4 ms to minimize.
[2024-05-21 02:41:26] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 4 ms to minimize.
[2024-05-21 02:41:26] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 4 ms to minimize.
[2024-05-21 02:41:26] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 4 ms to minimize.
[2024-05-21 02:41:26] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 3 ms to minimize.
[2024-05-21 02:41:26] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 4 ms to minimize.
[2024-05-21 02:41:27] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:41:28] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 4 ms to minimize.
[2024-05-21 02:41:29] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 4 ms to minimize.
[2024-05-21 02:41:29] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 3 ms to minimize.
[2024-05-21 02:41:31] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-05-21 02:41:31] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-21 02:41:34] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/752 variables, and 111 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/382 constraints, PredecessorRefiner: 0/369 constraints, Known Traps: 77/77 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 382/412 places, 370/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60676 ms. Remains : 382/412 places, 370/403 transitions.
[2024-05-21 02:41:40] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:41:40] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:41:40] [INFO ] Input system was already deterministic with 370 transitions.
[2024-05-21 02:41:40] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:41:40] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:41:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality6800787814289535058.gal : 3 ms
[2024-05-21 02:41:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality6539725808955389226.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/CTLCardinality6800787814289535058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6539725808955389226.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.
Detected timeout of ITS tools.
[2024-05-21 02:42:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:42:10] [INFO ] Applying decomposition
[2024-05-21 02:42:10] [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/graph4029004029145136457.txt' '-o' '/tmp/graph4029004029145136457.bin' '-w' '/tmp/graph4029004029145136457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4029004029145136457.bin' '-l' '-1' '-v' '-w' '/tmp/graph4029004029145136457.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:42:10] [INFO ] Decomposing Gal with order
[2024-05-21 02:42:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:42:10] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-21 02:42:10] [INFO ] Flatten gal took : 16 ms
[2024-05-21 02:42:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 02:42:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7767319963427300790.gal : 4 ms
[2024-05-21 02:42:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16567772212199174382.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/CTLCardinality7767319963427300790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16567772212199174382.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,7.49192e+27,3.58903,96620,9239,14,185441,240,635,303397,28,427,0


Converting to forward existential form...Done !
original formula: (EG(E(((EF(((i17.u85.p293==0)||(i16.u83.p286==1))) * (i18.u143.p443!=1)) * EX((i16.u154.p451==1))) U AX(((i5.u32.p98==0)||(i22.u134.p404=...346
=> equivalent forward existential formula: [FwdG((Init * !(EG(E(((E(TRUE U ((i17.u85.p293==0)||(i16.u83.p286==1))) * (i18.u143.p443!=1)) * EX((i16.u154.p45...412
Reverse transition relation is NOT exact ! Due to transitions t111, t114, t138, t141, t151, t154, t185, t192, t207, t214, t229, t236, t278, t357, t358, t35...860
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 412 transition count 255
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 169 rules applied. Total rules applied 317 place count 264 transition count 234
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 329 place count 254 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 331 place count 252 transition count 232
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 331 place count 252 transition count 182
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 431 place count 202 transition count 182
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 448 place count 185 transition count 165
Iterating global reduction 4 with 17 rules applied. Total rules applied 465 place count 185 transition count 165
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 465 place count 185 transition count 158
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 479 place count 178 transition count 158
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 593 place count 121 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 600 place count 121 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 614 place count 114 transition count 87
Applied a total of 614 rules in 33 ms. Remains 114 /412 variables (removed 298) and now considering 87/403 (removed 316) transitions.
// Phase 1: matrix 87 rows 114 cols
[2024-05-21 02:42:40] [INFO ] Computed 34 invariants in 1 ms
[2024-05-21 02:42:40] [INFO ] Implicit Places using invariants in 185 ms returned [38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 65, 82, 88, 94, 100, 106, 113]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 201 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 96/412 places, 87/403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 96 transition count 77
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 86 transition count 77
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 80 transition count 71
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 80 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 79 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 79 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 78 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 78 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 77 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 77 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 76 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 76 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 75 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 75 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 74 transition count 65
Applied a total of 44 rules in 14 ms. Remains 74 /96 variables (removed 22) and now considering 65/87 (removed 22) transitions.
// Phase 1: matrix 65 rows 74 cols
[2024-05-21 02:42:40] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 02:42:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 02:42:40] [INFO ] Invariant cache hit.
[2024-05-21 02:42:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-21 02:42:41] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 74/412 places, 65/403 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 496 ms. Remains : 74/412 places, 65/403 transitions.
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:42:41] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:42:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2918549138269228208.gal : 1 ms
[2024-05-21 02:42:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9152757767037671068.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/CTLCardinality2918549138269228208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9152757767037671068.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EF(EG(AG(((p124==0)&&(p2==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(!(E(TRUE U !(((p124==0)&&(p2==1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.140673,6292,1,0,10,15502,22,2,1777,4536,9
FORMULA AutoFlight-PT-05b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 412/412 places, 403/403 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 411 transition count 252
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 168 rules applied. Total rules applied 318 place count 261 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 326 place count 253 transition count 234
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 326 place count 253 transition count 184
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 426 place count 203 transition count 184
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 443 place count 186 transition count 167
Iterating global reduction 3 with 17 rules applied. Total rules applied 460 place count 186 transition count 167
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 460 place count 186 transition count 159
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 476 place count 178 transition count 159
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 590 place count 121 transition count 102
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 597 place count 121 transition count 95
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 611 place count 114 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 612 place count 113 transition count 87
Reduce places removed 9 places and 0 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 4 with 13 rules applied. Total rules applied 625 place count 104 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 629 place count 100 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 629 place count 100 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 639 place count 95 transition count 78
Applied a total of 639 rules in 44 ms. Remains 95 /412 variables (removed 317) and now considering 78/403 (removed 325) transitions.
// Phase 1: matrix 78 rows 95 cols
[2024-05-21 02:42:41] [INFO ] Computed 25 invariants in 1 ms
[2024-05-21 02:42:41] [INFO ] Implicit Places using invariants in 151 ms returned [38, 55, 72, 76, 80, 85, 89, 94]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 152 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 87/412 places, 78/403 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 80 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 80 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 79 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 79 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 78 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 78 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 77 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 75 transition count 66
Applied a total of 24 rules in 9 ms. Remains 75 /87 variables (removed 12) and now considering 66/78 (removed 12) transitions.
// Phase 1: matrix 66 rows 75 cols
[2024-05-21 02:42:41] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 02:42:41] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 02:42:41] [INFO ] Invariant cache hit.
[2024-05-21 02:42:41] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 75/412 places, 66/403 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 431 ms. Remains : 75/412 places, 66/403 transitions.
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:42:41] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:42:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality3649910867438843049.gal : 1 ms
[2024-05-21 02:42:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality6089214082729755329.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/CTLCardinality3649910867438843049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6089214082729755329.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EF((p265==0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p265==0)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.100748,5228,1,0,8,9234,18,5,1866,4730,10
FORMULA AutoFlight-PT-05b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 02:42:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:42:41] [INFO ] Applying decomposition
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 8 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/graph17139968895103261444.txt' '-o' '/tmp/graph17139968895103261444.bin' '-w' '/tmp/graph17139968895103261444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17139968895103261444.bin' '-l' '-1' '-v' '-w' '/tmp/graph17139968895103261444.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:42:41] [INFO ] Decomposing Gal with order
[2024-05-21 02:42:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:42:41] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-21 02:42:41] [INFO ] Flatten gal took : 27 ms
[2024-05-21 02:42:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2024-05-21 02:42:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality1291497082504992808.gal : 6 ms
[2024-05-21 02:42:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4699350968006400672.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/CTLCardinality1291497082504992808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4699350968006400672.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 9 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.45203e+28,11.3637,271540,28697,35,513395,518,813,955070,56,1622,0


Converting to forward existential form...Done !
original formula: A(EF((i2.u26.p86==1)) U AX(FALSE))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!(E(TRUE U (i2.u26.p86==1))) * !(!(EX(!(FALSE))...171
Reverse transition relation is NOT exact ! Due to transitions t137, t140, t151, t154, t177, t180, t236, t260, t289, t310, t389, t390, t391, t392, t393, t39...1094
Detected timeout of ITS tools.
[2024-05-21 03:08:45] [INFO ] Applying decomposition
[2024-05-21 03:08:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 03:08:45] [INFO ] Decomposing Gal with order
[2024-05-21 03:08:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:08:45] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 03:08:45] [INFO ] Flatten gal took : 25 ms
[2024-05-21 03:08:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 28 ms.
[2024-05-21 03:08:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality6166164174403864714.gal : 8 ms
[2024-05-21 03:08:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13483036465106780895.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/CTLCardinality6166164174403864714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13483036465106780895.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 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 03:16:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 03:16:21] [INFO ] Input system was already deterministic with 403 transitions.
[2024-05-21 03:16:21] [INFO ] Transformed 412 places.
[2024-05-21 03:16:21] [INFO ] Transformed 403 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-21 03:16:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality8796210871734540540.gal : 2 ms
[2024-05-21 03:16:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality15240458215910013524.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/CTLCardinality8796210871734540540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15240458215910013524.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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