Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r007-tall-174853736900099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Anderson-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-174853736900099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 185K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748538892042

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202505121319
[2025-05-29 17:14:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-05-29 17:14:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:14:53] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-05-29 17:14:53] [INFO ] Transformed 161 places.
[2025-05-29 17:14:53] [INFO ] Transformed 365 transitions.
[2025-05-29 17:14:53] [INFO ] Found NUPN structural information;
[2025-05-29 17:14:53] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 166 ms.
Built sparse matrix representations for Structural reductions in 8 ms.9081KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 27 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 40 ms. Remains : 161/161 places, 365/365 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 15 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 161 cols
[2025-05-29 17:14:53] [INFO ] Computed 13 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:14:53] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-05-29 17:14:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:14:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 17:14:54] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 17:14:54] [INFO ] Redundant transitions in 19 ms returned []
Running 360 sub problems to find dead transitions.
[2025-05-29 17:14:54] [INFO ] Invariant cache hit.
[2025-05-29 17:14:54] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:56] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:56] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:56] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:56] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:57] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:57] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:57] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:57] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:57] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:57] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:57] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:58] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:58] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:58] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:58] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:58] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:58] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:59] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:59] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:14:59] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:02] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:02] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:03] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:03] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:03] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:03] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:04] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:04] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:05] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:07] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:08] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:08] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 17:15:11] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 365/526 variables, 161/368 constraints. Problems are: Problem set: 0 solved, 360 unsolved
SMT process timed out in 30259ms, After SMT, problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 30268ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 30785 ms. Remains : 161/161 places, 365/365 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1565 ms (no deadlock found). (steps per millisecond=798 )
Random directed walk for 1250002 steps, including 0 resets, run took 1241 ms (no deadlock found). (steps per millisecond=1007 )
[2025-05-29 17:15:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-05-29 17:15:27] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2025-05-29 17:15:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 268 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 16 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2025-05-29 17:15:27] [INFO ] Computed 13 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:15:28] [INFO ] Implicit Places using invariants in 685 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 690 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 7 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2025-05-29 17:15:28] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:15:28] [INFO ] Implicit Places using invariants in 409 ms returned []
[2025-05-29 17:15:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:15:28] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-29 17:15:29] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1700 ms. Remains : 115/161 places, 320/365 transitions.
Initial state reduction rules removed 5 formulas.
[2025-05-29 17:15:29] [INFO ] Flatten gal took : 144 ms
[2025-05-29 17:15:29] [INFO ] Flatten gal took : 76 ms
[2025-05-29 17:15:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6658786163712831151.gal : 27 ms
[2025-05-29 17:15:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2100532833680862696.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6658786163712831151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2100532833680862696.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (8 resets) in 2488 ms. (16 steps per ms) remains 23/315 properties
Loading property file /tmp/ReachabilityCardinality2100532833680862696.prop.
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/22 properties
Reachability property qltransition_282 is true.
Reachability property qltransition_280 is true.
Reachability property qltransition_255 is true.
Reachability property qltransition_182 is true.
Reachability property qltransition_181 is true.
Reachability property qltransition_137 is true.
Reachability property qltransition_136 is true.
Reachability property qltransition_92 is true.
Reachability property qltransition_91 is true.
Reachability property qltransition_47 is true.
Reachability property qltransition_46 is true.
Reachability property qltransition_1 is true.
SDD proceeding with computation,303 properties remain. new max is 2
SDD size :1 after 5
Reachability property qltransition_256 is true.
SDD proceeding with computation,302 properties remain. new max is 2
SDD size :5 after 6
Reachability property qltransition_290 is true.
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 17/21 properties
Reachability property qltransition_288 is true.
Reachability property qltransition_261 is true.
Reachability property qltransition_183 is true.
Reachability property qltransition_138 is true.
Reachability property qltransition_93 is true.
Reachability property qltransition_2 is true.
SDD proceeding with computation,295 properties remain. new max is 2
SDD size :6 after 13
Reachability property qltransition_260 is true.
SDD proceeding with computation,294 properties remain. new max is 2
SDD size :13 after 18
Reachability property qltransition_298 is true.
Reachability property qltransition_296 is true.
Reachability property qltransition_184 is true.
Reachability property qltransition_139 is true.
Reachability property qltransition_48 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,288 properties remain. new max is 2
SDD size :18 after 40
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 15/17 properties
Reachability property qltransition_266 is true.
SDD proceeding with computation,287 properties remain. new max is 2
SDD size :40 after 41
Reachability property qltransition_265 is true.
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 13/15 properties
SDD proceeding with computation,286 properties remain. new max is 2
SDD size :41 after 46
SDD proceeding with computation,286 properties remain. new max is 4
SDD size :46 after 62
Reachability property qltransition_306 is true.
Reachability property qltransition_304 is true.
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 12/13 properties
Reachability property qltransition_94 is true.
Reachability property qltransition_49 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,281 properties remain. new max is 4
SDD size :62 after 130
Reachability property qltransition_271 is true.
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 12/12 properties
SDD proceeding with computation,280 properties remain. new max is 4
SDD size :130 after 137
Reachability property qltransition_270 is true.
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 10/12 properties
SDD proceeding with computation,279 properties remain. new max is 4
SDD size :137 after 156
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 10/10 properties
SDD proceeding with computation,279 properties remain. new max is 8
SDD size :156 after 196
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 6/9 properties
[2025-05-29 17:15:30] [INFO ] Invariant cache hit.
Reachability property qltransition_314 is true.
[2025-05-29 17:15:30] [INFO ] State equation strengthened by 35 read => feed constraints.
Reachability property qltransition_312 is true.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,277 properties remain. new max is 8
SDD size :196 after 324
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 74/81 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,277 properties remain. new max is 16
SDD size :324 after 368
Reachability property qltransition_276 is true.
Reachability property qltransition_275 is true.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,275 properties remain. new max is 16
SDD size :368 after 414
SDD proceeding with computation,275 properties remain. new max is 32
SDD size :414 after 548
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/109 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_245 is true.
Reachability property qltransition_240 is true.
Reachability property qltransition_235 is true.
Reachability property qltransition_230 is true.
Reachability property qltransition_225 is true.
Reachability property qltransition_185 is true.
Reachability property qltransition_140 is true.
Reachability property qltransition_95 is true.
Reachability property qltransition_50 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,265 properties remain. new max is 32
SDD size :548 after 1182
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 28/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,265 properties remain. new max is 64
SDD size :1182 after 1326
SDD proceeding with computation,265 properties remain. new max is 128
SDD size :1326 after 1494
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/115 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_316 is true.
Reachability property qltransition_308 is true.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_300 is true.
Reachability property qltransition_292 is true.
Reachability property qltransition_284 is true.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Reachability property qltransition_194 is true.
Reachability property qltransition_193 is true.
Reachability property qltransition_192 is true.
Reachability property qltransition_191 is true.
Reachability property qltransition_190 is true.
Reachability property qltransition_189 is true.
Reachability property qltransition_149 is true.
Reachability property qltransition_148 is true.
Reachability property qltransition_147 is true.
Reachability property qltransition_146 is true.
Reachability property qltransition_145 is true.
Reachability property qltransition_144 is true.
Reachability property qltransition_104 is true.
Reachability property qltransition_103 is true.
Reachability property qltransition_102 is true.
Reachability property qltransition_101 is true.
Reachability property qltransition_100 is true.
Reachability property qltransition_99 is true.
Reachability property qltransition_59 is true.
Reachability property qltransition_58 is true.
Reachability property qltransition_57 is true.
Reachability property qltransition_56 is true.
Reachability property qltransition_55 is true.
Reachability property qltransition_54 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_12 is true.
Reachability property qltransition_11 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
SDD proceeding with computation,230 properties remain. new max is 128
SDD size :1494 after 2342
SDD proceeding with computation,230 properties remain. new max is 256
SDD size :2342 after 2542
[2025-05-29 17:15:30] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_246 is true.
Reachability property qltransition_241 is true.
Reachability property qltransition_236 is true.
Reachability property qltransition_231 is true.
Reachability property qltransition_226 is true.
Reachability property qltransition_195 is true.
Reachability property qltransition_186 is true.
Reachability property qltransition_150 is true.
Reachability property qltransition_141 is true.
Reachability property qltransition_105 is true.
Reachability property qltransition_96 is true.
Reachability property qltransition_60 is true.
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_51 is true.
Reachability property qltransition_15 is true.
Reachability property qltransition_6 is true.
SDD proceeding with computation,215 properties remain. new max is 256
SDD size :2542 after 3648
At refinement iteration 12 (OVERLAPS) 320/435 variables, 115/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 35/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_318 is true.
Reachability property qltransition_310 is true.
Reachability property qltransition_302 is true.
Reachability property qltransition_294 is true.
Reachability property qltransition_286 is true.
Reachability property qltransition_277 is true.
Reachability property qltransition_272 is true.
Reachability property qltransition_267 is true.
Reachability property qltransition_262 is true.
Reachability property qltransition_257 is true.
Reachability property qltransition_247 is true.
Reachability property qltransition_242 is true.
Reachability property qltransition_237 is true.
Reachability property qltransition_232 is true.
Reachability property qltransition_227 is true.
At refinement iteration 15 (OVERLAPS) 0/435 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
Reachability property qltransition_205 is true.
Reachability property qltransition_204 is true.
Reachability property qltransition_203 is true.
Reachability property qltransition_202 is true.
Reachability property qltransition_201 is true.
Reachability property qltransition_200 is true.
Reachability property qltransition_199 is true.
Reachability property qltransition_198 is true.
Reachability property qltransition_160 is true.
Reachability property qltransition_159 is true.
Reachability property qltransition_158 is true.
Reachability property qltransition_157 is true.
Reachability property qltransition_156 is true.
Reachability property qltransition_155 is true.
Reachability property qltransition_154 is true.
Reachability property qltransition_153 is true.
After SMT solving in domain Real declared 435/435 variables, and 278 constraints, problems are : Problem set: 0 solved, 6 unsolved in 902 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_115 is true.
Reachability property qltransition_114 is true.
Reachability property qltransition_113 is true.
Reachability property qltransition_112 is true.
Reachability property qltransition_111 is true.
Reachability property qltransition_110 is true.
At refinement iteration 2 (OVERLAPS) 74/81 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_109 is true.
Reachability property qltransition_108 is true.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/109 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 28/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_70 is true.
Reachability property qltransition_69 is true.
Reachability property qltransition_68 is true.
Reachability property qltransition_67 is true.
Reachability property qltransition_66 is true.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_65 is true.
Reachability property qltransition_64 is true.
Reachability property qltransition_63 is true.
At refinement iteration 8 (OVERLAPS) 6/115 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_25 is true.
Reachability property qltransition_24 is true.
Reachability property qltransition_23 is true.
Reachability property qltransition_22 is true.
Reachability property qltransition_21 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_18 is true.
SDD proceeding with computation,160 properties remain. new max is 256
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD size :3648 after 7466
At refinement iteration 12 (OVERLAPS) 320/435 variables, 115/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,160 properties remain. new max is 512
SDD size :7466 after 7774
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 35/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,160 properties remain. new max is 1024
SDD size :7774 after 8331
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 6/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_258 is true.
Reachability property qltransition_254 is true.
Reachability property qltransition_253 is true.
Reachability property qltransition_252 is true.
Reachability property qltransition_251 is true.
Reachability property qltransition_250 is true.
Reachability property qltransition_248 is true.
Reachability property qltransition_243 is true.
Reachability property qltransition_238 is true.
Reachability property qltransition_233 is true.
Reachability property qltransition_228 is true.
Reachability property qltransition_196 is true.
Reachability property qltransition_187 is true.
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property qltransition_151 is true.
Reachability property qltransition_142 is true.
Reachability property qltransition_106 is true.
Reachability property qltransition_97 is true.
Reachability property qltransition_61 is true.
Reachability property qltransition_52 is true.
Reachability property qltransition_35 is true.
Reachability property qltransition_34 is true.
Reachability property qltransition_33 is true.
Reachability property qltransition_32 is true.
Reachability property qltransition_31 is true.
Reachability property qltransition_30 is true.
Reachability property qltransition_29 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_16 is true.
Reachability property qltransition_7 is true.
SDD proceeding with computation,130 properties remain. new max is 1024
SDD size :8331 after 11916
SDD proceeding with computation,130 properties remain. new max is 2048
SDD size :11916 after 13703
At refinement iteration 16 (OVERLAPS) 0/435 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 284 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1407 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2320ms problems are : Problem set: 0 solved, 6 unsolved
Reachability property qltransition_313 is true.
Reachability property qltransition_305 is true.
Reachability property qltransition_297 is true.
Reachability property qltransition_289 is true.
Reachability property qltransition_281 is true.
Reachability property qltransition_279 is true.
Reachability property qltransition_274 is true.
Reachability property qltransition_269 is true.
Reachability property qltransition_264 is true.
Reachability property qltransition_259 is true.
Reachability property qltransition_221 is true.
Reachability property qltransition_220 is true.
Reachability property qltransition_219 is true.
Reachability property qltransition_218 is true.
Reachability property qltransition_217 is true.
Reachability property qltransition_216 is true.
Reachability property qltransition_206 is true.
Reachability property qltransition_197 is true.
Reachability property qltransition_188 is true.
Reachability property qltransition_176 is true.
Reachability property qltransition_175 is true.
Reachability property qltransition_174 is true.
Reachability property qltransition_173 is true.
Reachability property qltransition_172 is true.
Reachability property qltransition_171 is true.
Reachability property qltransition_161 is true.
Reachability property qltransition_152 is true.
Reachability property qltransition_143 is true.
Reachability property qltransition_131 is true.
Reachability property qltransition_130 is true.
Reachability property qltransition_129 is true.
Reachability property qltransition_128 is true.
Reachability property qltransition_127 is true.
Reachability property qltransition_126 is true.
Reachability property qltransition_116 is true.
Reachability property qltransition_107 is true.
Reachability property qltransition_98 is true.
Reachability property qltransition_86 is true.
Reachability property qltransition_85 is true.
Reachability property qltransition_84 is true.
Reachability property qltransition_83 is true.
Reachability property qltransition_82 is true.
Reachability property qltransition_81 is true.
Reachability property qltransition_71 is true.
Reachability property qltransition_62 is true.
Reachability property qltransition_53 is true.
Reachability property qltransition_41 is true.
Reachability property qltransition_40 is true.
Reachability property qltransition_39 is true.
Reachability property qltransition_38 is true.
Reachability property qltransition_37 is true.
Reachability property qltransition_36 is true.
SDD proceeding with computation,78 properties remain. new max is 2048
SDD size :13703 after 27400
Reachability property qltransition_283 is true.
SDD proceeding with computation,77 properties remain. new max is 2048
SDD size :27400 after 33481
Parikh walk visited 0 properties in 915 ms.
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 320/320 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 79 transition count 156
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 79 transition count 156
Applied a total of 72 rules in 11 ms. Remains 79 /115 variables (removed 36) and now considering 156/320 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 79/115 places, 156/320 transitions.
Reachability property qltransition_315 is true.
Reachability property qltransition_307 is true.
Reachability property qltransition_299 is true.
Reachability property qltransition_291 is true.
Reachability property qltransition_222 is true.
Reachability property qltransition_177 is true.
Reachability property qltransition_132 is true.
Reachability property qltransition_87 is true.
Reachability property qltransition_42 is true.
SDD proceeding with computation,68 properties remain. new max is 2048
SDD size :33481 after 41795
Reachability property qltransition_285 is true.
SDD proceeding with computation,67 properties remain. new max is 2048
SDD size :41795 after 43684
RANDOM walk for 2181372 steps (4 resets) in 3605 ms. (604 steps per ms) remains 0/4 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 320 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 9 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2025-05-29 17:15:34] [INFO ] Computed 13 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:15:35] [INFO ] Implicit Places using invariants in 645 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 647 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 8 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2025-05-29 17:15:35] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:15:35] [INFO ] Implicit Places using invariants in 393 ms returned []
[2025-05-29 17:15:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:15:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-29 17:15:36] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1656 ms. Remains : 115/161 places, 320/365 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
[2025-05-29 17:15:36] [INFO ] Flatten gal took : 24 ms
[2025-05-29 17:15:36] [INFO ] Flatten gal took : 24 ms
[2025-05-29 17:15:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15999512721228845230.gal : 4 ms
[2025-05-29 17:15:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6827456950737181058.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15999512721228845230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6827456950737181058.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-05-29 17:15:39] [INFO ] Flatten gal took : 21 ms
[2025-05-29 17:15:39] [INFO ] Applying decomposition
[2025-05-29 17:15:39] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12235958340568134129.txt' '-o' '/tmp/graph12235958340568134129.bin' '-w' '/tmp/graph12235958340568134129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12235958340568134129.bin' '-l' '-1' '-v' '-w' '/tmp/graph12235958340568134129.weights' '-q' '0' '-e' '0.001'
[2025-05-29 17:15:39] [INFO ] Decomposing Gal with order
[2025-05-29 17:15:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 17:15:39] [INFO ] Removed a total of 501 redundant transitions.
[2025-05-29 17:15:39] [INFO ] Flatten gal took : 75 ms
[2025-05-29 17:15:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 13 ms.
[2025-05-29 17:15:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17864382111873929802.gal : 5 ms
[2025-05-29 17:15:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13782482749442956204.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17864382111873929802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13782482749442956204.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 17:15:42] [INFO ] Flatten gal took : 16 ms
[2025-05-29 17:15:42] [INFO ] Flatten gal took : 15 ms
[2025-05-29 17:15:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4385317372552612374.gal : 2 ms
[2025-05-29 17:15:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10948931139198448072.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4385317372552612374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10948931139198448072.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,10.5545,303916,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 17:16:13] [INFO ] Flatten gal took : 17 ms
[2025-05-29 17:16:13] [INFO ] Applying decomposition
[2025-05-29 17:16:13] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13193016471642102811.txt' '-o' '/tmp/graph13193016471642102811.bin' '-w' '/tmp/graph13193016471642102811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13193016471642102811.bin' '-l' '-1' '-v' '-w' '/tmp/graph13193016471642102811.weights' '-q' '0' '-e' '0.001'
[2025-05-29 17:16:13] [INFO ] Decomposing Gal with order
[2025-05-29 17:16:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 17:16:13] [INFO ] Removed a total of 485 redundant transitions.
[2025-05-29 17:16:13] [INFO ] Flatten gal took : 39 ms
[2025-05-29 17:16:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 7 ms.
[2025-05-29 17:16:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4263957188225719815.gal : 4 ms
[2025-05-29 17:16:13] [INFO ] Time to serialize properties into /tmp/CTLFireability13877149708802242763.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4263957188225719815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13877149708802242763.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 17:16:43] [INFO ] Flatten gal took : 13 ms
[2025-05-29 17:16:43] [INFO ] Flatten gal took : 12 ms
[2025-05-29 17:16:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14873728714848018973.gal : 2 ms
[2025-05-29 17:16:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3899377837163268694.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14873728714848018973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3899377837163268694.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,9.95628,302824,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
original formula: AG(EF(((((slot_T.F.F.F.F==1)&&(next_0==1))&&((ncs_0_0==1)&&(ncs_1_0==1)))&&(((ncs_2_0==1)&&(ncs_3_0==1))&&(ncs_4_0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((slot_T.F.F.F.F==1)&&(next_0==1))&&((ncs_0_0==1)&&(ncs_1_0==1)))&&(((ncs_2_0==...200
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_0, ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p...6232
(forward)formula 0,0,36.5401,959300,1,0,873,4.11644e+06,661,323,7009,1.40487e+06,648
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 17:17:19] [INFO ] Flatten gal took : 18 ms
[2025-05-29 17:17:19] [INFO ] Flatten gal took : 16 ms
[2025-05-29 17:17:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12081493332840019264.gal : 2 ms
[2025-05-29 17:17:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17203460461883869630.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12081493332840019264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17203460461883869630.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 17:17:22] [INFO ] Flatten gal took : 15 ms
[2025-05-29 17:17:22] [INFO ] Applying decomposition
[2025-05-29 17:17:22] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1171613531733233583.txt' '-o' '/tmp/graph1171613531733233583.bin' '-w' '/tmp/graph1171613531733233583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1171613531733233583.bin' '-l' '-1' '-v' '-w' '/tmp/graph1171613531733233583.weights' '-q' '0' '-e' '0.001'
[2025-05-29 17:17:23] [INFO ] Decomposing Gal with order
[2025-05-29 17:17:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 17:17:23] [INFO ] Removed a total of 468 redundant transitions.
[2025-05-29 17:17:23] [INFO ] Flatten gal took : 38 ms
[2025-05-29 17:17:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 6 ms.
[2025-05-29 17:17:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10752758811597712258.gal : 2 ms
[2025-05-29 17:17:23] [INFO ] Time to serialize properties into /tmp/CTLFireability668856963321496618.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10752758811597712258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability668856963321496618.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 17:17:26] [INFO ] Flatten gal took : 14 ms
[2025-05-29 17:17:26] [INFO ] Flatten gal took : 14 ms
[2025-05-29 17:17:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13606734260213559786.gal : 2 ms
[2025-05-29 17:17:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16367306213922432564.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13606734260213559786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16367306213922432564.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 320 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,184136,11.1897,302480,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 17:17:56] [INFO ] Flatten gal took : 17 ms
[2025-05-29 17:17:56] [INFO ] Applying decomposition
[2025-05-29 17:17:56] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6521622965921823343.txt' '-o' '/tmp/graph6521622965921823343.bin' '-w' '/tmp/graph6521622965921823343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6521622965921823343.bin' '-l' '-1' '-v' '-w' '/tmp/graph6521622965921823343.weights' '-q' '0' '-e' '0.001'
[2025-05-29 17:17:56] [INFO ] Decomposing Gal with order
[2025-05-29 17:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 17:17:56] [INFO ] Removed a total of 510 redundant transitions.
[2025-05-29 17:17:56] [INFO ] Flatten gal took : 33 ms
[2025-05-29 17:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 5 ms.
[2025-05-29 17:17:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1680139361001661126.gal : 3 ms
[2025-05-29 17:17:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10645779237014509164.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1680139361001661126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10645779237014509164.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 17:18:26] [INFO ] Flatten gal took : 13 ms
[2025-05-29 17:18:26] [INFO ] Flatten gal took : 13 ms
[2025-05-29 17:18:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16728389394785701032.gal : 2 ms
[2025-05-29 17:18:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5086979835833473623.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16728389394785701032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5086979835833473623.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 320 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,184136,10.3866,302144,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
original formula: AG(EF(((next_0==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_0==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_0, ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p...6232
(forward)formula 0,1,65.7407,1691520,1,0,955,1.07168e+07,661,372,6971,2.67078e+06,773
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 1,1,73.989,1973240,1,0,999,1.28321e+07,662,398,6973,3.06435e+06,839
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 2,1,111.56,2202088,1,0,1039,1.44287e+07,14,420,2631,3.36408e+06,65
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 3,1,120.006,2202088,1,0,1039,1.44287e+07,15,420,2633,3.36408e+06,136
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 4,1,124.61,2202088,1,0,1039,1.44287e+07,16,420,2635,3.36408e+06,212
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 5,1,128.715,2202088,1,0,1039,1.44287e+07,17,420,2637,3.36408e+06,293
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 6,1,129.905,2202088,1,0,1039,1.44287e+07,18,420,2639,3.36408e+06,364
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 7,1,130.275,2202088,1,0,1039,1.44287e+07,19,420,2641,3.36408e+06,440
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 8,1,131.415,2202088,1,0,1039,1.44287e+07,20,420,2643,3.36408e+06,556
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 9,1,171.274,2456572,1,0,1039,1.94438e+07,14,420,2631,3.64314e+06,25
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 10,1,186.099,2456572,1,0,1039,1.94438e+07,15,420,2633,3.64314e+06,132
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 11,1,192.956,2456572,1,0,1039,1.94438e+07,16,420,2635,3.64314e+06,213
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 12,1,198.529,2456572,1,0,1039,1.94438e+07,17,420,2637,3.64314e+06,284
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 13,1,201.704,2456572,1,0,1039,1.94438e+07,18,420,2639,3.64314e+06,350
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 14,1,204.573,2456572,1,0,1039,1.94438e+07,19,420,2641,3.64314e+06,431
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 15,1,208.688,2456572,1,0,1039,1.94438e+07,20,420,2643,3.64314e+06,527
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 16,1,209.046,2456572,1,0,1039,1.94438e+07,21,420,2645,3.64314e+06,603
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 17,1,210.158,2456572,1,0,1039,1.94438e+07,22,420,2647,3.64314e+06,719
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 18,1,253.34,2726320,1,0,1039,2.1202e+07,14,420,2631,3.92382e+06,70
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 19,1,260.643,2726320,1,0,1039,2.1202e+07,15,420,2633,3.92382e+06,141
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 20,1,262.94,2726320,1,0,1039,2.1202e+07,16,420,2635,3.92382e+06,217
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 21,1,270.767,2726320,1,0,1039,2.1202e+07,17,420,2637,3.92382e+06,333
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 22,1,273.3,2726320,1,0,1039,2.1202e+07,18,420,2639,3.92382e+06,399
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 23,1,275.609,2726320,1,0,1039,2.1202e+07,19,420,2641,3.92382e+06,480
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 24,1,277.725,2726320,1,0,1039,2.1202e+07,20,420,2643,3.92382e+06,576
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 25,1,281.628,2726320,1,0,1039,2.1202e+07,21,420,2645,3.92382e+06,687
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 26,1,282.652,2726320,1,0,1039,2.1202e+07,22,420,2647,3.92382e+06,803
Formula is TRUE !
Detected timeout of ITS tools.
[2025-05-29 17:23:26] [INFO ] Flatten gal took : 14 ms
[2025-05-29 17:23:26] [INFO ] Applying decomposition
[2025-05-29 17:23:26] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14115755398752664506.txt' '-o' '/tmp/graph14115755398752664506.bin' '-w' '/tmp/graph14115755398752664506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14115755398752664506.bin' '-l' '-1' '-v' '-w' '/tmp/graph14115755398752664506.weights' '-q' '0' '-e' '0.001'
[2025-05-29 17:23:26] [INFO ] Decomposing Gal with order
[2025-05-29 17:23:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 17:23:26] [INFO ] Removed a total of 559 redundant transitions.
[2025-05-29 17:23:26] [INFO ] Flatten gal took : 30 ms
[2025-05-29 17:23:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 7 ms.
[2025-05-29 17:23:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13582559523865162771.gal : 2 ms
[2025-05-29 17:23:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13924144483718007104.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13582559523865162771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13924144483718007104.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 293 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,184136,34.4702,541196,5647,1920,463900,25982,746,3.45179e+06,173,1.1834e+06,0


Converting to forward existential form...Done !
original formula: AG(EF(((i1.u4.next_0==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_0==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p1_0_0_5, ncs_to_p...5475
(forward)formula 0,1,66.0166,728460,1,0,961037,123751,3076,3.45179e+06,835,1.61547e+06,2160236
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_1==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_1==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
(forward)formula 1,1,71.2866,770700,1,0,1.01241e+06,124023,3081,3.45179e+06,836,1.62941e+06,2299572
Formula is TRUE !

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

original formula: AG(EF(((i5.u5.next_2==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u5.next_2==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
(forward)formula 2,1,76.501,808460,1,0,1.05e+06,124054,3085,3.45179e+06,836,1.63515e+06,2409305
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_3==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_3==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
(forward)formula 3,1,81.5086,836492,1,0,1.07459e+06,124065,3090,3.45179e+06,837,1.63616e+06,2483001
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_4==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_4==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
(forward)formula 4,1,86.2134,860940,1,0,1.09119e+06,124070,3095,3.45405e+06,838,1.63864e+06,2536494
Formula is TRUE !

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

original formula: AG(EF(((u7.next_5==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_5==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
(forward)formula 5,1,91.104,882828,1,0,1.10465e+06,124103,3099,3.46453e+06,839,1.63887e+06,2582015
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
(forward)formula 6,1,97.1751,913548,1,0,1.12677e+06,124103,3103,3.48475e+06,840,1.6438e+06,2652506
Formula is TRUE !

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

original formula: AG(EF(((i4.u8.next_7==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u8.next_7==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
(forward)formula 7,1,104.613,959244,1,0,1.1729e+06,124107,3107,3.52709e+06,840,1.64616e+06,2790756
Formula is TRUE !

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

original formula: AG(EF(((i4.u9.next_8==1)&&(i0.u0.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u9.next_8==1)&&(i0.u0.ncs_0_3==1)))))] = FALSE
(forward)formula 8,1,111.847,1012620,1,0,1.2407e+06,124107,3111,3.58028e+06,840,1.64742e+06,2966440
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_0==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_0==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 9,1,121.225,1097996,1,0,1.34092e+06,124321,3114,3.68927e+06,840,1.65939e+06,3216888
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_1==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_1==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 10,1,122.982,1117836,1,0,1.36189e+06,124321,3116,3.70695e+06,840,1.65998e+06,3282684
Formula is TRUE !

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

original formula: AG(EF(((i5.u5.next_2==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u5.next_2==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 11,1,125.327,1151436,1,0,1.38847e+06,124323,3118,3.73621e+06,840,1.661e+06,3366598
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_3==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_3==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 12,1,125.602,1152844,1,0,1.39199e+06,124323,3120,3.73899e+06,840,1.66108e+06,3377942
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_4==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_4==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 13,1,126.995,1158092,1,0,1.40098e+06,124323,3122,3.74819e+06,840,1.6611e+06,3406230
Formula is TRUE !

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

original formula: AG(EF(((u7.next_5==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_5==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 14,1,127.505,1161548,1,0,1.40372e+06,124323,3124,3.75058e+06,840,1.6611e+06,3415314
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 15,1,127.861,1164620,1,0,1.40608e+06,124323,3126,3.75266e+06,840,1.66112e+06,3423040
Formula is TRUE !

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

original formula: AG(EF(((i4.u8.next_7==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u8.next_7==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 16,1,128.162,1168204,1,0,1.40998e+06,124323,3128,3.75543e+06,840,1.66112e+06,3436623
Formula is TRUE !

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

original formula: AG(EF(((i4.u9.next_8==1)&&(u10.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u9.next_8==1)&&(u10.ncs_0_4==1)))))] = FALSE
(forward)formula 17,1,128.41,1171148,1,0,1.4138e+06,124323,3130,3.75838e+06,840,1.6616e+06,3449150
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_0==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_0==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 18,1,148.854,1399116,1,0,1.65426e+06,128106,3134,4.73381e+06,840,1.90302e+06,3951111
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_1==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_1==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 19,1,155.963,1443788,1,0,1.69545e+06,128433,3136,4.79311e+06,840,1.91056e+06,4064763
Formula is TRUE !

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

original formula: AG(EF(((i5.u5.next_2==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u5.next_2==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 20,1,161.831,1485260,1,0,1.74089e+06,128482,3140,4.83608e+06,840,1.91375e+06,4198392
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_3==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_3==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 21,1,167.608,1519820,1,0,1.77472e+06,128488,3146,4.86128e+06,842,1.9151e+06,4296160
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_4==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_4==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 22,1,171.114,1540556,1,0,1.79204e+06,128502,3152,4.87509e+06,844,1.9154e+06,4350508
Formula is TRUE !

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

original formula: AG(EF(((u7.next_5==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_5==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 23,1,175.44,1559884,1,0,1.80599e+06,128525,3154,4.88669e+06,844,1.91554e+06,4397997
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 24,1,176.296,1565644,1,0,1.81055e+06,128525,3156,4.89103e+06,844,1.91627e+06,4413510
Formula is TRUE !

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

original formula: AG(EF(((i4.u8.next_7==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u8.next_7==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 25,1,176.933,1571020,1,0,1.81612e+06,128525,3158,4.89529e+06,844,1.91627e+06,4434073
Formula is TRUE !

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

original formula: AG(EF(((i4.u9.next_8==1)&&(i5.u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u9.next_8==1)&&(i5.u6.ncs_1_0==1)))))] = FALSE
(forward)formula 26,1,180.604,1585996,1,0,1.82608e+06,128529,3160,4.90273e+06,844,1.91629e+06,4465294
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_0==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_0==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 27,1,200.18,1779916,1,0,2.03333e+06,130491,3165,5.63984e+06,845,2.00744e+06,4910347
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_1==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_1==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 28,1,204.152,1812044,1,0,2.07126e+06,130557,3167,5.66456e+06,845,2.01046e+06,5014675
Formula is TRUE !

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

original formula: AG(EF(((i5.u5.next_2==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u5.next_2==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 29,1,212.532,1869132,1,0,2.12871e+06,130670,3171,5.73479e+06,845,2.01441e+06,5177897
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_3==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_3==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 30,1,218.75,1910732,1,0,2.17073e+06,130686,3177,5.76484e+06,847,2.01503e+06,5297101
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_4==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_4==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 31,1,222.526,1934796,1,0,2.19089e+06,130686,3183,5.77966e+06,849,2.01505e+06,5361774
Formula is TRUE !

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

original formula: AG(EF(((u7.next_5==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_5==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 32,1,226.989,1957068,1,0,2.20612e+06,130696,3185,5.79147e+06,849,2.01514e+06,5411343
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 33,1,232.695,1987404,1,0,2.22794e+06,130704,3187,5.81251e+06,849,2.01558e+06,5481293
Formula is TRUE !

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

original formula: AG(EF(((i4.u8.next_7==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u8.next_7==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 34,1,233.491,1992908,1,0,2.23348e+06,130704,3189,5.81672e+06,849,2.01558e+06,5501826
Formula is TRUE !

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

original formula: AG(EF(((i4.u9.next_8==1)&&(i5.u6.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u9.next_8==1)&&(i5.u6.ncs_1_1==1)))))] = FALSE
(forward)formula 35,1,237.211,2008012,1,0,2.24223e+06,130704,3191,5.82428e+06,849,2.01562e+06,5531330
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_0==1)&&(i4.u9.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_0==1)&&(i4.u9.ncs_1_2==1)))))] = FALSE
(forward)formula 36,1,254.742,2185292,1,0,2.46029e+06,130898,3195,6.21799e+06,849,2.02723e+06,6093826
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.next_1==1)&&(i4.u9.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.next_1==1)&&(i4.u9.ncs_1_2==1)))))] = FALSE
(forward)formula 37,1,284.813,2200268,1,0,2.48891e+06,130898,1950,6.23458e+06,467,2.02796e+06,1116165
Formula is TRUE !

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

original formula: AG(EF(((i5.u5.next_2==1)&&(i4.u9.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u5.next_2==1)&&(i4.u9.ncs_1_2==1)))))] = FALSE
(forward)formula 38,1,287.23,2200268,1,0,2.48891e+06,130898,1958,6.23458e+06,468,2.02796e+06,1304588
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_3==1)&&(i4.u9.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_3==1)&&(i4.u9.ncs_1_2==1)))))] = FALSE
(forward)formula 39,1,290.824,2200268,1,0,2.48891e+06,130898,1963,6.23458e+06,469,2.02796e+06,1488632
Formula is TRUE !

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

original formula: AG(EF(((i5.u6.next_4==1)&&(i4.u9.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.u6.next_4==1)&&(i4.u9.ncs_1_2==1)))))] = FALSE
(forward)formula 40,1,292.913,2200268,1,0,2.48891e+06,130898,1968,6.23458e+06,470,2.02796e+06,1576497
Formula is TRUE !

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

original formula: AG(EF(((u7.next_5==1)&&(i4.u9.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_5==1)&&(i4.u9.ncs_1_2==1)))))] = FALSE
(forward)formula 41,1,295.799,2200268,1,0,2.48891e+06,130898,1972,6.23458e+06,471,2.02796e+06,1667484
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(i4.u9.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(i4.u9.ncs_1_2==1)))))] = FALSE
(forward)formula 42,1,299.6,2200268,1,0,2.48891e+06,130898,1976,6.23458e+06,472,2.02796e+06,1774036
Formula is TRUE !
Detected timeout of ITS tools.
[2025-05-29 17:28:26] [INFO ] Flatten gal took : 12 ms
[2025-05-29 17:28:26] [INFO ] Flatten gal took : 11 ms
[2025-05-29 17:28:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6031616326356557175.gal : 2 ms
[2025-05-29 17:28:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1369162305723804361.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6031616326356557175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1369162305723804361.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 250 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,184136,10.7626,303332,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
original formula: AG(EF(((next_7==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_2==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_0, ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p...6232
(forward)formula 0,1,63.4931,1582584,1,0,962,9.8624e+06,661,375,6853,2.53819e+06,783
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 1,1,68.0448,1738840,1,0,1053,1.1093e+07,662,430,6855,2.81098e+06,924
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 2,1,110.445,2249296,1,0,1094,1.46919e+07,14,452,2631,3.4159e+06,70
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 3,1,117.779,2249296,1,0,1094,1.46919e+07,15,452,2633,3.4159e+06,141
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 4,1,120.576,2249296,1,0,1094,1.46919e+07,16,452,2635,3.4159e+06,212
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 5,1,122.567,2249296,1,0,1094,1.46919e+07,17,452,2637,3.4159e+06,288
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 6,1,125.065,2249296,1,0,1094,1.46919e+07,18,452,2639,3.4159e+06,354
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 7,1,127.488,2249296,1,0,1094,1.46919e+07,19,452,2641,3.4159e+06,435
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 8,1,128.972,2249296,1,0,1094,1.46919e+07,20,452,2643,3.4159e+06,531
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 9,1,131.17,2249296,1,0,1094,1.46919e+07,21,452,2645,3.4159e+06,642
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 10,1,134.634,2253444,1,0,1094,1.52751e+07,22,452,2647,3.4159e+06,758
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 11,1,172.541,2501664,1,0,1094,1.99983e+07,14,452,2631,3.60308e+06,35
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 12,1,185.079,2501664,1,0,1094,1.99983e+07,15,452,2633,3.60308e+06,122
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 13,1,188.746,2501664,1,0,1094,1.99983e+07,16,452,2635,3.60308e+06,193
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 14,1,191.82,2501664,1,0,1094,1.99983e+07,17,452,2637,3.60308e+06,264
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 15,1,194.649,2501664,1,0,1094,1.99983e+07,18,452,2639,3.60308e+06,335
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 16,1,196.754,2501664,1,0,1094,1.99983e+07,19,452,2641,3.60308e+06,406
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 17,1,197.939,2501664,1,0,1094,1.99983e+07,20,452,2643,3.60308e+06,477
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 18,1,198.337,2501664,1,0,1094,1.99983e+07,21,452,2645,3.60308e+06,553
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 19,1,199.455,2501664,1,0,1094,1.99983e+07,22,452,2647,3.60308e+06,674
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 20,1,220.304,2535808,1,0,1094,2.01213e+07,23,452,2649,3.7277e+06,800
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 21,1,258.401,2775572,1,0,1094,2.17306e+07,14,452,2631,4.00197e+06,75
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 22,1,265.482,2775572,1,0,1094,2.17306e+07,15,452,2633,4.00197e+06,146
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 23,1,269.725,2775572,1,0,1094,2.17306e+07,16,452,2635,4.00197e+06,217
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 24,1,274.167,2775572,1,0,1094,2.17306e+07,17,452,2637,4.00197e+06,293
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 25,1,277.977,2775572,1,0,1094,2.17306e+07,18,452,2639,4.00197e+06,374
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 26,1,279.185,2775572,1,0,1094,2.17306e+07,19,452,2641,4.00197e+06,445
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 27,1,279.567,2775572,1,0,1094,2.17306e+07,20,452,2643,4.00197e+06,521
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 28,1,280.801,2775572,1,0,1094,2.17306e+07,21,452,2645,4.00197e+06,637
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 29,1,301.434,2775572,1,0,1094,2.17306e+07,22,452,2648,4.0051e+06,758
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 30,1,306.885,2928452,1,0,1094,2.28013e+07,23,452,2649,4.23397e+06,829
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 31,1,319.564,2995456,1,0,1094,2.4908e+07,24,452,2650,4.63955e+06,910
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 32,1,356.858,3061792,1,0,1094,2.52675e+07,14,452,2631,4.69002e+06,110
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 33,1,361.783,3061792,1,0,1094,2.52675e+07,15,452,2633,4.69002e+06,196
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 34,1,364.38,3061792,1,0,1094,2.52675e+07,16,452,2635,4.69002e+06,277
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 35,1,367.795,3061792,1,0,1094,2.52675e+07,17,452,2637,4.69002e+06,373
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 36,1,368.115,3061792,1,0,1094,2.52675e+07,18,452,2639,4.69002e+06,449
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 37,1,369.06,3061792,1,0,1094,2.52675e+07,19,452,2641,4.69002e+06,565
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 38,1,386.258,3061792,1,0,1094,2.52675e+07,20,452,2644,4.69002e+06,691
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 39,1,388.774,3061792,1,0,1094,2.52675e+07,21,452,2646,4.69002e+06,762
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 40,1,390.783,3061792,1,0,1094,2.52675e+07,22,452,2648,4.69002e+06,838
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 41,1,397.859,3061792,1,0,1094,2.52675e+07,23,452,2649,4.69002e+06,954
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 42,1,399.978,3061792,1,0,1094,2.52675e+07,24,452,2650,4.69002e+06,1020
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 43,1,402.107,3061792,1,0,1094,2.52675e+07,25,452,2651,4.69002e+06,1101
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 44,1,404.106,3111136,1,0,1094,2.56451e+07,26,465,2652,4.80028e+06,1197
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 45,1,407.536,3213800,1,0,1094,2.65631e+07,27,508,2653,4.9655e+06,1308
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 46,1,417.338,3266104,1,0,1094,2.68591e+07,28,553,2654,5.02781e+06,1424
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 47,1,452.362,3355240,1,0,1094,2.77136e+07,14,563,2631,5.15383e+06,100
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 48,1,456.017,3355240,1,0,1094,2.77136e+07,15,563,2633,5.15383e+06,171
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 49,1,458.231,3355240,1,0,1094,2.77136e+07,16,563,2635,5.15383e+06,242
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 50,1,459.578,3355240,1,0,1094,2.77136e+07,17,563,2637,5.15383e+06,318
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 51,1,461.511,3355240,1,0,1094,2.77136e+07,18,563,2639,5.15383e+06,384
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 52,1,463.375,3355240,1,0,1094,2.77136e+07,19,563,2641,5.15383e+06,465
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 53,1,464.496,3355240,1,0,1094,2.77136e+07,20,563,2643,5.15383e+06,561
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 54,1,466.12,3355240,1,0,1094,2.77136e+07,21,563,2645,5.15383e+06,672
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 55,1,468.674,3355240,1,0,1094,2.77136e+07,22,563,2647,5.15383e+06,788
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 56,1,480.738,3355240,1,0,1094,2.77136e+07,23,563,2649,5.15383e+06,899
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 57,1,484.121,3355240,1,0,1094,2.77136e+07,24,563,2650,5.15383e+06,970
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 58,1,486.981,3355240,1,0,1094,2.77136e+07,25,563,2651,5.15383e+06,1041
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 59,1,489.188,3355240,1,0,1094,2.77136e+07,26,563,2652,5.15383e+06,1112
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 60,1,491.349,3355240,1,0,1094,2.77136e+07,27,563,2653,5.15383e+06,1183
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 61,1,493.181,3355240,1,0,1094,2.77136e+07,28,563,2654,5.15383e+06,1254
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 62,1,494.256,3355240,1,0,1094,2.77136e+07,29,563,2655,5.15383e+06,1325
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 63,1,494.636,3355240,1,0,1094,2.77136e+07,30,563,2656,5.15383e+06,1401
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 64,1,495.675,3355240,1,0,1094,2.77136e+07,31,592,2657,5.15383e+06,1522
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 65,1,540.485,3692620,1,0,1094,3.06543e+07,14,630,2631,5.59001e+06,35
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 66,1,552.407,3692620,1,0,1094,3.06543e+07,15,630,2633,5.59001e+06,117
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 67,1,556.8,3692620,1,0,1094,3.06543e+07,16,630,2635,5.59001e+06,188
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 68,1,560.367,3692620,1,0,1094,3.06543e+07,17,630,2637,5.59001e+06,259
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 69,1,563.919,3692620,1,0,1094,3.06543e+07,18,630,2639,5.59001e+06,335
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 70,1,566.918,3692620,1,0,1094,3.06543e+07,19,630,2641,5.59001e+06,416
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 71,1,567.921,3692620,1,0,1094,3.06543e+07,20,630,2643,5.59001e+06,487
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 72,1,568.241,3692620,1,0,1094,3.06543e+07,21,630,2645,5.59001e+06,563
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 73,1,569.265,3692620,1,0,1094,3.06543e+07,22,630,2647,5.59001e+06,679
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 74,1,584.738,3692620,1,0,1094,3.06543e+07,23,630,2649,5.59001e+06,800
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 75,1,588.271,3692620,1,0,1094,3.06543e+07,24,630,2650,5.59001e+06,871
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 76,1,594.512,3692620,1,0,1094,3.06543e+07,25,630,2651,5.59001e+06,952
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 77,1,599.024,3692620,1,0,1094,3.06543e+07,26,630,2652,5.59001e+06,1023
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 78,1,601.471,3692620,1,0,1094,3.06543e+07,27,630,2653,5.59001e+06,1089
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 79,1,603.959,3692620,1,0,1094,3.06543e+07,28,630,2654,5.59001e+06,1170
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 80,1,607.801,3692620,1,0,1094,3.06543e+07,29,630,2655,5.59001e+06,1266
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 81,1,608.169,3692620,1,0,1094,3.06543e+07,30,630,2656,5.59001e+06,1342
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 82,1,609.319,3692620,1,0,1094,3.06543e+07,31,630,2657,5.59668e+06,1458
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 83,1,655.962,4068456,1,0,1094,3.32866e+07,14,630,2631,6.20651e+06,60
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 84,1,663.206,4068456,1,0,1094,3.32866e+07,15,630,2633,6.20651e+06,137
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 85,1,664.559,4068456,1,0,1094,3.32866e+07,16,630,2635,6.20651e+06,213
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 86,1,670.255,4068456,1,0,1094,3.32866e+07,17,630,2637,6.20651e+06,329
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 87,1,672.13,4068456,1,0,1094,3.32866e+07,18,630,2639,6.20651e+06,395
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 88,1,673.994,4068456,1,0,1094,3.32866e+07,19,630,2641,6.20651e+06,476
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 89,1,675.416,4068456,1,0,1094,3.32866e+07,20,630,2643,6.20651e+06,572
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 90,1,677.691,4068456,1,0,1094,3.32866e+07,21,630,2645,6.20651e+06,683
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 91,1,678.538,4068456,1,0,1094,3.32866e+07,22,630,2647,6.20651e+06,799
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 92,1,690.866,4068456,1,0,1094,3.32866e+07,23,630,2649,6.20651e+06,920
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 93,1,693.455,4068456,1,0,1094,3.32866e+07,24,630,2650,6.20651e+06,991
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 94,1,694.836,4068456,1,0,1094,3.32866e+07,25,630,2651,6.20651e+06,1062
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 95,1,696.163,4068456,1,0,1094,3.32866e+07,26,630,2652,6.20651e+06,1138
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 96,1,697.95,4068456,1,0,1094,3.32866e+07,27,630,2653,6.20651e+06,1204
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 97,1,699.699,4068456,1,0,1094,3.32866e+07,28,630,2654,6.20651e+06,1285
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 98,1,700.811,4068456,1,0,1094,3.32866e+07,29,630,2655,6.20651e+06,1381
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 99,1,702.544,4068456,1,0,1094,3.32866e+07,30,630,2656,6.20651e+06,1492
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 100,1,704.784,4068456,1,0,1094,3.32866e+07,31,630,2657,6.20651e+06,1608
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 101,1,717.521,4068456,1,0,1131,3.32866e+07,32,667,2659,6.20651e+06,1719
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 102,1,721.264,4068456,1,0,1178,3.32866e+07,33,695,2660,6.20651e+06,1790
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 103,1,723.879,4068456,1,0,1225,3.32866e+07,34,723,2661,6.20651e+06,1861
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 104,1,726.288,4068456,1,0,1271,3.32866e+07,35,751,2662,6.20651e+06,1932
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 105,1,728.734,4068456,1,0,1316,3.32866e+07,36,778,2663,6.20651e+06,2003
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 106,1,730.859,4068456,1,0,1364,3.32866e+07,37,806,2664,6.20651e+06,2074
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 107,1,732.216,4080832,1,0,1415,3.36235e+07,38,834,2665,6.20651e+06,2145
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 108,1,732.668,4094400,1,0,1470,3.37325e+07,39,863,2666,6.22473e+06,2221
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 109,1,733.874,4133728,1,0,1550,3.40517e+07,40,910,2667,6.29731e+06,2342
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 110,1,782.726,4477992,1,0,1588,3.67259e+07,14,930,2631,6.74992e+06,80
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 111,1,788.657,4477992,1,0,1588,3.67259e+07,15,930,2633,6.74992e+06,146
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 112,1,792.6,4477992,1,0,1588,3.67259e+07,16,930,2635,6.74992e+06,217
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 113,1,795.901,4477992,1,0,1588,3.67259e+07,17,930,2637,6.74992e+06,288
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 114,1,798.493,4477992,1,0,1588,3.67259e+07,18,930,2639,6.74992e+06,354
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 115,1,801.267,4477992,1,0,1588,3.67259e+07,19,930,2641,6.74992e+06,435
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 116,1,802.228,4477992,1,0,1588,3.67259e+07,20,930,2643,6.74992e+06,506
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 117,1,802.53,4477992,1,0,1588,3.67259e+07,21,930,2645,6.74992e+06,582
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 118,1,803.488,4477992,1,0,1588,3.67259e+07,22,930,2647,6.74992e+06,698
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 119,1,817.727,4477992,1,0,1588,3.67259e+07,23,930,2649,6.74992e+06,819
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 120,1,820.94,4477992,1,0,1588,3.67259e+07,24,930,2650,6.74992e+06,890
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 121,1,826.675,4477992,1,0,1588,3.67259e+07,25,930,2651,6.74992e+06,971
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 122,1,830.82,4477992,1,0,1588,3.67259e+07,26,930,2652,6.74992e+06,1042
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 123,1,833.074,4477992,1,0,1588,3.67259e+07,27,930,2653,6.74992e+06,1108
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 124,1,835.4,4477992,1,0,1588,3.67259e+07,28,930,2654,6.74992e+06,1189
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 125,1,838.945,4477992,1,0,1588,3.67259e+07,29,930,2655,6.74992e+06,1285
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 126,1,839.287,4477992,1,0,1588,3.67259e+07,30,930,2656,6.74992e+06,1361
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_4_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_4_1==1)))))] = FALSE
(forward)formula 127,1,840.35,4477992,1,0,1588,3.67259e+07,31,930,2657,6.74992e+06,1477
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 128,1,854.539,4477992,1,0,1588,3.67259e+07,32,930,2659,6.74992e+06,1603
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 129,1,856.561,4477992,1,0,1588,3.67259e+07,33,930,2660,6.74992e+06,1674
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 130,1,858.041,4477992,1,0,1588,3.67259e+07,34,930,2661,6.74992e+06,1750
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 131,1,864.594,4477992,1,0,1588,3.67259e+07,35,930,2662,6.8216e+06,1866
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 132,1,866.756,4545704,1,0,1588,3.67643e+07,36,930,2663,6.92887e+06,1932
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 133,1,868.862,4619016,1,0,1588,3.73324e+07,37,930,2664,7.0233e+06,2013
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 134,1,870.652,4679516,1,0,1588,3.78113e+07,38,930,2665,7.12232e+06,2109
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 135,1,873.161,4771932,1,0,1588,3.85004e+07,39,930,2666,7.24543e+06,2220
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_4_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_4_2==1)))))] = FALSE
(forward)formula 136,1,874.255,4805668,1,0,1588,3.8783e+07,40,930,2667,7.30412e+06,2336
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 137,1,920.681,4962652,1,0,1588,3.99326e+07,14,930,2631,7.48722e+06,90
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 138,1,924.758,4962652,1,0,1588,3.99326e+07,15,930,2633,7.48722e+06,161
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 139,1,926.778,4962652,1,0,1588,3.99326e+07,16,930,2635,7.48722e+06,232
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 140,1,927.923,4962652,1,0,1588,3.99326e+07,17,930,2637,7.48722e+06,308
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 141,1,929.809,4962652,1,0,1588,3.99326e+07,18,930,2639,7.48722e+06,374
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 142,1,931.603,4962652,1,0,1588,3.99326e+07,19,930,2641,7.48722e+06,455
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 143,1,932.663,4962652,1,0,1588,3.99326e+07,20,930,2643,7.48722e+06,551
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 144,1,934.081,4962652,1,0,1588,3.99326e+07,21,930,2645,7.48722e+06,662
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_4_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_4_3==1)))))] = FALSE
(forward)formula 145,1,936.246,4962652,1,0,1588,3.99326e+07,22,930,2647,7.48722e+06,778
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 146,1,946.593,4962652,1,0,1588,3.99326e+07,23,930,2649,7.48722e+06,889
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 147,1,949.491,4962652,1,0,1588,3.99326e+07,24,930,2650,7.48722e+06,960
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 148,1,951.959,4962652,1,0,1588,3.99326e+07,25,930,2651,7.48722e+06,1031
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 149,1,953.726,4962652,1,0,1588,3.99326e+07,26,930,2652,7.48722e+06,1102
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 150,1,955.594,4962652,1,0,1588,3.99326e+07,27,930,2653,7.48722e+06,1173
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 151,1,957.266,4962652,1,0,1588,3.99326e+07,28,930,2654,7.48722e+06,1244
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 152,1,958.24,4962652,1,0,1588,3.99326e+07,29,930,2655,7.48722e+06,1315
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 153,1,958.599,4962652,1,0,1588,3.99326e+07,30,930,2656,7.48722e+06,1391
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_4_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_4_4==1)))))] = FALSE
(forward)formula 154,1,959.53,4962652,1,0,1588,3.99326e+07,31,930,2657,7.48722e+06,1512
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(p1_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(p1_0_4==1)))))] = FALSE
(forward)formula 155,1,973.389,4962652,1,0,1588,3.99326e+07,32,930,2659,7.48722e+06,1583
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(p1_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(p1_0_4==1)))))] = FALSE
(forward)formula 156,1,978.401,4962652,1,0,1588,3.99326e+07,33,930,2660,7.48722e+06,1669
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(p1_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(p1_0_4==1)))))] = FALSE
(forward)formula 157,1,982.132,4962652,1,0,1588,3.99326e+07,34,930,2661,7.48722e+06,1755
Formula is TRUE !

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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-05"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool itstools"
echo " Input is Anderson-PT-05, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-174853736900099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;