Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716343443182

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 02:04:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 02:04:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:04:04] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-22 02:04:04] [INFO ] Transformed 320 places.
[2024-05-22 02:04:04] [INFO ] Transformed 271 transitions.
[2024-05-22 02:04:04] [INFO ] Found NUPN structural information;
[2024-05-22 02:04:04] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 138 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 308 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 308 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 304 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 304 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 304 transition count 255
Applied a total of 32 rules in 71 ms. Remains 304 /320 variables (removed 16) and now considering 255/271 (removed 16) transitions.
// Phase 1: matrix 255 rows 304 cols
[2024-05-22 02:04:04] [INFO ] Computed 62 invariants in 24 ms
[2024-05-22 02:04:04] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-22 02:04:04] [INFO ] Invariant cache hit.
[2024-05-22 02:04:05] [INFO ] Implicit Places using invariants and state equation in 294 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 608 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 303/320 places, 255/271 transitions.
Applied a total of 0 rules in 5 ms. Remains 303 /303 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 700 ms. Remains : 303/320 places, 255/271 transitions.
Support contains 138 out of 303 places after structural reductions.
[2024-05-22 02:04:05] [INFO ] Flatten gal took : 45 ms
[2024-05-22 02:04:05] [INFO ] Flatten gal took : 19 ms
[2024-05-22 02:04:05] [INFO ] Input system was already deterministic with 255 transitions.
Reduction of identical properties reduced properties to check from 94 to 93
RANDOM walk for 40000 steps (347 resets) in 1909 ms. (20 steps per ms) remains 8/93 properties
BEST_FIRST walk for 40004 steps (46 resets) in 262 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (50 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (48 resets) in 361 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (51 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (57 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (60 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (50 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (50 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
// Phase 1: matrix 255 rows 303 cols
[2024-05-22 02:04:06] [INFO ] Computed 61 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 148/172 variables, 32/32 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 111/283 variables, 27/59 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4/287 variables, 2/61 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 242/529 variables, 287/348 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 9 (OVERLAPS) 19/548 variables, 11/359 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-22 02:04:07] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 22 ms to minimize.
[2024-05-22 02:04:07] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:04:07] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:04:07] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 4/363 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/548 variables, 0/363 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/554 variables, 3/366 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 0/366 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/556 variables, 1/367 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/556 variables, 0/367 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/558 variables, 1/368 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/558 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 368 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 60/72 variables, 13/13 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 96/168 variables, 19/32 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 103/271 variables, 25/57 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/58 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 16/287 variables, 4/62 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 242/529 variables, 287/349 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 4/353 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/353 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 19/548 variables, 11/364 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 1/365 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 3/368 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/554 variables, 3/371 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/556 variables, 1/372 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-22 02:04:09] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:04:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 2/374 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/556 variables, 0/374 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 2/558 variables, 1/375 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-22 02:04:09] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 1/376 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/376 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/376 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 376 constraints, problems are : Problem set: 3 solved, 5 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 7/7 constraints]
After SMT, in 3312ms problems are : Problem set: 3 solved, 5 unsolved
Parikh walk visited 0 properties in 8668 ms.
Support contains 12 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 255/255 transitions.
Graph (complete) has 589 edges and 303 vertex of which 298 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 298 transition count 236
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 32 place count 284 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 283 transition count 235
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 33 place count 283 transition count 226
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 51 place count 274 transition count 226
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 66 place count 259 transition count 211
Iterating global reduction 3 with 15 rules applied. Total rules applied 81 place count 259 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 259 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 84 place count 259 transition count 207
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 258 transition count 207
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 95 place count 249 transition count 198
Iterating global reduction 4 with 9 rules applied. Total rules applied 104 place count 249 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 113 place count 249 transition count 189
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 116 place count 247 transition count 188
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 116 place count 247 transition count 185
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 122 place count 244 transition count 185
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 276 place count 167 transition count 108
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 167 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 278 place count 166 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 279 place count 166 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 280 place count 165 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 281 place count 164 transition count 106
Applied a total of 281 rules in 82 ms. Remains 164 /303 variables (removed 139) and now considering 106/255 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 164/303 places, 106/255 transitions.
RANDOM walk for 40000 steps (1464 resets) in 406 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (271 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (284 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (318 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (282 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (294 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1471224 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :4 out of 5
Probabilistic random walk after 1471224 steps, saw 272962 distinct states, run finished after 3004 ms. (steps per millisecond=489 ) properties seen :4
// Phase 1: matrix 106 rows 164 cols
[2024-05-22 02:04:22] [INFO ] Computed 60 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/68 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/129 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/138 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 88/227 variables, 139/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/243 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/247 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 02:04:22] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/249 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/249 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 12/261 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/261 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/261 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/270 variables, 9/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/270 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/270 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/68 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/129 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 02:04:22] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-22 02:04:22] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-22 02:04:22] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 02:04:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/138 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/139 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 88/227 variables, 139/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/243 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/247 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/247 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/247 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/249 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/249 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 12/261 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/261 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/261 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 9/270 variables, 9/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/270 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/270 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 478ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 106/106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 164 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 162 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 161 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 159 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 158 transition count 104
Applied a total of 11 rules in 19 ms. Remains 158 /164 variables (removed 6) and now considering 104/106 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 158/164 places, 104/106 transitions.
RANDOM walk for 40000 steps (1887 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (376 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 231402 steps, run visited all 1 properties in 349 ms. (steps per millisecond=663 )
Probabilistic random walk after 231402 steps, saw 58281 distinct states, run finished after 353 ms. (steps per millisecond=655 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-22 02:04:23] [INFO ] Flatten gal took : 14 ms
[2024-05-22 02:04:23] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:04:23] [INFO ] Input system was already deterministic with 255 transitions.
Computed a total of 104 stabilizing places and 97 stable transitions
Graph (complete) has 589 edges and 303 vertex of which 298 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 285 transition count 237
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 285 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 285 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 277 transition count 226
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 277 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 277 transition count 219
Applied a total of 62 rules in 17 ms. Remains 277 /303 variables (removed 26) and now considering 219/255 (removed 36) transitions.
// Phase 1: matrix 219 rows 277 cols
[2024-05-22 02:04:23] [INFO ] Computed 61 invariants in 4 ms
[2024-05-22 02:04:23] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 02:04:23] [INFO ] Invariant cache hit.
[2024-05-22 02:04:23] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-22 02:04:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:26] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:04:26] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:04:26] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:04:27] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:27] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:04:27] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:28] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:04:28] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:04:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:04:29] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
[2024-05-22 02:04:29] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:04:29] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:31] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:31] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:04:31] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:04:31] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:04:31] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:04:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:04:32] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:04:32] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:04:32] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-22 02:04:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:04:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 4 ms to minimize.
[2024-05-22 02:04:32] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:04:33] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:04:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 219/496 variables, 277/365 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:35] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:04:35] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:04:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-22 02:04:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:04:36] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:39] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:04:39] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:04:39] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:04:41] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 12/382 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:41] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:43] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:48] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:04:48] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:48] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:04:49] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:04:49] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/496 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:51] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:04:51] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 18 (INCLUDED_ONLY) 0/496 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 391 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 53/114 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:04:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:04:56] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:04:56] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:57] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:04:58] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:04:58] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:04:58] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-22 02:04:58] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:04:58] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:04:58] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:04:58] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:04:59] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:04:59] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:05:00] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-22 02:05:00] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:05:00] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:05:01] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:05:01] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:05:01] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 219/496 variables, 277/418 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 218/636 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 02:05:09] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:05:10] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:05:11] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2024-05-22 02:05:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 5 ms to minimize.
[2024-05-22 02:05:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:05:15] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 6/642 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 642 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 86/86 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 277/303 places, 219/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 277/303 places, 219/255 transitions.
[2024-05-22 02:05:23] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:05:23] [INFO ] Flatten gal took : 28 ms
[2024-05-22 02:05:23] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-22 02:05:23] [INFO ] Flatten gal took : 28 ms
[2024-05-22 02:05:23] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:05:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17221829025427753622.gal : 9 ms
[2024-05-22 02:05:23] [INFO ] Time to serialize properties into /tmp/CTLFireability18206456357294047889.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17221829025427753622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18206456357294047889.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:05:53] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:05:53] [INFO ] Applying decomposition
[2024-05-22 02:05:53] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4119506727843857657.txt' '-o' '/tmp/graph4119506727843857657.bin' '-w' '/tmp/graph4119506727843857657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4119506727843857657.bin' '-l' '-1' '-v' '-w' '/tmp/graph4119506727843857657.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:05:54] [INFO ] Decomposing Gal with order
[2024-05-22 02:05:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:05:54] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 02:05:54] [INFO ] Flatten gal took : 48 ms
[2024-05-22 02:05:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-22 02:05:54] [INFO ] Time to serialize gal into /tmp/CTLFireability274781839269289544.gal : 6 ms
[2024-05-22 02:05:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8908929626868197140.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability274781839269289544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8908929626868197140.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Graph (complete) has 589 edges and 303 vertex of which 298 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 297 transition count 235
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 281 transition count 235
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 281 transition count 225
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 271 transition count 225
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 257 transition count 211
Iterating global reduction 2 with 14 rules applied. Total rules applied 81 place count 257 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 257 transition count 208
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 249 transition count 200
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 249 transition count 200
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 107 place count 249 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 248 transition count 193
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 108 place count 248 transition count 190
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 114 place count 245 transition count 190
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 254 place count 175 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 175 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 173 transition count 117
Applied a total of 257 rules in 62 ms. Remains 173 /303 variables (removed 130) and now considering 117/255 (removed 138) transitions.
// Phase 1: matrix 117 rows 173 cols
[2024-05-22 02:06:24] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 02:06:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 02:06:24] [INFO ] Invariant cache hit.
[2024-05-22 02:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:06:24] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-22 02:06:24] [INFO ] Redundant transitions in 2 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-22 02:06:24] [INFO ] Invariant cache hit.
[2024-05-22 02:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/172 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 117/289 variables, 172/231 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-22 02:06:26] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-22 02:06:27] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:06:27] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:06:27] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-22 02:06:28] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-22 02:06:29] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:06:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:06:29] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-22 02:06:29] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (OVERLAPS) 1/290 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-22 02:06:30] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/290 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/290 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 18 (OVERLAPS) 0/290 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 243 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7835 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 173/173 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 1/171 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 1/172 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 117/289 variables, 172/241 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 114/356 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (OVERLAPS) 1/290 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (OVERLAPS) 0/290 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 357 constraints, problems are : Problem set: 0 solved, 114 unsolved in 20718 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 173/173 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 10/10 constraints]
After SMT, in 28574ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 28575ms
Starting structural reductions in SI_CTL mode, iteration 1 : 173/303 places, 117/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28936 ms. Remains : 173/303 places, 117/255 transitions.
[2024-05-22 02:06:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:06:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:06:53] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-22 02:06:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:06:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:06:53] [INFO ] Time to serialize gal into /tmp/CTLFireability14970810472744153581.gal : 1 ms
[2024-05-22 02:06:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2768826095712440943.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14970810472744153581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2768826095712440943.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:07:23] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:07:23] [INFO ] Applying decomposition
[2024-05-22 02:07:23] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10655423961594899462.txt' '-o' '/tmp/graph10655423961594899462.bin' '-w' '/tmp/graph10655423961594899462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10655423961594899462.bin' '-l' '-1' '-v' '-w' '/tmp/graph10655423961594899462.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:07:23] [INFO ] Decomposing Gal with order
[2024-05-22 02:07:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:07:23] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-22 02:07:23] [INFO ] Flatten gal took : 30 ms
[2024-05-22 02:07:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2024-05-22 02:07:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13988790710913182288.gal : 11 ms
[2024-05-22 02:07:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17129341698523521902.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13988790710913182288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17129341698523521902.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.99354e+13,0.406509,22120,2350,509,50533,2118,341,40668,159,8297,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A((E(((u51.p18==1)&&(u51.p312==1)) U (i8.u32.p237==1)) * (i0.u2.p78==1)) U AF(((u51.p21==1)&&(u51.p312==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(!(EG(!(((u51.p21==1)&&(u51.p312==1)))))) U (!((E(((u51.p18==1)&&(u51.p312==1)) U (i8....300
Reverse transition relation is NOT exact ! Due to transitions t0, t45, t77, t97, t98, t101, t102, t105, u14.t25, u51.t55, u51.t107, i0.t8, i0.u2.t12, i0.u2...417
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 284 transition count 236
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 284 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 284 transition count 233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 274 transition count 223
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 274 transition count 223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 273 transition count 214
Applied a total of 71 rules in 24 ms. Remains 273 /303 variables (removed 30) and now considering 214/255 (removed 41) transitions.
// Phase 1: matrix 214 rows 273 cols
[2024-05-22 02:07:53] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 02:07:53] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-22 02:07:53] [INFO ] Invariant cache hit.
[2024-05-22 02:07:54] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-22 02:07:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:57] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/487 variables, 273/336 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:08:02] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-22 02:08:02] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-22 02:08:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:08:02] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:08:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:08:02] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:08:02] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:08:03] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:08:03] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:04] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:05] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:08:05] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:07] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:08:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:08:09] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 11/370 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/487 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:14] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/487 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:16] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:08:16] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:18] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:08:22] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:08:22] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/487 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 381 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:25] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:08:25] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-22 02:08:25] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:08:25] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:08:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:27] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:08:27] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 214/487 variables, 273/388 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 213/601 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:33] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-22 02:08:33] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-22 02:08:33] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:08:37] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:08:39] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 3 ms to minimize.
[2024-05-22 02:08:39] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 6/607 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 607 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 60/60 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 273/303 places, 214/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 273/303 places, 214/255 transitions.
[2024-05-22 02:08:54] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:08:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:08:54] [INFO ] Input system was already deterministic with 214 transitions.
[2024-05-22 02:08:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:08:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:08:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14379166254197631730.gal : 1 ms
[2024-05-22 02:08:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7991166229816194113.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14379166254197631730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7991166229816194113.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:09:24] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:09:24] [INFO ] Applying decomposition
[2024-05-22 02:09:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12749354729882660637.txt' '-o' '/tmp/graph12749354729882660637.bin' '-w' '/tmp/graph12749354729882660637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12749354729882660637.bin' '-l' '-1' '-v' '-w' '/tmp/graph12749354729882660637.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:09:24] [INFO ] Decomposing Gal with order
[2024-05-22 02:09:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:09:24] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 02:09:24] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:09:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 02:09:24] [INFO ] Time to serialize gal into /tmp/CTLFireability111994976090329239.gal : 3 ms
[2024-05-22 02:09:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17885158779161963651.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability111994976090329239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17885158779161963651.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22275e+19,4.68155,123032,4700,631,279538,5735,696,283178,185,17562,0


Converting to forward existential form...Done !
original formula: EG(AF(AX((i0.u1.p3==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(EX(!((i0.u1.p3==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t87, t158, t175, t176, t208, i0.u30.t79, i1.t119, i1.u6.t124, i1.u6.t125, i1.u7...821
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 288 transition count 240
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 288 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 288 transition count 238
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 40 place count 280 transition count 230
Iterating global reduction 1 with 8 rules applied. Total rules applied 48 place count 280 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 53 place count 280 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 279 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 279 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 279 transition count 223
Applied a total of 56 rules in 18 ms. Remains 279 /303 variables (removed 24) and now considering 223/255 (removed 32) transitions.
// Phase 1: matrix 223 rows 279 cols
[2024-05-22 02:09:54] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 02:09:54] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-22 02:09:54] [INFO ] Invariant cache hit.
[2024-05-22 02:09:54] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-22 02:09:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/502 variables, 279/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:09:58] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:09:58] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:09:59] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:09:59] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:09:59] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:10:02] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 13/358 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:03] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-22 02:10:03] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:10:03] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 4 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 02:10:04] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:10:05] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 16/374 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:07] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:10:07] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:10:07] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:10:07] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:11] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:10:11] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:10:11] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:10:12] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:10:12] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:10:12] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/502 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:14] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:10:15] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:10:15] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 14 (OVERLAPS) 0/502 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 387 constraints, problems are : Problem set: 0 solved, 222 unsolved in 25865 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:22] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:10:22] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:10:22] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:10:22] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:10:22] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:10:22] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:10:22] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:25] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 223/502 variables, 279/396 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 222/618 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:10:31] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:10:31] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-22 02:10:31] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:10:32] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-22 02:10:33] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:10:37] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:10:38] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 7/625 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 625 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 63/63 constraints]
After SMT, in 55921ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 55928ms
Starting structural reductions in LTL mode, iteration 1 : 279/303 places, 223/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56305 ms. Remains : 279/303 places, 223/255 transitions.
[2024-05-22 02:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:10:50] [INFO ] Input system was already deterministic with 223 transitions.
[2024-05-22 02:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:10:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5614612016238864496.gal : 2 ms
[2024-05-22 02:10:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4587966342884148561.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5614612016238864496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4587966342884148561.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:11:20] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:11:20] [INFO ] Applying decomposition
[2024-05-22 02:11:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8939795214376144015.txt' '-o' '/tmp/graph8939795214376144015.bin' '-w' '/tmp/graph8939795214376144015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8939795214376144015.bin' '-l' '-1' '-v' '-w' '/tmp/graph8939795214376144015.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:11:20] [INFO ] Decomposing Gal with order
[2024-05-22 02:11:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:11:20] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 02:11:20] [INFO ] Flatten gal took : 25 ms
[2024-05-22 02:11:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 02:11:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11719568664592361037.gal : 3 ms
[2024-05-22 02:11:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11479935055457883672.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11719568664592361037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11479935055457883672.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.51128e+19,5.40119,139540,6775,477,298627,4524,717,436925,160,14513,0


Converting to forward existential form...Done !
original formula: A(!((E(AG((i8.i0.u67.p276!=1)) U (((i2.u11.p83==1)&&(i0.u33.p37==1))&&(i0.u33.p164==1))) * A(!(((i4.u30.p147==1) * E(((i4.u28.p142==1)&&(...424
=> equivalent forward existential formula: [((Init * !(EG(!((E(!(E(TRUE U !(!((E(!((i10.i0.u42.p192==1)) U (!(((i10.i0.u44.p204==1)&&(i9.i0.u54.p232==1))) ...1193
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t164, t182, t183, i0.u33.t79, i1.t123, i1.i0.u6.t130, i1.i0.u6.t131, i1.i1.t128...944
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 286 transition count 238
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 286 transition count 238
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 286 transition count 235
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 277 transition count 226
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 277 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 277 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 276 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 276 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 276 transition count 217
Applied a total of 65 rules in 25 ms. Remains 276 /303 variables (removed 27) and now considering 217/255 (removed 38) transitions.
// Phase 1: matrix 217 rows 276 cols
[2024-05-22 02:11:51] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 02:11:51] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 02:11:51] [INFO ] Invariant cache hit.
[2024-05-22 02:11:51] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-22 02:11:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:11:54] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:11:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:11:56] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:11:56] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:11:57] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:11:57] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 217/493 variables, 276/351 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:11:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:11:59] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:11:59] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-22 02:11:59] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:11:59] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:11:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:12:00] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:12:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:12:00] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:12:01] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:12:01] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 4 ms to minimize.
[2024-05-22 02:12:01] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:12:01] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:12:01] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 14/365 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:04] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:12:04] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:12:04] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:12:04] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:12:04] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:05] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:12:05] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-22 02:12:05] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:12:05] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:12:05] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:12:05] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:12:06] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:12:06] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:12:06] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:12:06] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 10/380 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:08] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:12:08] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:13] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/493 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:15] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:12:15] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-22 02:12:15] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:12:15] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:12:15] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:12:15] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:12:15] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:12:16] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:12:16] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:12:16] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:12:16] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:12:16] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 12/395 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 17 (OVERLAPS) 0/493 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 395 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 58/119 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:22] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:12:22] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:12:22] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 12/131 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:24] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:12:25] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:12:25] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:12:25] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:12:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:12:25] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:26] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:12:26] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:12:26] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:12:26] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:12:26] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:12:26] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:12:26] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:28] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:12:28] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 217/493 variables, 276/422 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 216/638 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-22 02:12:34] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:12:34] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:12:34] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:12:41] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 642 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 89/89 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 276/303 places, 217/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60511 ms. Remains : 276/303 places, 217/255 transitions.
[2024-05-22 02:12:51] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:12:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:12:51] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-22 02:12:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:12:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15448193574233215085.gal : 1 ms
[2024-05-22 02:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability10836428189894025010.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15448193574233215085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10836428189894025010.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:13:21] [INFO ] Flatten gal took : 13 ms
[2024-05-22 02:13:21] [INFO ] Applying decomposition
[2024-05-22 02:13:21] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7998562642059339040.txt' '-o' '/tmp/graph7998562642059339040.bin' '-w' '/tmp/graph7998562642059339040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7998562642059339040.bin' '-l' '-1' '-v' '-w' '/tmp/graph7998562642059339040.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:13:21] [INFO ] Decomposing Gal with order
[2024-05-22 02:13:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:13:21] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-22 02:13:21] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:13:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 02:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability3660029146981306456.gal : 3 ms
[2024-05-22 02:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4819260136283293977.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3660029146981306456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4819260136283293977.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.78592e+19,4.53125,134192,12931,576,332591,3505,728,318562,183,9848,0


Converting to forward existential form...Done !
original formula: (EF((AF((((i2.u9.p48==0)||(i2.u9.p70==0)) * EX(((i10.i1.u47.p224==0)||(i10.i3.u59.p257==0))))) * AG((EX((i12.i0.u70.p300==0)) * (i10.i2.u...198
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(EG(!((((i2.u9.p48==0)||(i2.u9.p70==0)) * EX(((i10.i1.u47.p224==0)||(i10.i3.u59.p257==0))...298
(forward)formula 0,0,4.56432,134192,1,0,332591,3505,737,318562,188,9848,319
FORMULA DES-PT-10b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Graph (complete) has 589 edges and 303 vertex of which 298 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 297 transition count 234
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 280 transition count 234
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 35 place count 280 transition count 225
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 53 place count 271 transition count 225
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 255 transition count 209
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 255 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 255 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 255 transition count 205
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 254 transition count 205
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 98 place count 246 transition count 197
Iterating global reduction 3 with 8 rules applied. Total rules applied 106 place count 246 transition count 197
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 114 place count 246 transition count 189
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 244 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 117 place count 244 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 119 place count 243 transition count 187
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 259 place count 173 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 261 place count 171 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 262 place count 170 transition count 115
Applied a total of 262 rules in 46 ms. Remains 170 /303 variables (removed 133) and now considering 115/255 (removed 140) transitions.
// Phase 1: matrix 115 rows 170 cols
[2024-05-22 02:13:26] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 02:13:26] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 02:13:26] [INFO ] Invariant cache hit.
[2024-05-22 02:13:26] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-22 02:13:26] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-22 02:13:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 3/169 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 115/284 variables, 169/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:13:27] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:13:27] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:13:29] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:13:29] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:13:29] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:13:29] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:13:31] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-22 02:13:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/285 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:13:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/285 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 15 (OVERLAPS) 0/285 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 237 constraints, problems are : Problem set: 0 solved, 111 unsolved in 8337 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 3/169 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 115/284 variables, 169/236 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 111/347 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 1/285 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:13:42] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:13:44] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:13:44] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 14 (OVERLAPS) 0/285 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 351 constraints, problems are : Problem set: 0 solved, 111 unsolved in 21278 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 12/12 constraints]
After SMT, in 29664ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 29666ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/303 places, 115/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29959 ms. Remains : 170/303 places, 115/255 transitions.
[2024-05-22 02:13:56] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:13:56] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:13:56] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-22 02:13:56] [INFO ] Flatten gal took : 20 ms
[2024-05-22 02:13:56] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:13:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12693053549583203181.gal : 1 ms
[2024-05-22 02:13:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10044254411265894970.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12693053549583203181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10044254411265894970.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:14:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:14:26] [INFO ] Applying decomposition
[2024-05-22 02:14:26] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10218344899227295548.txt' '-o' '/tmp/graph10218344899227295548.bin' '-w' '/tmp/graph10218344899227295548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10218344899227295548.bin' '-l' '-1' '-v' '-w' '/tmp/graph10218344899227295548.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:14:26] [INFO ] Decomposing Gal with order
[2024-05-22 02:14:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:14:26] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 02:14:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:14:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 2 ms.
[2024-05-22 02:14:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7985002783109749860.gal : 2 ms
[2024-05-22 02:14:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1263957699102632072.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7985002783109749860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1263957699102632072.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.91161e+13,0.454995,22376,2346,470,47989,1372,363,57855,152,5533,0


Converting to forward existential form...Done !
original formula: AF((EG(EF((((i13.i0.u4.p94==1)||(i2.i0.u9.p142==0))||(i2.i1.u12.p148==0)))) + (i1.u8.p126==1)))
=> equivalent forward existential formula: [FwdG(Init,!((EG(E(TRUE U (((i13.i0.u4.p94==1)||(i2.i0.u9.p142==0))||(i2.i1.u12.p148==0)))) + (i1.u8.p126==1))))...164
Reverse transition relation is NOT exact ! Due to transitions t1, t75, t96, t99, t100, t103, u15.t35, u52.t2, u52.t105, i0.t11, i0.u2.t16, i0.u2.t20, i0.u2...394
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 287 transition count 239
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 287 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 287 transition count 236
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 278 transition count 227
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 278 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 278 transition count 221
Applied a total of 59 rules in 13 ms. Remains 278 /303 variables (removed 25) and now considering 221/255 (removed 34) transitions.
// Phase 1: matrix 221 rows 278 cols
[2024-05-22 02:14:56] [INFO ] Computed 61 invariants in 4 ms
[2024-05-22 02:14:56] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 02:14:56] [INFO ] Invariant cache hit.
[2024-05-22 02:14:56] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-22 02:14:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/499 variables, 278/339 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:00] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:15:00] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:15:00] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:15:00] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:15:01] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
[2024-05-22 02:15:01] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:15:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:15:01] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-22 02:15:01] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:15:02] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:15:02] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-05-22 02:15:02] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-22 02:15:02] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-22 02:15:02] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:15:02] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:15:02] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:15:02] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 17/356 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:05] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:15:05] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:15:05] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-22 02:15:05] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:15:05] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:15:06] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:06] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:15:07] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:15:07] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:15:07] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-22 02:15:07] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-22 02:15:08] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 16/378 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:15:10] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:15:10] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:15] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:15:15] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:15:15] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:15:15] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:15:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
[2024-05-22 02:15:15] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:15:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:15:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/499 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:18] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:15:18] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:21] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:24] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:25] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/499 variables, and 394 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 55/116 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:28] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:15:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:15:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:15:29] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:29] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:15:30] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 221/499 variables, 278/400 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 220/620 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:15:35] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-22 02:15:36] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:15:36] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:15:36] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:15:37] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:15:44] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-22 02:15:44] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 7/627 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 627 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 68/68 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 278/303 places, 221/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 278/303 places, 221/255 transitions.
[2024-05-22 02:15:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:15:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:15:57] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-22 02:15:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:15:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:15:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8217803219443817660.gal : 2 ms
[2024-05-22 02:15:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17429361579573440549.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8217803219443817660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17429361579573440549.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:16:27] [INFO ] Flatten gal took : 13 ms
[2024-05-22 02:16:27] [INFO ] Applying decomposition
[2024-05-22 02:16:27] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16813103940506885777.txt' '-o' '/tmp/graph16813103940506885777.bin' '-w' '/tmp/graph16813103940506885777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16813103940506885777.bin' '-l' '-1' '-v' '-w' '/tmp/graph16813103940506885777.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:16:27] [INFO ] Decomposing Gal with order
[2024-05-22 02:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:16:27] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 02:16:27] [INFO ] Flatten gal took : 46 ms
[2024-05-22 02:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 02:16:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7065433771225752325.gal : 15 ms
[2024-05-22 02:16:27] [INFO ] Time to serialize properties into /tmp/CTLFireability9758609913067550790.ctl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7065433771225752325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9758609913067550790.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.10745e+19,13.0088,251160,5407,590,461818,5683,706,565868,175,19516,0


Converting to forward existential form...Done !
original formula: (E((!(AF((((i8.i0.u55.p233==1)&&(i11.u63.p263==1)) + E(((i5.i1.u18.p110==1)&&(i5.i1.u26.p140==1)) U ((((i10.i0.u44.p199==1)&&(i10.i0.u44....763
=> equivalent forward existential formula: ([(((FwdU(FwdU((Init * E((!(!(EG(!((((i8.i0.u55.p233==1)&&(i11.u63.p263==1)) + E(((i5.i1.u18.p110==1)&&(i5.i1.u2...1761
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t87, t164, t182, t183, u35.t76, i0.u33.t79, i2.t124, i2.u6.t130, i2.u6.t131, i2...912
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 286 transition count 238
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 286 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 286 transition count 236
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 277 transition count 227
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 277 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 277 transition count 221
Applied a total of 60 rules in 13 ms. Remains 277 /303 variables (removed 26) and now considering 221/255 (removed 34) transitions.
// Phase 1: matrix 221 rows 277 cols
[2024-05-22 02:16:57] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 02:16:57] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-22 02:16:57] [INFO ] Invariant cache hit.
[2024-05-22 02:16:57] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-22 02:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:01] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:01] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:17:01] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 221/498 variables, 277/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:04] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:17:05] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:17:05] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-22 02:17:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:06] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:17:06] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:17:07] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:17:08] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:17:08] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:17:08] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:10] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:17:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:17:10] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:17:10] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:17:10] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:17:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:17:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 7/358 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 0/498 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 358 constraints, problems are : Problem set: 0 solved, 220 unsolved in 18879 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:17:18] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-22 02:17:21] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:17:21] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:21] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:17:22] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:17:22] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:17:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:17:22] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-22 02:17:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:23] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:17:23] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:24] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 221/498 variables, 277/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 220/616 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:17:30] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:17:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:17:31] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:17:31] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:17:31] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:17:32] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:17:32] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:17:34] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:17:35] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:17:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:17:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:17:35] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:17:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-22 02:17:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:17:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 15/631 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 631 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 73/73 constraints]
After SMT, in 48955ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 48957ms
Starting structural reductions in LTL mode, iteration 1 : 277/303 places, 221/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49597 ms. Remains : 277/303 places, 221/255 transitions.
[2024-05-22 02:17:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:17:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:17:46] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-22 02:17:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:17:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:17:46] [INFO ] Time to serialize gal into /tmp/CTLFireability2566690047134082883.gal : 2 ms
[2024-05-22 02:17:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17173956549887032941.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2566690047134082883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17173956549887032941.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:18:17] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:18:17] [INFO ] Applying decomposition
[2024-05-22 02:18:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5934427192963037369.txt' '-o' '/tmp/graph5934427192963037369.bin' '-w' '/tmp/graph5934427192963037369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5934427192963037369.bin' '-l' '-1' '-v' '-w' '/tmp/graph5934427192963037369.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:18:17] [INFO ] Decomposing Gal with order
[2024-05-22 02:18:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:18:17] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 02:18:17] [INFO ] Flatten gal took : 21 ms
[2024-05-22 02:18:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2024-05-22 02:18:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8261877317266644205.gal : 19 ms
[2024-05-22 02:18:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4353842368117934578.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8261877317266644205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4353842368117934578.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.82769e+19,10.2735,288416,7079,528,695644,4306,732,545588,177,13110,0


Converting to forward existential form...Done !
original formula: A((((i3.i1.u16.p102!=1)||(i10.i2.u65.p252==1)) + AX(FALSE)) U (((i4.u34.p36==1)&&(i4.u34.p164==1)) * (AX(!(A(((i9.i0.u58.p242==1)&&(i9.i0...413
=> equivalent forward existential formula: [((Init * !(EG(!((((i4.u34.p36==1)&&(i4.u34.p164==1)) * (!(EX(!(!(!((E(!(((i11.i0.u44.p204==1)&&(i10.i2.u54.p232...1862
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t87, t163, t182, t183, t215, u35.t76, i2.t116, i2.i0.u8.t158, i2.i0.u8.t159, i2...875
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 284 transition count 236
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 284 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 284 transition count 233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 274 transition count 223
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 274 transition count 223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 274 transition count 216
Applied a total of 68 rules in 9 ms. Remains 274 /303 variables (removed 29) and now considering 216/255 (removed 39) transitions.
// Phase 1: matrix 216 rows 274 cols
[2024-05-22 02:18:47] [INFO ] Computed 61 invariants in 7 ms
[2024-05-22 02:18:47] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 02:18:47] [INFO ] Invariant cache hit.
[2024-05-22 02:18:47] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-22 02:18:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:18:50] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:18:50] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:18:51] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:18:51] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:18:52] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:18:53] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/359 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:18:55] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:18:55] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:18:56] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:18:56] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-22 02:18:56] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:18:56] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:18:59] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-22 02:19:00] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:19:00] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:19:01] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:19:04] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:19:04] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:19:04] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:19:09] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/490 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:19:10] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 17 (OVERLAPS) 0/490 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 381 constraints, problems are : Problem set: 0 solved, 215 unsolved in 29313 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:19:18] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:19:18] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:19:18] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:19:20] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/394 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 215/609 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:19:26] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-22 02:19:26] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:19:27] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2024-05-22 02:19:27] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:19:28] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:19:34] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-05-22 02:19:34] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 7/616 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 616 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 66/66 constraints]
After SMT, in 59371ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 59373ms
Starting structural reductions in LTL mode, iteration 1 : 274/303 places, 216/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59921 ms. Remains : 274/303 places, 216/255 transitions.
[2024-05-22 02:19:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:19:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:19:47] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-22 02:19:47] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:19:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:19:47] [INFO ] Time to serialize gal into /tmp/CTLFireability13301350705583412444.gal : 4 ms
[2024-05-22 02:19:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10116544635141915159.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13301350705583412444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10116544635141915159.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:20:17] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:20:17] [INFO ] Applying decomposition
[2024-05-22 02:20:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph473500536606381848.txt' '-o' '/tmp/graph473500536606381848.bin' '-w' '/tmp/graph473500536606381848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph473500536606381848.bin' '-l' '-1' '-v' '-w' '/tmp/graph473500536606381848.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:20:17] [INFO ] Decomposing Gal with order
[2024-05-22 02:20:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:20:17] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 02:20:17] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:20:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 02:20:17] [INFO ] Time to serialize gal into /tmp/CTLFireability12930738391563048051.gal : 3 ms
[2024-05-22 02:20:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7021805954695434441.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12930738391563048051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7021805954695434441.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54044e+19,14.3797,381796,10890,604,967529,4642,731,750519,178,20410,0


Converting to forward existential form...Done !
original formula: AG(AX((((i4.u9.p46==0)||(i4.u9.p70==0)) + (EF((i8.u66.p286==0)) * EG((i4.u10.p77==0))))))
=> equivalent forward existential formula: ([((EY(FwdU(Init,TRUE)) * !(((i4.u9.p46==0)||(i4.u9.p70==0)))) * !(E(TRUE U (i8.u66.p286==0))))] = FALSE * [((EY...247
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t87, t160, t177, t178, t210, i0.u71.t17, i0.u71.t141, i1.u29.t79, i3.t121, i3.u...815
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 286 transition count 238
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 286 transition count 238
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 286 transition count 235
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 277 transition count 226
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 277 transition count 226
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 277 transition count 220
Applied a total of 61 rules in 14 ms. Remains 277 /303 variables (removed 26) and now considering 220/255 (removed 35) transitions.
// Phase 1: matrix 220 rows 277 cols
[2024-05-22 02:20:47] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 02:20:47] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 02:20:47] [INFO ] Invariant cache hit.
[2024-05-22 02:20:47] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-22 02:20:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/497 variables, 277/338 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:20:51] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:20:51] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:20:51] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:20:51] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:20:51] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:20:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:20:52] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:20:52] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:20:52] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:20:53] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 10/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:20:55] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:20:55] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-22 02:20:55] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:20:55] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:20:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 16/364 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:20:57] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:20:57] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:20:58] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:20:58] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:20:58] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:20:58] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:20:58] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:20:58] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 8/372 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:21:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 10/382 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:21:05] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/497 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (OVERLAPS) 0/497 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 383 constraints, problems are : Problem set: 0 solved, 219 unsolved in 23976 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 45/106 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:21:13] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:21:14] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 220/497 variables, 277/393 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 219/612 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:21:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:21:20] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-22 02:21:23] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 7/619 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:21:40] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:21:40] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 621 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 64/64 constraints]
After SMT, in 54023ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 54025ms
Starting structural reductions in LTL mode, iteration 1 : 277/303 places, 220/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54404 ms. Remains : 277/303 places, 220/255 transitions.
[2024-05-22 02:21:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:21:41] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:21:41] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-22 02:21:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:21:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:21:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10708694332002399608.gal : 1 ms
[2024-05-22 02:21:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6825302643054115145.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10708694332002399608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6825302643054115145.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:22:11] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:22:11] [INFO ] Applying decomposition
[2024-05-22 02:22:11] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12242901436537411843.txt' '-o' '/tmp/graph12242901436537411843.bin' '-w' '/tmp/graph12242901436537411843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12242901436537411843.bin' '-l' '-1' '-v' '-w' '/tmp/graph12242901436537411843.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:22:11] [INFO ] Decomposing Gal with order
[2024-05-22 02:22:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:22:11] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 02:22:11] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:22:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 02:22:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14843192133528435816.gal : 2 ms
[2024-05-22 02:22:11] [INFO ] Time to serialize properties into /tmp/CTLFireability414121859600083012.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14843192133528435816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability414121859600083012.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.28988e+19,8.57362,252528,24231,459,651414,4205,736,515992,160,13773,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Graph (complete) has 589 edges and 303 vertex of which 298 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 297 transition count 234
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 280 transition count 234
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 35 place count 280 transition count 225
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 53 place count 271 transition count 225
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 255 transition count 209
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 255 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 255 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 255 transition count 205
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 254 transition count 205
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 245 transition count 196
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 245 transition count 196
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 117 place count 245 transition count 187
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 120 place count 243 transition count 186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 120 place count 243 transition count 183
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 126 place count 240 transition count 183
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 264 place count 171 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 169 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 267 place count 168 transition count 112
Applied a total of 267 rules in 39 ms. Remains 168 /303 variables (removed 135) and now considering 112/255 (removed 143) transitions.
// Phase 1: matrix 112 rows 168 cols
[2024-05-22 02:22:42] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:22:42] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 02:22:42] [INFO ] Invariant cache hit.
[2024-05-22 02:22:42] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-22 02:22:42] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-22 02:22:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/167 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 112/279 variables, 167/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:22:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:22:43] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 02:22:43] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:22:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/280 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:22:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:22:45] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:22:45] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:22:46] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/280 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5701 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 2/167 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 112/279 variables, 167/233 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 109/342 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/280 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 343 constraints, problems are : Problem set: 0 solved, 109 unsolved in 16123 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 8/8 constraints]
After SMT, in 21860ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 21863ms
Starting structural reductions in SI_CTL mode, iteration 1 : 168/303 places, 112/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22236 ms. Remains : 168/303 places, 112/255 transitions.
[2024-05-22 02:23:04] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:23:04] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:23:04] [INFO ] Input system was already deterministic with 112 transitions.
RANDOM walk for 542 steps (14 resets) in 12 ms. (41 steps per ms) remains 0/1 properties
FORMULA DES-PT-10b-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 02:23:04] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:23:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:23:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4100499808750050915.gal : 1 ms
[2024-05-22 02:23:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8367329571106911564.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4100499808750050915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8367329571106911564.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 284 transition count 236
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 284 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 284 transition count 233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 274 transition count 223
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 274 transition count 223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 273 transition count 214
Applied a total of 71 rules in 11 ms. Remains 273 /303 variables (removed 30) and now considering 214/255 (removed 41) transitions.
// Phase 1: matrix 214 rows 273 cols
[2024-05-22 02:23:04] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 02:23:04] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 02:23:04] [INFO ] Invariant cache hit.
[2024-05-22 02:23:04] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-22 02:23:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:07] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:08] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/487 variables, 273/336 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:11] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:23:11] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:23:11] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:23:11] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:23:12] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:23:13] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-22 02:23:13] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:23:13] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:23:13] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:15] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:16] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:23:16] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:18] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:23:18] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:23:18] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:23:19] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:23:19] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-22 02:23:19] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:23:19] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-22 02:23:19] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:23:19] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:23:19] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:23:19] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 11/370 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:23] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:23:23] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:23:23] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:23:23] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/487 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:25] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/487 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:27] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 2 ms to minimize.
[2024-05-22 02:23:27] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:29] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:32] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:23:32] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:23:32] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/487 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 381 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:23:36] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:23:36] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:23:36] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:23:37] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:37] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-22 02:23:38] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 214/487 variables, 273/388 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 213/601 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:23:43] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:23:44] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:23:44] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:23:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:23:49] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:23:49] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 6/607 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 607 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 60/60 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 273/303 places, 214/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60457 ms. Remains : 273/303 places, 214/255 transitions.
[2024-05-22 02:24:04] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:24:04] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:24:04] [INFO ] Input system was already deterministic with 214 transitions.
[2024-05-22 02:24:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:24:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:24:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15163016105096458979.gal : 1 ms
[2024-05-22 02:24:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7653661391906665613.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15163016105096458979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7653661391906665613.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:24:34] [INFO ] Flatten gal took : 13 ms
[2024-05-22 02:24:34] [INFO ] Applying decomposition
[2024-05-22 02:24:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18147609918868556620.txt' '-o' '/tmp/graph18147609918868556620.bin' '-w' '/tmp/graph18147609918868556620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18147609918868556620.bin' '-l' '-1' '-v' '-w' '/tmp/graph18147609918868556620.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:24:34] [INFO ] Decomposing Gal with order
[2024-05-22 02:24:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:24:34] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 02:24:35] [INFO ] Flatten gal took : 25 ms
[2024-05-22 02:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 02:24:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8804155142048087343.gal : 2 ms
[2024-05-22 02:24:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17235043010755593954.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8804155142048087343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17235043010755593954.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22275e+19,19.9491,545232,76096,528,1.37897e+06,3987,697,1.02852e+06,178,12641,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Graph (complete) has 589 edges and 303 vertex of which 298 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 297 transition count 234
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 280 transition count 234
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 35 place count 280 transition count 225
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 53 place count 271 transition count 225
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 255 transition count 209
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 255 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 255 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 255 transition count 205
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 254 transition count 205
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 245 transition count 196
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 245 transition count 196
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 117 place count 245 transition count 187
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 120 place count 243 transition count 186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 120 place count 243 transition count 183
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 126 place count 240 transition count 183
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 260 place count 173 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 171 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 263 place count 170 transition count 114
Applied a total of 263 rules in 60 ms. Remains 170 /303 variables (removed 133) and now considering 114/255 (removed 141) transitions.
// Phase 1: matrix 114 rows 170 cols
[2024-05-22 02:25:05] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 02:25:05] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-22 02:25:05] [INFO ] Invariant cache hit.
[2024-05-22 02:25:05] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-22 02:25:05] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-22 02:25:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/167 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 2/169 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:25:07] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 114/283 variables, 169/228 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:25:07] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:25:07] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:25:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:25:08] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:25:08] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 1/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:25:09] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:25:09] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:25:09] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:25:09] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:25:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:25:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:25:11] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:25:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:25:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:25:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-22 02:25:11] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/284 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 17 (OVERLAPS) 0/284 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 245 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7652 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 1/167 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 2/169 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 114/283 variables, 169/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 110/354 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 1/284 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:25:22] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:25:28] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 16 (OVERLAPS) 0/284 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 357 constraints, problems are : Problem set: 0 solved, 110 unsolved in 26166 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 19/19 constraints]
After SMT, in 33858ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 33859ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/303 places, 114/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34286 ms. Remains : 170/303 places, 114/255 transitions.
[2024-05-22 02:25:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:25:39] [INFO ] Flatten gal took : 17 ms
[2024-05-22 02:25:39] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-22 02:25:39] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:25:39] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:25:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7730490487459072782.gal : 1 ms
[2024-05-22 02:25:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2410746271770049305.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7730490487459072782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2410746271770049305.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:26:09] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:26:09] [INFO ] Applying decomposition
[2024-05-22 02:26:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5925180879687244963.txt' '-o' '/tmp/graph5925180879687244963.bin' '-w' '/tmp/graph5925180879687244963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5925180879687244963.bin' '-l' '-1' '-v' '-w' '/tmp/graph5925180879687244963.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:26:09] [INFO ] Decomposing Gal with order
[2024-05-22 02:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:26:09] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-22 02:26:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:26:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 02:26:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1880657110409592621.gal : 2 ms
[2024-05-22 02:26:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14953005465987509694.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1880657110409592621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14953005465987509694.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.25721e+13,0.335521,18164,1923,634,39943,1604,349,29561,154,6409,0


Converting to forward existential form...Done !
original formula: EF(EG(((AF((i2.u10.p135==0)) * (i7.u30.p233==1)) * (i7.u38.p263==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!(EG(!((i2.u10.p135==0)))) * (i7.u30.p233==1)) * (i7.u38.p263==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t73, t86, t94, t98, t99, t102, u14.t33, u15.t79, u50.t1, u50.t104, i0.t9, i0.u2.t14, i0.u...402
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 287 transition count 239
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 287 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 287 transition count 237
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 279 transition count 229
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 279 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 55 place count 279 transition count 224
Applied a total of 55 rules in 20 ms. Remains 279 /303 variables (removed 24) and now considering 224/255 (removed 31) transitions.
// Phase 1: matrix 224 rows 279 cols
[2024-05-22 02:26:39] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 02:26:39] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 02:26:39] [INFO ] Invariant cache hit.
[2024-05-22 02:26:39] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-05-22 02:26:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/503 variables, 279/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:26:43] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 02:26:43] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:26:43] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:26:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:26:43] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-05-22 02:26:43] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:26:43] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:26:44] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:26:44] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:26:44] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:26:44] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:26:44] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:26:44] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:26:44] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:26:44] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:26:45] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:26:45] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 17/357 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:26:46] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:26:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:26:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-22 02:26:47] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:26:49] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:26:49] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:26:49] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:26:49] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:26:49] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:26:49] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:26:49] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:26:49] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-22 02:26:50] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 9/370 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:26:51] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:26:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:26:51] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:26:52] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:26:52] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:26:52] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:26:54] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:26:56] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:26:57] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:27:01] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/503 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:27:03] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/503 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 16 (OVERLAPS) 0/503 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 381 constraints, problems are : Problem set: 0 solved, 223 unsolved in 28711 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 41/102 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:27:09] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:27:10] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:27:10] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:27:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 02:27:11] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:27:11] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-22 02:27:11] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:27:13] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:27:14] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:27:14] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:27:14] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-22 02:27:15] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:27:15] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 224/503 variables, 279/394 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 223/617 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 02:27:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:27:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:27:23] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:27:25] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 4/621 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 621 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 58/58 constraints]
After SMT, in 58762ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 58764ms
Starting structural reductions in LTL mode, iteration 1 : 279/303 places, 224/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59164 ms. Remains : 279/303 places, 224/255 transitions.
[2024-05-22 02:27:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:27:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:27:38] [INFO ] Input system was already deterministic with 224 transitions.
[2024-05-22 02:27:38] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:27:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:27:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11503781646936162016.gal : 1 ms
[2024-05-22 02:27:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17307056921178164702.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11503781646936162016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17307056921178164702.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:28:08] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:28:08] [INFO ] Applying decomposition
[2024-05-22 02:28:08] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17261732712081828747.txt' '-o' '/tmp/graph17261732712081828747.bin' '-w' '/tmp/graph17261732712081828747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17261732712081828747.bin' '-l' '-1' '-v' '-w' '/tmp/graph17261732712081828747.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:28:08] [INFO ] Decomposing Gal with order
[2024-05-22 02:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:28:08] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 02:28:08] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:28:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-22 02:28:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7827259597443232120.gal : 3 ms
[2024-05-22 02:28:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12178766911371317183.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7827259597443232120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12178766911371317183.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.74154e+19,8.45454,156420,4833,470,267889,3276,765,522933,169,13317,0


Converting to forward existential form...Done !
original formula: ((AF(((EX(((i6.u37.p10==0)||(i6.u37.p171==0))) + ((E(((i6.u37.p7==1)&&(i6.u37.p171==1)) U (i9.i2.u47.p195==1)) * AX(((i2.i0.u8.p46==1)&&(...619
=> equivalent forward existential formula: [FwdG(((Init * !((E(((!(EX(!(((i9.i0.u46.p200==1)&&(i9.i1.u52.p226==1))))) + !(EG(!((i6.u36.p169==1))))) + !(EG(...718
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t165, t185, t186, t218, i0.u34.t79, i1.i1.u15.t110, i2.t118, i2.i0.u8.t160, i2....855
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 284 transition count 236
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 284 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 284 transition count 233
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 275 transition count 224
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 275 transition count 224
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 275 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 274 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 274 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 274 transition count 215
Applied a total of 69 rules in 9 ms. Remains 274 /303 variables (removed 29) and now considering 215/255 (removed 40) transitions.
// Phase 1: matrix 215 rows 274 cols
[2024-05-22 02:28:38] [INFO ] Computed 61 invariants in 1 ms
[2024-05-22 02:28:39] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 02:28:39] [INFO ] Invariant cache hit.
[2024-05-22 02:28:39] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-22 02:28:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/489 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:28:42] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:28:42] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:28:42] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-22 02:28:43] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:28:44] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-22 02:28:44] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:28:44] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-22 02:28:44] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:28:44] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:28:44] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:28:45] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:28:45] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:28:47] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:28:47] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:28:47] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:28:48] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:28:48] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:28:49] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:28:49] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-05-22 02:28:49] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:28:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:28:49] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:28:52] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:28:52] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:28:55] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 12 (OVERLAPS) 0/489 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 368 constraints, problems are : Problem set: 0 solved, 214 unsolved in 22319 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 33/94 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:29:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:29:04] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-22 02:29:04] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:29:04] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-22 02:29:04] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:29:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:29:06] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:29:06] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:29:07] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:29:07] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 215/489 variables, 274/389 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 214/603 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 02:29:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:29:12] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:29:12] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:29:16] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:29:17] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:29:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:29:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:29:21] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:29:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 9/612 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 612 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 63/63 constraints]
After SMT, in 52383ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 52386ms
Starting structural reductions in LTL mode, iteration 1 : 274/303 places, 215/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52788 ms. Remains : 274/303 places, 215/255 transitions.
[2024-05-22 02:29:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:29:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:29:31] [INFO ] Input system was already deterministic with 215 transitions.
[2024-05-22 02:29:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:29:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:29:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11106009464911620688.gal : 1 ms
[2024-05-22 02:29:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11936008283480221033.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11106009464911620688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11936008283480221033.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:30:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:30:01] [INFO ] Applying decomposition
[2024-05-22 02:30:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10959012617867374501.txt' '-o' '/tmp/graph10959012617867374501.bin' '-w' '/tmp/graph10959012617867374501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10959012617867374501.bin' '-l' '-1' '-v' '-w' '/tmp/graph10959012617867374501.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:30:01] [INFO ] Decomposing Gal with order
[2024-05-22 02:30:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:30:01] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 02:30:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:30:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 02:30:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12840787198625147990.gal : 6 ms
[2024-05-22 02:30:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1307141409979836509.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12840787198625147990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1307141409979836509.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22275e+19,3.88887,109884,4063,417,268877,3666,708,218339,161,11312,0


Converting to forward existential form...Done !
original formula: ((EG(((i12.i0.u64.p275==0)||(i12.i0.u69.p295==0))) * AX((EF(((i8.i1.u45.p216==1)||(i0.u1.p4==1))) * ((EX((i1.u5.p55==0)) + (i6.i0.u34.p17...489
=> equivalent forward existential formula: (([(Init * !(EG(((i12.i0.u64.p275==0)||(i12.i0.u69.p295==0)))))] = FALSE * ([(EY(Init) * !(E(TRUE U ((i8.i1.u45....1037
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t87, t159, t176, t177, t209, i0.u30.t79, i1.t120, i1.u6.t125, i1.u6.t126, i1.u7...847
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 255/255 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 287 transition count 239
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 287 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 287 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 279 transition count 228
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 279 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 279 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 278 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 278 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 278 transition count 221
Applied a total of 59 rules in 15 ms. Remains 278 /303 variables (removed 25) and now considering 221/255 (removed 34) transitions.
// Phase 1: matrix 221 rows 278 cols
[2024-05-22 02:30:31] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 02:30:32] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 02:30:32] [INFO ] Invariant cache hit.
[2024-05-22 02:30:32] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-22 02:30:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/499 variables, 278/339 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:30:35] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-22 02:30:35] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:30:36] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:30:37] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:30:37] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:30:37] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:30:37] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:30:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:30:37] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:30:37] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-22 02:30:37] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:30:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:30:39] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:30:39] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:30:40] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:30:40] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:30:40] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:30:40] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:30:40] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:30:40] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:30:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:30:40] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:30:41] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:30:41] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:30:41] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:30:41] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 15/374 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:30:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:30:42] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:30:42] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:30:43] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:30:43] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:30:43] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:30:43] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:30:43] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:30:45] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:30:49] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-22 02:30:49] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:30:49] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:30:51] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:30:51] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:30:51] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:30:51] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:30:56] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:30:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:30:56] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/499 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:30:58] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:30:58] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:30:58] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:31:00] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:31:00] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:31:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:31:00] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:31:00] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/499 variables, and 401 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 62/123 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:31:03] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:31:03] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:31:03] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:31:04] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:31:04] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:31:05] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:31:05] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:31:05] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-05-22 02:31:05] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:31:05] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:31:07] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 221/499 variables, 278/412 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 220/632 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 02:31:14] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:31:15] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 634 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 75/75 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 278/303 places, 221/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60460 ms. Remains : 278/303 places, 221/255 transitions.
[2024-05-22 02:31:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:31:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:31:32] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-22 02:31:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:31:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:31:32] [INFO ] Time to serialize gal into /tmp/CTLFireability18222918854802422043.gal : 2 ms
[2024-05-22 02:31:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6979728893168440283.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18222918854802422043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6979728893168440283.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:32:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 02:32:02] [INFO ] Applying decomposition
[2024-05-22 02:32:02] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3170708026620052391.txt' '-o' '/tmp/graph3170708026620052391.bin' '-w' '/tmp/graph3170708026620052391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3170708026620052391.bin' '-l' '-1' '-v' '-w' '/tmp/graph3170708026620052391.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:32:02] [INFO ] Decomposing Gal with order
[2024-05-22 02:32:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:32:02] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 02:32:02] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:32:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 02:32:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12608621697731533376.gal : 3 ms
[2024-05-22 02:32:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8014388070872477109.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12608621697731533376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8014388070872477109.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.20603e+19,16.4679,399520,12222,567,977428,4195,760,875659,186,16136,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 02:32:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:32:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:32:32] [INFO ] Applying decomposition
[2024-05-22 02:32:32] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13671106905251818653.txt' '-o' '/tmp/graph13671106905251818653.bin' '-w' '/tmp/graph13671106905251818653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13671106905251818653.bin' '-l' '-1' '-v' '-w' '/tmp/graph13671106905251818653.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:32:32] [INFO ] Decomposing Gal with order
[2024-05-22 02:32:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:32:32] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-22 02:32:32] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:32:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2024-05-22 02:32:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2042643654143408537.gal : 2 ms
[2024-05-22 02:32:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5922019044994533520.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2042643654143408537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5922019044994533520.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.2678e+20,5.0374,143756,12457,494,338952,3820,779,298181,179,12427,0


Converting to forward existential form...Done !
original formula: (E(EF((i7.i3.u74.p276==1)) U (E((((((i11.i1.u15.p94==1)&&(i10.i1.u46.p184==1))&&(i10.i1.u83.p304==1))||(((i0.i0.u11.p77==1)&&(i12.u87.p26...505
=> equivalent forward existential formula: ([(Init * !(E(E(TRUE U (i7.i3.u74.p276==1)) U (E((((((i11.i1.u15.p94==1)&&(i10.i1.u46.p184==1))&&(i10.i1.u83.p30...633
(forward)formula 0,0,6.09999,144020,1,0,338952,3820,1591,298181,346,12427,249960
FORMULA DES-PT-10b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AF(!(A((E(((i12.u87.p18==1)&&(i12.u87.p312==1)) U (i8.i3.u63.p237==1)) * (i0.i0.u10.p78==1)) U AF(((i12.u87.p21==1)&&(i12.u87.p312==1)...161
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(!(EG(!(((i12.u87.p21==1)&&(i12.u87.p312==1)))))) U (!((E(((i12.u87.p18==1)&&(i12.u87....339
Reverse transition relation is NOT exact ! Due to transitions t0, t61, t145, t214, i0.t130, i0.i0.u10.t135, i0.i0.u10.t137, i0.i0.u10.t140, i0.i0.u10.t142,...968
Detected timeout of ITS tools.
[2024-05-22 03:02:02] [INFO ] Applying decomposition
[2024-05-22 03:02:02] [INFO ] Flatten gal took : 6 ms
[2024-05-22 03:02:02] [INFO ] Decomposing Gal with order
[2024-05-22 03:02:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:02:02] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 03:02:02] [INFO ] Flatten gal took : 11 ms
[2024-05-22 03:02:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 17 ms.
[2024-05-22 03:02:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12058466496557926296.gal : 18 ms
[2024-05-22 03:02:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8630716058596602909.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12058466496557926296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8630716058596602909.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DES-PT-10b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189800674"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;