Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167500321.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 AutonomousCar-PT-07b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167500321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 334K 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 AutonomousCar-PT-07b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-07b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716333865023

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:24:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:24:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:24:27] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-05-21 23:24:27] [INFO ] Transformed 323 places.
[2024-05-21 23:24:27] [INFO ] Transformed 846 transitions.
[2024-05-21 23:24:27] [INFO ] Found NUPN structural information;
[2024-05-21 23:24:27] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Support contains 97 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 293 transition count 816
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 293 transition count 816
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 256 place count 293 transition count 620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 259 place count 290 transition count 617
Iterating global reduction 1 with 3 rules applied. Total rules applied 262 place count 290 transition count 617
Applied a total of 262 rules in 116 ms. Remains 290 /323 variables (removed 33) and now considering 617/846 (removed 229) transitions.
// Phase 1: matrix 617 rows 290 cols
[2024-05-21 23:24:27] [INFO ] Computed 12 invariants in 21 ms
[2024-05-21 23:24:27] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-21 23:24:28] [INFO ] Invariant cache hit.
[2024-05-21 23:24:28] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-05-21 23:24:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 38 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 4 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 4 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 3 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 3 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 3 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 2 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 2 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 3 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 4 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 3 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 3 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 3 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 4 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 53 places in 400 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 37 places in 295 ms of which 4 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 44 places in 346 ms of which 3 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 55 places in 268 ms of which 3 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 42 places in 362 ms of which 4 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 46 places in 314 ms of which 3 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 3 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 2 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 3 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 50 places in 384 ms of which 4 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 4 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 30 places in 417 ms of which 4 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 43 places in 380 ms of which 4 ms to minimize.
SMT process timed out in 33047ms, After SMT, problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 33089ms
Starting structural reductions in LTL mode, iteration 1 : 290/323 places, 617/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34436 ms. Remains : 290/323 places, 617/846 transitions.
Support contains 97 out of 290 places after structural reductions.
[2024-05-21 23:25:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 228 ms
FORMULA AutonomousCar-PT-07b-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:25:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-07b-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 128 ms
[2024-05-21 23:25:02] [INFO ] Input system was already deterministic with 617 transitions.
Support contains 87 out of 290 places (down from 97) after GAL structural reductions.
RANDOM walk for 40000 steps (218 resets) in 2525 ms. (15 steps per ms) remains 2/53 properties
BEST_FIRST walk for 40003 steps (67 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (62 resets) in 143 ms. (277 steps per ms) remains 1/2 properties
[2024-05-21 23:25:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 269/274 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/290 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 617/907 variables, 290/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/907 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 907/907 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 269/274 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 3 ms to minimize.
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Int declared 274/907 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, State Equation: 0/290 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 783ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-21 23:25:04] [INFO ] Flatten gal took : 59 ms
[2024-05-21 23:25:04] [INFO ] Flatten gal took : 52 ms
[2024-05-21 23:25:04] [INFO ] Input system was already deterministic with 617 transitions.
Support contains 81 out of 290 places (down from 83) after GAL structural reductions.
Computed a total of 51 stabilizing places and 52 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Graph (trivial) has 250 edges and 290 vertex of which 4 / 290 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 287 transition count 516
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 128 rules applied. Total rules applied 227 place count 189 transition count 486
Reduce places removed 18 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 23 rules applied. Total rules applied 250 place count 171 transition count 481
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 257 place count 166 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 258 place count 165 transition count 479
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 258 place count 165 transition count 470
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 276 place count 156 transition count 470
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 287 place count 145 transition count 459
Iterating global reduction 5 with 11 rules applied. Total rules applied 298 place count 145 transition count 459
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 301 place count 145 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 302 place count 144 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 302 place count 144 transition count 455
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 304 place count 143 transition count 455
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 305 place count 142 transition count 448
Iterating global reduction 7 with 1 rules applied. Total rules applied 306 place count 142 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 308 place count 142 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 309 place count 141 transition count 446
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 9 with 88 rules applied. Total rules applied 397 place count 97 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 398 place count 97 transition count 401
Discarding 13 places :
Symmetric choice reduction at 10 with 13 rule applications. Total rules 411 place count 84 transition count 309
Iterating global reduction 10 with 13 rules applied. Total rules applied 424 place count 84 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 6 rules applied. Total rules applied 430 place count 84 transition count 303
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 433 place count 81 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 435 place count 80 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 437 place count 80 transition count 300
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 438 place count 80 transition count 300
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 440 place count 78 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 441 place count 77 transition count 298
Applied a total of 441 rules in 267 ms. Remains 77 /290 variables (removed 213) and now considering 298/617 (removed 319) transitions.
// Phase 1: matrix 298 rows 77 cols
[2024-05-21 23:25:05] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 23:25:05] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 23:25:05] [INFO ] Invariant cache hit.
[2024-05-21 23:25:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:25:05] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 356 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 76/290 places, 298/617 transitions.
Applied a total of 0 rules in 15 ms. Remains 76 /76 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 640 ms. Remains : 76/290 places, 298/617 transitions.
[2024-05-21 23:25:05] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:25:05] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:25:05] [INFO ] Input system was already deterministic with 298 transitions.
[2024-05-21 23:25:05] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:25:05] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:25:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality16111078700297469546.gal : 24 ms
[2024-05-21 23:25:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality417099857717908836.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/CTLCardinality16111078700297469546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality417099857717908836.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28711e+08,1.43015,41940,2,2770,5,87360,6,0,598,115007,0


Converting to forward existential form...Done !
original formula: A((!(AG((p113==1))) * (EG((p252!=1)) + (((p81==0)&&(((p259==0)||(p159==1))||(p225==1)))&&(((p74==1)||(p241==0))||(p305==1))))) U !((AF(((...190
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(EG(!(((p296==0)||(p115==1))))) + (p95==0))))))) * !(E(!(!((!(EG(!(((p296==0)||(p115==1))))...381
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t8, t9, t11, t15, t17, t19, t21, t23, t24, t26, t28, t30, t33, t38, t39, t46, t48...1492
Detected timeout of ITS tools.
[2024-05-21 23:25:35] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:25:35] [INFO ] Applying decomposition
[2024-05-21 23:25:35] [INFO ] Flatten gal took : 43 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/graph3868394555197848363.txt' '-o' '/tmp/graph3868394555197848363.bin' '-w' '/tmp/graph3868394555197848363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3868394555197848363.bin' '-l' '-1' '-v' '-w' '/tmp/graph3868394555197848363.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:25:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:25:36] [INFO ] Removed a total of 1227 redundant transitions.
[2024-05-21 23:25:36] [INFO ] Flatten gal took : 121 ms
[2024-05-21 23:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 18 ms.
[2024-05-21 23:25:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15615967746063759433.gal : 6 ms
[2024-05-21 23:25:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8890070215143251750.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/CTLCardinality15615967746063759433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8890070215143251750.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,1.28711e+08,0.206501,8468,669,66,9975,515,418,21514,76,2549,0


Converting to forward existential form...Done !
original formula: A((!(AG((i3.u6.p113==1))) * (EG((i6.u16.p252!=1)) + (((i1.u3.p81==0)&&(((i8.i0.u21.p259==0)||(i4.u9.p159==1))||(i6.u18.p225==1)))&&(((i1....277
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(EG(!(((i8.i1.u25.p296==0)||(i3.u8.p115==1))))) + (i1.u5.p95==0))))))) * !(E(!(!((!(EG(!(((...512
Reverse transition relation is NOT exact ! Due to transitions t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t98, t99, t10...822
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 8
(forward)formula 0,0,16.6403,437568,1,0,668214,2076,3295,2.49109e+06,392,9181,1123246
FORMULA AutonomousCar-PT-07b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Graph (trivial) has 261 edges and 290 vertex of which 4 / 290 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 287 transition count 510
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 137 rules applied. Total rules applied 242 place count 183 transition count 477
Reduce places removed 19 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 24 rules applied. Total rules applied 266 place count 164 transition count 472
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 273 place count 159 transition count 470
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 158 transition count 470
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 274 place count 158 transition count 461
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 292 place count 149 transition count 461
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 304 place count 137 transition count 449
Iterating global reduction 5 with 12 rules applied. Total rules applied 316 place count 137 transition count 449
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 316 place count 137 transition count 448
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 318 place count 136 transition count 448
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 320 place count 134 transition count 434
Iterating global reduction 5 with 2 rules applied. Total rules applied 322 place count 134 transition count 434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 326 place count 134 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 328 place count 132 transition count 430
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 412 place count 90 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 413 place count 90 transition count 387
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 424 place count 79 transition count 310
Iterating global reduction 8 with 11 rules applied. Total rules applied 435 place count 79 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 5 rules applied. Total rules applied 440 place count 79 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 442 place count 77 transition count 305
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 10 with 2 rules applied. Total rules applied 444 place count 76 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 446 place count 76 transition count 302
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 447 place count 76 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 448 place count 75 transition count 301
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 451 place count 75 transition count 301
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 453 place count 73 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 454 place count 72 transition count 299
Applied a total of 454 rules in 152 ms. Remains 72 /290 variables (removed 218) and now considering 299/617 (removed 318) transitions.
// Phase 1: matrix 299 rows 72 cols
[2024-05-21 23:25:53] [INFO ] Computed 10 invariants in 5 ms
[2024-05-21 23:25:53] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 23:25:53] [INFO ] Invariant cache hit.
[2024-05-21 23:25:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:25:54] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [63, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 637 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 70/290 places, 299/617 transitions.
Applied a total of 0 rules in 13 ms. Remains 70 /70 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 802 ms. Remains : 70/290 places, 299/617 transitions.
[2024-05-21 23:25:54] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:25:54] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:25:54] [INFO ] Input system was already deterministic with 299 transitions.
[2024-05-21 23:25:54] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:25:54] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:25:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality2068966345170221594.gal : 7 ms
[2024-05-21 23:25:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality12488376586011173978.ctl : 6 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/CTLCardinality2068966345170221594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12488376586011173978.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.16112e+07,3.50828,81160,2,4115,5,193065,6,0,576,198371,0


Converting to forward existential form...Done !
original formula: AF((AF(((AF(((p27==0)&&(p141==1))) * (p257==0)) * (p300==1))) + ((EF(!(A(((p70==0)||(p292==1)) U ((p147==0)||(p58==1))))) * (p176==1)) * ...166
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((!(EG(!(((p27==0)&&(p141==1))))) * (p257==0)) * (p300==1))))) + ((E(TRUE U !(!((E(!(((p147...300
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t9, t11, t13, t15, t17, t19, t22, t24, t28, t30, t32, t34, t38, t40, t44,...626
Detected timeout of ITS tools.
[2024-05-21 23:26:24] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:26:24] [INFO ] Applying decomposition
[2024-05-21 23:26:24] [INFO ] Flatten gal took : 26 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/graph740385610122909894.txt' '-o' '/tmp/graph740385610122909894.bin' '-w' '/tmp/graph740385610122909894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph740385610122909894.bin' '-l' '-1' '-v' '-w' '/tmp/graph740385610122909894.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:26:24] [INFO ] Decomposing Gal with order
[2024-05-21 23:26:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:26:24] [INFO ] Removed a total of 1228 redundant transitions.
[2024-05-21 23:26:24] [INFO ] Flatten gal took : 53 ms
[2024-05-21 23:26:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 12 ms.
[2024-05-21 23:26:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality4942236611490058704.gal : 5 ms
[2024-05-21 23:26:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality17625224238239427536.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/CTLCardinality4942236611490058704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17625224238239427536.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.16112e+07,0.360117,11444,742,106,17018,933,444,26262,76,5634,0


Converting to forward existential form...Done !
original formula: AF((AF(((AF(((i0.u0.p27==0)&&(i6.u8.p141==1))) * (i11.u18.p257==0)) * (i11.u21.p300==1))) + ((EF(!(A(((u4.p70==0)||(i11.u22.p292==1)) U (...224
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((!(EG(!(((i0.u0.p27==0)&&(i6.u8.p141==1))))) * (i11.u18.p257==0)) * (i11.u21.p300==1))))) ...376
Reverse transition relation is NOT exact ! Due to transitions t44, t46, t48, t50, t52, t54, t56, t58, t60, t62, t64, t66, t68, t70, t72, t74, t76, t78, t80...732
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 11
(forward)formula 0,0,20.7746,589832,1,0,1.21107e+06,3321,4927,1.44067e+06,383,26605,2650405
FORMULA AutonomousCar-PT-07b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 270 transition count 597
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 270 transition count 597
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 265 transition count 592
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 264 transition count 591
Applied a total of 52 rules in 29 ms. Remains 264 /290 variables (removed 26) and now considering 591/617 (removed 26) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:26:45] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 23:26:45] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 23:26:45] [INFO ] Invariant cache hit.
[2024-05-21 23:26:46] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:26:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:26:58] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 5 ms to minimize.
[2024-05-21 23:26:58] [INFO ] Deduced a trap composed of 58 places in 358 ms of which 3 ms to minimize.
[2024-05-21 23:26:59] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 3 ms to minimize.
[2024-05-21 23:26:59] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 3 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 4 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 3 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 4 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 4 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 4 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 3 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 3 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 46 places in 357 ms of which 5 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 4 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 65 places in 299 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 40 places in 375 ms of which 3 ms to minimize.
[2024-05-21 23:27:06] [INFO ] Deduced a trap composed of 40 places in 402 ms of which 4 ms to minimize.
[2024-05-21 23:27:06] [INFO ] Deduced a trap composed of 41 places in 424 ms of which 4 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 49 places in 418 ms of which 4 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 43 places in 404 ms of which 4 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 14 places in 395 ms of which 4 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 4 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 3 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 3 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 2 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 18 places in 416 ms of which 4 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 4 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 45 places in 376 ms of which 4 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 43 places in 324 ms of which 4 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 4 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 49 places in 437 ms of which 5 ms to minimize.
SMT process timed out in 32519ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 32536ms
Starting structural reductions in LTL mode, iteration 1 : 264/290 places, 591/617 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33335 ms. Remains : 264/290 places, 591/617 transitions.
[2024-05-21 23:27:19] [INFO ] Flatten gal took : 50 ms
[2024-05-21 23:27:19] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:27:19] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:27:19] [INFO ] Flatten gal took : 46 ms
[2024-05-21 23:27:19] [INFO ] Flatten gal took : 48 ms
[2024-05-21 23:27:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15525031974157099244.gal : 11 ms
[2024-05-21 23:27:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality13305433118454216139.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/CTLCardinality15525031974157099244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13305433118454216139.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:27:49] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:27:49] [INFO ] Applying decomposition
[2024-05-21 23:27:49] [INFO ] Flatten gal took : 30 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/graph11632689433131602614.txt' '-o' '/tmp/graph11632689433131602614.bin' '-w' '/tmp/graph11632689433131602614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11632689433131602614.bin' '-l' '-1' '-v' '-w' '/tmp/graph11632689433131602614.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:27:49] [INFO ] Decomposing Gal with order
[2024-05-21 23:27:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:27:49] [INFO ] Removed a total of 1606 redundant transitions.
[2024-05-21 23:27:49] [INFO ] Flatten gal took : 75 ms
[2024-05-21 23:27:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 16 ms.
[2024-05-21 23:27:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality3229123515127225701.gal : 5 ms
[2024-05-21 23:27:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality17556411718705272526.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/CTLCardinality3229123515127225701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17556411718705272526.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.81998e+13,5.46006,151104,9854,122,255788,1521,639,1.06448e+06,95,6297,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(((i1.u13.p44==0)||(i2.u24.p81==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(((i1.u13.p44==0)||(i2.u24.p81==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t85, t111, t137, t163, t189, t215, t241, t248, t250, t314, t384, t588, i1.u11.t220, i2.u21.t1...785
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 : 290/290 places, 617/617 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 271 transition count 598
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 271 transition count 598
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 267 transition count 594
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 266 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 266 transition count 593
Applied a total of 48 rules in 19 ms. Remains 266 /290 variables (removed 24) and now considering 593/617 (removed 24) transitions.
// Phase 1: matrix 593 rows 266 cols
[2024-05-21 23:28:19] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 23:28:20] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-21 23:28:20] [INFO ] Invariant cache hit.
[2024-05-21 23:28:20] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2024-05-21 23:28:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 23 places in 489 ms of which 5 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 21 places in 442 ms of which 4 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 37 places in 434 ms of which 4 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 54 places in 338 ms of which 4 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 40 places in 451 ms of which 5 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 38 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 40 places in 432 ms of which 4 ms to minimize.
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 45 places in 549 ms of which 4 ms to minimize.
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 38 places in 402 ms of which 7 ms to minimize.
[2024-05-21 23:28:36] [INFO ] Deduced a trap composed of 35 places in 405 ms of which 4 ms to minimize.
[2024-05-21 23:28:36] [INFO ] Deduced a trap composed of 21 places in 414 ms of which 4 ms to minimize.
[2024-05-21 23:28:36] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 3 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 3 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 42 places in 377 ms of which 3 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 42 places in 370 ms of which 4 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 46 places in 360 ms of which 3 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 4 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 32 places in 361 ms of which 4 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 63 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 49 places in 439 ms of which 4 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 22 places in 449 ms of which 5 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 31 places in 460 ms of which 4 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 32 places in 424 ms of which 4 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 33 places in 397 ms of which 4 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 4 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 14 places in 406 ms of which 4 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 31 places in 334 ms of which 4 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 4 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 4 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 49 places in 275 ms of which 3 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 3 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 3 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 3 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 3 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 3 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 2 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 3 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 3 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/859 variables, and 52 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 32 places in 371 ms of which 4 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 3 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 4 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 40 places in 412 ms of which 4 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 41 places in 355 ms of which 4 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 2 ms to minimize.
[2024-05-21 23:29:01] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2024-05-21 23:29:01] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 4 ms to minimize.
[2024-05-21 23:29:02] [INFO ] Deduced a trap composed of 42 places in 336 ms of which 3 ms to minimize.
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 3 ms to minimize.
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 4 ms to minimize.
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 3 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 2 ms to minimize.
[2024-05-21 23:29:05] [INFO ] Deduced a trap composed of 15 places in 347 ms of which 4 ms to minimize.
[2024-05-21 23:29:05] [INFO ] Deduced a trap composed of 45 places in 380 ms of which 3 ms to minimize.
[2024-05-21 23:29:06] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 3 ms to minimize.
[2024-05-21 23:29:06] [INFO ] Deduced a trap composed of 40 places in 307 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 4 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 28 places in 377 ms of which 4 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 4 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 3 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 3 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 3 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 3 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 3 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 2 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 3 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/859 variables, and 81 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 0/592 constraints, Known Traps: 69/69 constraints]
After SMT, in 62101ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 62109ms
Starting structural reductions in LTL mode, iteration 1 : 266/290 places, 593/617 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62944 ms. Remains : 266/290 places, 593/617 transitions.
[2024-05-21 23:29:22] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:29:22] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:29:23] [INFO ] Input system was already deterministic with 593 transitions.
[2024-05-21 23:29:23] [INFO ] Flatten gal took : 48 ms
[2024-05-21 23:29:23] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:29:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality4494093871400101709.gal : 19 ms
[2024-05-21 23:29:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality6664810628620105442.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/CTLCardinality4494093871400101709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6664810628620105442.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:29:53] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:29:53] [INFO ] Applying decomposition
[2024-05-21 23:29:53] [INFO ] Flatten gal took : 43 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/graph6317405909975397364.txt' '-o' '/tmp/graph6317405909975397364.bin' '-w' '/tmp/graph6317405909975397364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6317405909975397364.bin' '-l' '-1' '-v' '-w' '/tmp/graph6317405909975397364.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:29:53] [INFO ] Decomposing Gal with order
[2024-05-21 23:29:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:29:53] [INFO ] Removed a total of 1632 redundant transitions.
[2024-05-21 23:29:53] [INFO ] Flatten gal took : 107 ms
[2024-05-21 23:29:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 18 ms.
[2024-05-21 23:29:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality6073947465770642960.gal : 12 ms
[2024-05-21 23:29:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4243176407480391798.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/CTLCardinality6073947465770642960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4243176407480391798.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 272 transition count 599
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 272 transition count 599
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 267 transition count 594
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 266 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 266 transition count 593
Applied a total of 48 rules in 22 ms. Remains 266 /290 variables (removed 24) and now considering 593/617 (removed 24) transitions.
// Phase 1: matrix 593 rows 266 cols
[2024-05-21 23:30:23] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 23:30:24] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 23:30:24] [INFO ] Invariant cache hit.
[2024-05-21 23:30:24] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2024-05-21 23:30:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 5 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 67 places in 447 ms of which 5 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 37 places in 385 ms of which 4 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 4 ms to minimize.
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 33 places in 349 ms of which 4 ms to minimize.
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 41 places in 418 ms of which 4 ms to minimize.
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 24 places in 401 ms of which 4 ms to minimize.
[2024-05-21 23:30:40] [INFO ] Deduced a trap composed of 45 places in 416 ms of which 4 ms to minimize.
[2024-05-21 23:30:40] [INFO ] Deduced a trap composed of 45 places in 412 ms of which 5 ms to minimize.
[2024-05-21 23:30:41] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 3 ms to minimize.
[2024-05-21 23:30:41] [INFO ] Deduced a trap composed of 39 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:30:42] [INFO ] Deduced a trap composed of 44 places in 362 ms of which 4 ms to minimize.
[2024-05-21 23:30:42] [INFO ] Deduced a trap composed of 42 places in 433 ms of which 4 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 39 places in 406 ms of which 4 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 4 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 42 places in 335 ms of which 4 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 8 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 43 places in 399 ms of which 4 ms to minimize.
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 44 places in 390 ms of which 4 ms to minimize.
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 34 places in 346 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 14 places in 411 ms of which 4 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 41 places in 448 ms of which 4 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 17 places in 450 ms of which 4 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 21 places in 439 ms of which 4 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 52 places in 408 ms of which 3 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 51 places in 390 ms of which 4 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 32 places in 405 ms of which 4 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 31 places in 392 ms of which 4 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 22 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 3 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 3 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 46 places in 308 ms of which 3 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 3 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 4 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 4 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 3 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 4 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 4 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 3 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/859 variables, and 52 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 4 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 3 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 2 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 38 places in 315 ms of which 3 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 69 places in 380 ms of which 4 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 3 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 3 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 5 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 4 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 54 places in 394 ms of which 4 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 45 places in 300 ms of which 2 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 48 places in 289 ms of which 3 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 3 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 4 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 3 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 4 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 42 places in 424 ms of which 3 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 4 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 5 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 36 places in 402 ms of which 4 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 4 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 3 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 3 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 3 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 48 places in 255 ms of which 4 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 47 places in 288 ms of which 3 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 3 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 3 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 3 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 3 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 3 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 3 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 32 places in 342 ms of which 3 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 3 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 3 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 5 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 3 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 4 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 3 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 3 ms to minimize.
SMT process timed out in 62397ms, After SMT, problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 62406ms
Starting structural reductions in LTL mode, iteration 1 : 266/290 places, 593/617 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63288 ms. Remains : 266/290 places, 593/617 transitions.
[2024-05-21 23:31:27] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:31:27] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:31:27] [INFO ] Input system was already deterministic with 593 transitions.
[2024-05-21 23:31:27] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:31:27] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:31:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10254181927435984248.gal : 14 ms
[2024-05-21 23:31:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7026035433954612014.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/CTLCardinality10254181927435984248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7026035433954612014.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:31:57] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:31:57] [INFO ] Applying decomposition
[2024-05-21 23:31:57] [INFO ] Flatten gal took : 25 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/graph8147607057668441009.txt' '-o' '/tmp/graph8147607057668441009.bin' '-w' '/tmp/graph8147607057668441009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8147607057668441009.bin' '-l' '-1' '-v' '-w' '/tmp/graph8147607057668441009.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:31:57] [INFO ] Decomposing Gal with order
[2024-05-21 23:31:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:31:57] [INFO ] Removed a total of 1625 redundant transitions.
[2024-05-21 23:31:57] [INFO ] Flatten gal took : 61 ms
[2024-05-21 23:31:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 15 ms.
[2024-05-21 23:31:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17635501778200784562.gal : 5 ms
[2024-05-21 23:31:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality12548377713666459646.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/CTLCardinality17635501778200784562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12548377713666459646.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,2.93923e+13,1.40084,34412,1265,112,62399,2599,657,85192,91,16502,0


Converting to forward existential form...Done !
original formula: EF(EG((AX(((i10.u59.p184==0)&&(i3.i1.u17.p51==1))) * (i8.u49.p153==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EX(!(((i10.u59.p184==0)&&(i3.i1.u17.p51==1))))) * (i8.u49.p153==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t250, t252, t260, t316, t365, t393, t449, t590, i2.i0.u19.t226, i2.i0.u19.t229, i2.i0.u20.t22...957
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 : 290/290 places, 617/617 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 270 transition count 597
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 270 transition count 597
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 265 transition count 592
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 264 transition count 591
Applied a total of 52 rules in 20 ms. Remains 264 /290 variables (removed 26) and now considering 591/617 (removed 26) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:32:27] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 23:32:27] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-21 23:32:27] [INFO ] Invariant cache hit.
[2024-05-21 23:32:28] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:32:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 3 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 3 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 21 places in 360 ms of which 5 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 33 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 36 places in 406 ms of which 4 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 48 places in 422 ms of which 4 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 40 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 45 places in 420 ms of which 4 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 42 places in 362 ms of which 4 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 45 places in 348 ms of which 4 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 47 places in 404 ms of which 4 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 45 places in 444 ms of which 4 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 37 places in 435 ms of which 4 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 59 places in 430 ms of which 4 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 5 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 46 places in 320 ms of which 3 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 39 places in 416 ms of which 4 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 52 places in 317 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 14 places in 370 ms of which 4 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 22 places in 442 ms of which 4 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 38 places in 480 ms of which 5 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 4 ms to minimize.
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 4 ms to minimize.
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 4 ms to minimize.
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 26 places in 391 ms of which 4 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 44 places in 387 ms of which 4 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 34 places in 377 ms of which 4 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 38 places in 363 ms of which 4 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 41 places in 354 ms of which 4 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 41 places in 385 ms of which 3 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 3 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 3 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 4 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 36 places in 368 ms of which 3 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 28 places in 357 ms of which 4 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 68 places in 361 ms of which 4 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 46 places in 299 ms of which 3 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 40 places in 395 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 3 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 3 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 3 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 3 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 4 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 37 places in 329 ms of which 3 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 32 places in 388 ms of which 4 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 63 places in 431 ms of which 4 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 41 places in 375 ms of which 4 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 46 places in 331 ms of which 3 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 47 places in 332 ms of which 3 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 3 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 3 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 46 places in 284 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 3 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 3 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 31 places in 355 ms of which 4 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 50 places in 419 ms of which 4 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 49 places in 400 ms of which 4 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 49 places in 291 ms of which 3 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 43 places in 281 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 3 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 42 places in 323 ms of which 4 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 3 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 3 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 2 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 2 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 2 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 3 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 3 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 3 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2024-05-21 23:33:23] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 3 ms to minimize.
[2024-05-21 23:33:23] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 3 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 4 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 25 places in 402 ms of which 4 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 4 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 32 places in 377 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/855 variables, and 97 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 85/85 constraints]
After SMT, in 62303ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62310ms
Starting structural reductions in LTL mode, iteration 1 : 264/290 places, 591/617 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63079 ms. Remains : 264/290 places, 591/617 transitions.
[2024-05-21 23:33:30] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:33:30] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:33:30] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:33:30] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:33:31] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:33:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4020764195909092569.gal : 12 ms
[2024-05-21 23:33:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality326314397795560923.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/CTLCardinality4020764195909092569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality326314397795560923.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:34:01] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:34:01] [INFO ] Applying decomposition
[2024-05-21 23:34:01] [INFO ] Flatten gal took : 23 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/graph9605103610968059417.txt' '-o' '/tmp/graph9605103610968059417.bin' '-w' '/tmp/graph9605103610968059417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9605103610968059417.bin' '-l' '-1' '-v' '-w' '/tmp/graph9605103610968059417.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:34:01] [INFO ] Decomposing Gal with order
[2024-05-21 23:34:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:34:01] [INFO ] Removed a total of 1613 redundant transitions.
[2024-05-21 23:34:01] [INFO ] Flatten gal took : 55 ms
[2024-05-21 23:34:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 8 ms.
[2024-05-21 23:34:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality16271888233952161330.gal : 5 ms
[2024-05-21 23:34:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14985350553202038245.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/CTLCardinality16271888233952161330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14985350553202038245.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,2.81998e+13,3.73035,119856,8914,122,260483,1400,749,602605,93,5945,0


Converting to forward existential form...Done !
original formula: AX(EF(((((i0.i1.u7.p27==0)&&(i6.u2.p6==1))||((i2.u74.p245==0)&&(i2.u56.p180==1))) * (EF(((i0.i1.u9.p22==0)&&(i3.i1.u27.p82==1))) + AF(((i...195
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((i0.i1.u7.p27==0)&&(i6.u2.p6==1))||((i2.u74.p245==0)&&(i2.u56.p180==1))) * (E(TRUE U ...260
Reverse transition relation is NOT exact ! Due to transitions t85, t111, t137, t163, t189, t216, t241, t248, t250, t254, t289, t359, t415, t588, i1.i0.u12....806
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 270 transition count 597
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 270 transition count 597
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 265 transition count 592
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 264 transition count 591
Applied a total of 52 rules in 19 ms. Remains 264 /290 variables (removed 26) and now considering 591/617 (removed 26) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 23:34:31] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:34:31] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 23:34:31] [INFO ] Invariant cache hit.
[2024-05-21 23:34:32] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-21 23:34:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 5 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 18 places in 432 ms of which 5 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 40 places in 408 ms of which 5 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 38 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 40 places in 438 ms of which 4 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 43 places in 439 ms of which 4 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 62 places in 459 ms of which 4 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 42 places in 450 ms of which 4 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 46 places in 425 ms of which 5 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 38 places in 413 ms of which 4 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 46 places in 414 ms of which 4 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 4 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 23 places in 413 ms of which 4 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 4 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 4 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 28 places in 454 ms of which 4 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 45 places in 437 ms of which 4 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 60 places in 422 ms of which 4 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 39 places in 384 ms of which 4 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 14 places in 435 ms of which 3 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 49 places in 455 ms of which 5 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 4 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 3 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 63 places in 397 ms of which 4 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 2 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 3 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 2 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 4 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 4 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 32 places in 312 ms of which 4 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 41 places in 329 ms of which 4 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 4 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 3 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 3 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 42 places in 294 ms of which 4 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 2 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 3 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 41 places in 324 ms of which 3 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 4 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 32 places in 363 ms of which 3 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 4 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 4 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 42 places in 374 ms of which 4 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 4 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 32 places in 308 ms of which 4 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 4 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 40 places in 461 ms of which 4 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 52 places in 421 ms of which 4 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 46 places in 374 ms of which 4 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 36 places in 324 ms of which 3 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 3 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 3 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 3 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 3 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 4 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 3 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 3 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 1 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 2 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-05-21 23:35:31] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-05-21 23:35:31] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 3 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 2 ms to minimize.
SMT process timed out in 62415ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62428ms
Starting structural reductions in LTL mode, iteration 1 : 264/290 places, 591/617 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63112 ms. Remains : 264/290 places, 591/617 transitions.
[2024-05-21 23:35:34] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:35:34] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:35:34] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-21 23:35:34] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:35:34] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:35:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7472952013655826695.gal : 8 ms
[2024-05-21 23:35:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality1743241583261817845.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/CTLCardinality7472952013655826695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1743241583261817845.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:36:04] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:36:04] [INFO ] Applying decomposition
[2024-05-21 23:36:04] [INFO ] Flatten gal took : 23 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/graph16476423654376217557.txt' '-o' '/tmp/graph16476423654376217557.bin' '-w' '/tmp/graph16476423654376217557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16476423654376217557.bin' '-l' '-1' '-v' '-w' '/tmp/graph16476423654376217557.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:36:04] [INFO ] Decomposing Gal with order
[2024-05-21 23:36:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:36:05] [INFO ] Removed a total of 1609 redundant transitions.
[2024-05-21 23:36:05] [INFO ] Flatten gal took : 49 ms
[2024-05-21 23:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 6 ms.
[2024-05-21 23:36:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2280237750040995764.gal : 3 ms
[2024-05-21 23:36:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9669932646101659401.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/CTLCardinality2280237750040995764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9669932646101659401.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Graph (trivial) has 260 edges and 290 vertex of which 4 / 290 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 287 transition count 511
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 137 rules applied. Total rules applied 241 place count 184 transition count 477
Reduce places removed 20 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 23 rules applied. Total rules applied 264 place count 164 transition count 474
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 267 place count 161 transition count 474
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 267 place count 161 transition count 464
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 287 place count 151 transition count 464
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 299 place count 139 transition count 452
Iterating global reduction 4 with 12 rules applied. Total rules applied 311 place count 139 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 139 transition count 451
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 314 place count 137 transition count 437
Iterating global reduction 5 with 2 rules applied. Total rules applied 316 place count 137 transition count 437
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 318 place count 137 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 319 place count 136 transition count 435
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 407 place count 92 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 408 place count 92 transition count 390
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 420 place count 80 transition count 306
Iterating global reduction 8 with 12 rules applied. Total rules applied 432 place count 80 transition count 306
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 8 rules applied. Total rules applied 440 place count 80 transition count 298
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 444 place count 76 transition count 298
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 10 with 2 rules applied. Total rules applied 446 place count 75 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 448 place count 75 transition count 295
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 449 place count 75 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 450 place count 74 transition count 294
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 451 place count 74 transition count 294
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 453 place count 72 transition count 292
Applied a total of 453 rules in 151 ms. Remains 72 /290 variables (removed 218) and now considering 292/617 (removed 325) transitions.
// Phase 1: matrix 292 rows 72 cols
[2024-05-21 23:36:35] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 23:36:35] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 23:36:35] [INFO ] Invariant cache hit.
[2024-05-21 23:36:35] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-21 23:36:35] [INFO ] Implicit Places using invariants and state equation in 381 ms returned [65, 71]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 566 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 70/290 places, 292/617 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 291
Applied a total of 2 rules in 22 ms. Remains 69 /70 variables (removed 1) and now considering 291/292 (removed 1) transitions.
// Phase 1: matrix 291 rows 69 cols
[2024-05-21 23:36:35] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 23:36:35] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 23:36:35] [INFO ] Invariant cache hit.
[2024-05-21 23:36:36] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-21 23:36:36] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 69/290 places, 291/617 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1078 ms. Remains : 69/290 places, 291/617 transitions.
[2024-05-21 23:36:36] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:36:36] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:36:36] [INFO ] Input system was already deterministic with 291 transitions.
[2024-05-21 23:36:36] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:36:36] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:36:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15346400188254965247.gal : 4 ms
[2024-05-21 23:36:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality18414736624996894794.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/CTLCardinality15346400188254965247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18414736624996894794.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.26539e+07,5.46158,119116,2,12632,5,296691,6,0,562,326095,0


Converting to forward existential form...Done !
original formula: EG(((AF((p244==0)) * !(E(((p112==1)||(p270==1)) U ((p7==1)||(p170==1))))) * (AF(((p263==0)&&(p158==1))) + (p217==1))))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((p244==0)))) * !(E(((p112==1)||(p270==1)) U ((p7==1)||(p170==1))))) * (!(EG(!(((p263==0)&&(p...191
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t7, t9, t11, t14, t16, t18, t23, t25, t27, t29, t34, t36, t38, t40, t42, t43, t44...1152
Detected timeout of ITS tools.
[2024-05-21 23:37:06] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:37:06] [INFO ] Applying decomposition
[2024-05-21 23:37:06] [INFO ] Flatten gal took : 30 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/graph7560356844320873914.txt' '-o' '/tmp/graph7560356844320873914.bin' '-w' '/tmp/graph7560356844320873914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7560356844320873914.bin' '-l' '-1' '-v' '-w' '/tmp/graph7560356844320873914.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:37:06] [INFO ] Decomposing Gal with order
[2024-05-21 23:37:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:37:06] [INFO ] Removed a total of 1215 redundant transitions.
[2024-05-21 23:37:06] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:37:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 8 ms.
[2024-05-21 23:37:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality7236060084263414718.gal : 3 ms
[2024-05-21 23:37:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality9603964219324510191.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/CTLCardinality7236060084263414718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9603964219324510191.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.26539e+07,1.18801,29848,516,110,69052,2365,305,55877,76,13340,0


Converting to forward existential form...Done !
original formula: EG(((AF((u18.p244==0)) * !(E(((i2.u5.p112==1)||(i10.i0.u22.p270==1)) U ((i0.u0.p7==1)||(i5.u12.p170==1))))) * (AF(((i10.u20.p263==0)&&(u1...189
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((u18.p244==0)))) * !(E(((i2.u5.p112==1)||(i10.i0.u22.p270==1)) U ((i0.u0.p7==1)||(i5.u12.p17...244
Reverse transition relation is NOT exact ! Due to transitions t44, t46, t48, t50, t52, t54, t56, t58, t60, t62, t64, t66, t68, t70, t72, t74, t76, t78, t80...628
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,21.7888,406508,1,0,647619,3212,2512,1.20712e+06,373,33489,585248
FORMULA AutonomousCar-PT-07b-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Graph (trivial) has 272 edges and 290 vertex of which 4 / 290 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 287 transition count 500
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 156 rules applied. Total rules applied 271 place count 173 transition count 458
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 297 place count 148 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 298 place count 147 transition count 457
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 298 place count 147 transition count 450
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 312 place count 140 transition count 450
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 324 place count 128 transition count 438
Iterating global reduction 4 with 12 rules applied. Total rules applied 336 place count 128 transition count 438
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 336 place count 128 transition count 437
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 338 place count 127 transition count 437
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 340 place count 125 transition count 423
Iterating global reduction 4 with 2 rules applied. Total rules applied 342 place count 125 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 346 place count 125 transition count 419
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 348 place count 123 transition count 419
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 434 place count 80 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 435 place count 80 transition count 375
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 448 place count 67 transition count 283
Iterating global reduction 7 with 13 rules applied. Total rules applied 461 place count 67 transition count 283
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 10 rules applied. Total rules applied 471 place count 67 transition count 273
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 476 place count 62 transition count 273
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 9 with 2 rules applied. Total rules applied 478 place count 61 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 479 place count 61 transition count 271
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 481 place count 59 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 482 place count 58 transition count 269
Applied a total of 482 rules in 68 ms. Remains 58 /290 variables (removed 232) and now considering 269/617 (removed 348) transitions.
// Phase 1: matrix 269 rows 58 cols
[2024-05-21 23:37:28] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 23:37:28] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:37:28] [INFO ] Invariant cache hit.
[2024-05-21 23:37:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:37:28] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [51, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 315 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/290 places, 269/617 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 268
Applied a total of 2 rules in 10 ms. Remains 55 /56 variables (removed 1) and now considering 268/269 (removed 1) transitions.
// Phase 1: matrix 268 rows 55 cols
[2024-05-21 23:37:28] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 23:37:28] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 23:37:29] [INFO ] Invariant cache hit.
[2024-05-21 23:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:37:29] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/290 places, 268/617 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 691 ms. Remains : 55/290 places, 268/617 transitions.
[2024-05-21 23:37:29] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:37:29] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:37:29] [INFO ] Input system was already deterministic with 268 transitions.
[2024-05-21 23:37:29] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:37:29] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:37:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12159532875126258825.gal : 3 ms
[2024-05-21 23:37:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality2189651181853802551.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/CTLCardinality12159532875126258825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2189651181853802551.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.64284e+06,1.68447,42712,2,2915,5,98677,6,0,486,130732,0


Converting to forward existential form...Done !
original formula: EG(((p158==0)||(p259==1)))
=> equivalent forward existential formula: [FwdG(Init,((p158==0)||(p259==1)))] != FALSE
Hit Full ! (commute/partial/dont) 200/0/68
(forward)formula 0,0,4.94735,89968,1,0,96,248017,19,3,6646,278071,95
FORMULA AutonomousCar-PT-07b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 270 transition count 597
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 270 transition count 597
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 268 transition count 595
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 268 transition count 595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 267 transition count 594
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 267 transition count 594
Applied a total of 46 rules in 15 ms. Remains 267 /290 variables (removed 23) and now considering 594/617 (removed 23) transitions.
// Phase 1: matrix 594 rows 267 cols
[2024-05-21 23:37:34] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:37:34] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 23:37:34] [INFO ] Invariant cache hit.
[2024-05-21 23:37:34] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-05-21 23:37:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 18 places in 477 ms of which 5 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 55 places in 443 ms of which 4 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 20 places in 419 ms of which 4 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 22 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 19 places in 427 ms of which 3 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 25 places in 443 ms of which 4 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 26 places in 451 ms of which 5 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 49 places in 419 ms of which 4 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 38 places in 455 ms of which 4 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 60 places in 431 ms of which 5 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 4 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 36 places in 434 ms of which 5 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 40 places in 415 ms of which 4 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 3 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 39 places in 451 ms of which 4 ms to minimize.
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 35 places in 420 ms of which 4 ms to minimize.
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 39 places in 435 ms of which 4 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 38 places in 444 ms of which 4 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 41 places in 717 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 32 places in 385 ms of which 4 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 31 places in 458 ms of which 4 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 4 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 15 places in 416 ms of which 3 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 4 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 3 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 3 ms to minimize.
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 44 places in 399 ms of which 4 ms to minimize.
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 39 places in 397 ms of which 4 ms to minimize.
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 41 places in 638 ms of which 4 ms to minimize.
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 43 places in 326 ms of which 2 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 42 places in 400 ms of which 5 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 3 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 4 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 34 places in 310 ms of which 3 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 4 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 3 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 3 ms to minimize.
((s0 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0timeout
)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/861 variables, and 52 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 4 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 41 places in 443 ms of which 4 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 4 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 42 places in 284 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 48 places in 274 ms of which 3 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 34 places in 408 ms of which 4 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 40 places in 300 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 34 places in 309 ms of which 3 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 47 places in 390 ms of which 4 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 3 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 3 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 4 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 2 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 3 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 3 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 46 places in 277 ms of which 3 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 37 places in 369 ms of which 3 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 41 places in 286 ms of which 3 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 4 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 3 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 3 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 3 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 3 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 38 places in 385 ms of which 4 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 46 places in 302 ms of which 4 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 3 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 3 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 3 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 3 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 2 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 3 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 25 places in 388 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 46 places in 305 ms of which 2 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 3 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 3 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 3 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 2 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 22 places in 395 ms of which 4 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 3 ms to minimize.
SMT process timed out in 62527ms, After SMT, problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 62534ms
Starting structural reductions in LTL mode, iteration 1 : 267/290 places, 594/617 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63119 ms. Remains : 267/290 places, 594/617 transitions.
[2024-05-21 23:38:37] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:38:37] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:38:37] [INFO ] Input system was already deterministic with 594 transitions.
[2024-05-21 23:38:37] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:38:37] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:38:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality4168167293752941708.gal : 7 ms
[2024-05-21 23:38:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality6906574866689180825.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/CTLCardinality4168167293752941708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6906574866689180825.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:39:07] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:39:07] [INFO ] Applying decomposition
[2024-05-21 23:39:07] [INFO ] Flatten gal took : 23 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/graph5844225209648058388.txt' '-o' '/tmp/graph5844225209648058388.bin' '-w' '/tmp/graph5844225209648058388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5844225209648058388.bin' '-l' '-1' '-v' '-w' '/tmp/graph5844225209648058388.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:39:07] [INFO ] Decomposing Gal with order
[2024-05-21 23:39:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:39:07] [INFO ] Removed a total of 1612 redundant transitions.
[2024-05-21 23:39:07] [INFO ] Flatten gal took : 55 ms
[2024-05-21 23:39:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 9 ms.
[2024-05-21 23:39:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality13349772760545500524.gal : 5 ms
[2024-05-21 23:39:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality470714707923352375.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/CTLCardinality13349772760545500524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality470714707923352375.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.99965e+13,20.2115,650084,8810,124,336230,1017,654,7.73346e+06,99,4580,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 269 transition count 596
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 264 transition count 591
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 263 transition count 590
Applied a total of 54 rules in 18 ms. Remains 263 /290 variables (removed 27) and now considering 590/617 (removed 27) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-21 23:39:38] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 23:39:38] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 23:39:38] [INFO ] Invariant cache hit.
[2024-05-21 23:39:38] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-21 23:39:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 17 places in 477 ms of which 7 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 35 places in 452 ms of which 4 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 37 places in 329 ms of which 3 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 3 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 3 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 14 places in 451 ms of which 4 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 36 places in 424 ms of which 4 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 35 places in 437 ms of which 4 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 36 places in 441 ms of which 4 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 42 places in 462 ms of which 4 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 4 ms to minimize.
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 49 places in 446 ms of which 4 ms to minimize.
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 18 places in 427 ms of which 4 ms to minimize.
[2024-05-21 23:39:58] [INFO ] Deduced a trap composed of 24 places in 429 ms of which 4 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 4 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 41 places in 401 ms of which 3 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 4 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 3 ms to minimize.
[2024-05-21 23:40:00] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:40:01] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:40:02] [INFO ] Deduced a trap composed of 24 places in 478 ms of which 4 ms to minimize.
[2024-05-21 23:40:03] [INFO ] Deduced a trap composed of 75 places in 355 ms of which 3 ms to minimize.
[2024-05-21 23:40:03] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 4 ms to minimize.
[2024-05-21 23:40:03] [INFO ] Deduced a trap composed of 59 places in 329 ms of which 3 ms to minimize.
[2024-05-21 23:40:04] [INFO ] Deduced a trap composed of 39 places in 436 ms of which 4 ms to minimize.
[2024-05-21 23:40:04] [INFO ] Deduced a trap composed of 31 places in 444 ms of which 5 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 22 places in 434 ms of which 4 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 42 places in 420 ms of which 4 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 27 places in 318 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 38 places in 406 ms of which 4 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 4 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 4 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 44 places in 425 ms of which 4 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 40 places in 424 ms of which 4 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 45 places in 419 ms of which 4 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 46 places in 406 ms of which 4 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 47 places in 382 ms of which 4 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 44 places in 386 ms of which 4 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 3 ms to minimize.
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 31 places in 377 ms of which 4 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 31 places in 355 ms of which 4 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 3 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 38 places in 328 ms of which 3 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 52 places in 333 ms of which 3 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 2 ms to minimize.
[2024-05-21 23:40:21] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 2 ms to minimize.
[2024-05-21 23:40:21] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 2 ms to minimize.
[2024-05-21 23:40:21] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 2 ms to minimize.
[2024-05-21 23:40:21] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 3 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 3 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 3 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 3 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 41 places in 379 ms of which 4 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 40 places in 395 ms of which 4 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 41 places in 387 ms of which 4 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 4 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 52 places in 381 ms of which 4 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 3 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 3 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 46 places in 315 ms of which 3 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 3 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 58 places in 357 ms of which 4 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 56 places in 371 ms of which 4 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 26 places in 410 ms of which 4 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 3 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 10 places in 417 ms of which 4 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 28 places in 400 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 89 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 77/77 constraints]
After SMT, in 62043ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 62055ms
Starting structural reductions in LTL mode, iteration 1 : 263/290 places, 590/617 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62784 ms. Remains : 263/290 places, 590/617 transitions.
[2024-05-21 23:40:40] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:40:40] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:40:40] [INFO ] Input system was already deterministic with 590 transitions.
[2024-05-21 23:40:40] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:40:41] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:40:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality8063064027396291429.gal : 7 ms
[2024-05-21 23:40:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5821573819918724259.ctl : 16 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/CTLCardinality8063064027396291429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5821573819918724259.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:41:11] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:41:11] [INFO ] Applying decomposition
[2024-05-21 23:41:11] [INFO ] Flatten gal took : 23 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/graph5874231722309814353.txt' '-o' '/tmp/graph5874231722309814353.bin' '-w' '/tmp/graph5874231722309814353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5874231722309814353.bin' '-l' '-1' '-v' '-w' '/tmp/graph5874231722309814353.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:11] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:11] [INFO ] Removed a total of 1606 redundant transitions.
[2024-05-21 23:41:11] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:41:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 6 ms.
[2024-05-21 23:41:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality4087641742483376518.gal : 4 ms
[2024-05-21 23:41:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7567568607837163471.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/CTLCardinality4087641742483376518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7567568607837163471.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 272 transition count 599
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 272 transition count 599
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 268 transition count 595
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 268 transition count 595
Applied a total of 44 rules in 19 ms. Remains 268 /290 variables (removed 22) and now considering 595/617 (removed 22) transitions.
// Phase 1: matrix 595 rows 268 cols
[2024-05-21 23:41:41] [INFO ] Computed 12 invariants in 5 ms
[2024-05-21 23:41:41] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 23:41:41] [INFO ] Invariant cache hit.
[2024-05-21 23:41:42] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 594 sub problems to find dead transitions.
[2024-05-21 23:41:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 24 places in 372 ms of which 5 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 3 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 50 places in 369 ms of which 4 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 25 places in 416 ms of which 4 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 3 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 4 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 4 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 34 places in 357 ms of which 3 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 40 places in 425 ms of which 4 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 3 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 36 places in 423 ms of which 5 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 38 places in 439 ms of which 4 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 3 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 46 places in 395 ms of which 4 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 21 places in 320 ms of which 3 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 29 places in 429 ms of which 4 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 47 places in 425 ms of which 5 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 46 places in 321 ms of which 3 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 46 places in 422 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 41 places in 413 ms of which 4 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 3 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 44 places in 422 ms of which 4 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 35 places in 305 ms of which 4 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 48 places in 404 ms of which 4 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 46 places in 303 ms of which 2 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 39 places in 345 ms of which 4 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 4 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 3 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 45 places in 352 ms of which 3 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 46 places in 311 ms of which 2 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 2 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 3 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 41 places in 419 ms of which 4 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 48 places in 302 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 45 places in 393 ms of which 3 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 41 places in 320 ms of which 3 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 3 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 2 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/863 variables, and 52 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/268 constraints, PredecessorRefiner: 594/594 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 5 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 3 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 3 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 65 places in 294 ms of which 3 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 3 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 46 places in 362 ms of which 4 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 3 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 3 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 3 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 3 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 4 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 5 places in 410 ms of which 4 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 32 places in 402 ms of which 4 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 20 places in 434 ms of which 5 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 3 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/863 variables, and 77 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/268 constraints, PredecessorRefiner: 0/594 constraints, Known Traps: 65/65 constraints]
After SMT, in 62244ms problems are : Problem set: 0 solved, 594 unsolved
Search for dead transitions found 0 dead transitions in 62256ms
Starting structural reductions in LTL mode, iteration 1 : 268/290 places, 595/617 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63049 ms. Remains : 268/290 places, 595/617 transitions.
[2024-05-21 23:42:44] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:42:44] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:42:44] [INFO ] Input system was already deterministic with 595 transitions.
[2024-05-21 23:42:44] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:42:44] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:42:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4161333764285662123.gal : 7 ms
[2024-05-21 23:42:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7175454172980158736.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/CTLCardinality4161333764285662123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7175454172980158736.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:43:14] [INFO ] Flatten gal took : 49 ms
[2024-05-21 23:43:14] [INFO ] Applying decomposition
[2024-05-21 23:43:14] [INFO ] Flatten gal took : 40 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/graph16648225702681689437.txt' '-o' '/tmp/graph16648225702681689437.bin' '-w' '/tmp/graph16648225702681689437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16648225702681689437.bin' '-l' '-1' '-v' '-w' '/tmp/graph16648225702681689437.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:15] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:15] [INFO ] Removed a total of 1609 redundant transitions.
[2024-05-21 23:43:15] [INFO ] Flatten gal took : 75 ms
[2024-05-21 23:43:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 9 ms.
[2024-05-21 23:43:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality14617494094379902306.gal : 5 ms
[2024-05-21 23:43:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality6047317219264185128.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/CTLCardinality14617494094379902306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6047317219264185128.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 290/290 places, 617/617 transitions.
Graph (trivial) has 269 edges and 290 vertex of which 4 / 290 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 287 transition count 500
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 151 rules applied. Total rules applied 266 place count 173 transition count 463
Reduce places removed 20 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 23 rules applied. Total rules applied 289 place count 153 transition count 460
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 292 place count 150 transition count 460
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 292 place count 150 transition count 454
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 304 place count 144 transition count 454
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 315 place count 133 transition count 443
Iterating global reduction 4 with 11 rules applied. Total rules applied 326 place count 133 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 326 place count 133 transition count 442
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 328 place count 132 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 330 place count 130 transition count 428
Iterating global reduction 4 with 2 rules applied. Total rules applied 332 place count 130 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 334 place count 130 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 335 place count 129 transition count 426
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 423 place count 85 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 424 place count 85 transition count 381
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 435 place count 74 transition count 305
Iterating global reduction 7 with 11 rules applied. Total rules applied 446 place count 74 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 6 rules applied. Total rules applied 452 place count 74 transition count 299
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 455 place count 71 transition count 299
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 9 with 2 rules applied. Total rules applied 457 place count 70 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 458 place count 70 transition count 297
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 460 place count 68 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 461 place count 67 transition count 295
Applied a total of 461 rules in 116 ms. Remains 67 /290 variables (removed 223) and now considering 295/617 (removed 322) transitions.
// Phase 1: matrix 295 rows 67 cols
[2024-05-21 23:43:45] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 23:43:45] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:43:45] [INFO ] Invariant cache hit.
[2024-05-21 23:43:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:43:45] [INFO ] Implicit Places using invariants and state equation in 309 ms returned [60, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 493 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/290 places, 295/617 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 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 294
Applied a total of 2 rules in 18 ms. Remains 64 /65 variables (removed 1) and now considering 294/295 (removed 1) transitions.
// Phase 1: matrix 294 rows 64 cols
[2024-05-21 23:43:45] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 23:43:46] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 23:43:46] [INFO ] Invariant cache hit.
[2024-05-21 23:43:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:43:46] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/290 places, 294/617 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1048 ms. Remains : 64/290 places, 294/617 transitions.
[2024-05-21 23:43:46] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:43:46] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:43:46] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-21 23:43:46] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:43:46] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:43:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality16641765873215319401.gal : 4 ms
[2024-05-21 23:43:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality13732119334985453818.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/CTLCardinality16641765873215319401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13732119334985453818.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.07241e+07,3.42279,78488,2,5188,5,162319,6,0,548,190881,0


Converting to forward existential form...Done !
original formula: EF(((E((p173==1) U (p111==1)) * (p243==1)) * ((p204==0)||(p120==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * ((p204==0)||(p120==1))) * (p243==1)),(p173==1)) * (p111==1))] != FALSE
Hit Full ! (commute/partial/dont) 292/0/2
(forward)formula 0,1,3.46328,78488,1,0,13,162319,17,3,1334,190881,6
FORMULA AutonomousCar-PT-07b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 23:43:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:43:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:43:50] [INFO ] Applying decomposition
[2024-05-21 23:43:50] [INFO ] Flatten gal took : 23 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/graph13890603792445355559.txt' '-o' '/tmp/graph13890603792445355559.bin' '-w' '/tmp/graph13890603792445355559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13890603792445355559.bin' '-l' '-1' '-v' '-w' '/tmp/graph13890603792445355559.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:50] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:50] [INFO ] Removed a total of 1630 redundant transitions.
[2024-05-21 23:43:50] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 9 ms.
[2024-05-21 23:43:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality3190235179839755471.gal : 4 ms
[2024-05-21 23:43:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality13360260569207996956.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/CTLCardinality3190235179839755471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13360260569207996956.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 23:50:59] [INFO ] Applying decomposition
[2024-05-21 23:50:59] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:50:59] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:59] [INFO ] Removed a total of 1760 redundant transitions.
[2024-05-21 23:50:59] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:50:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 12 ms.
[2024-05-21 23:50:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality1833296134064233363.gal : 3 ms
[2024-05-21 23:50:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13392076098786621060.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/CTLCardinality1833296134064233363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13392076098786621060.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 8 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.07671e+13,0.21089,6872,577,1181,3316,3284,265,9393,325,16886,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(((i1.i0.i0.i0.i0.i0.i0.i0.u12.p44==0)||(i1.i0.i0.i0.i0.i0.i0.i0.u13.p81==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(((i1.i0.i0.i0.i0.i0.i0.i0.u12.p44==0)||(i1.i0.i0.i0.i0.i0.i0.i0.u13.p81==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t348, t473, i0.u2.t273, i0.u2.t274, i0.u2.t275, i0.u3.t270, i1.t614, i1.i0.u19.t37, i1.i0.u19...1664
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Detected timeout of ITS tools.
[2024-05-22 00:17:27] [INFO ] Flatten gal took : 41 ms
[2024-05-22 00:17:27] [INFO ] Input system was already deterministic with 617 transitions.
[2024-05-22 00:17:27] [INFO ] Transformed 290 places.
[2024-05-22 00:17:27] [INFO ] Transformed 617 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:17:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality17458011933666029900.gal : 12 ms
[2024-05-22 00:17:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality15925748616090631247.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/CTLCardinality17458011933666029900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15925748616090631247.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 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.07671e+13,27.8519,477116,2,162596,5,2.31137e+06,6,0,1779,1.14125e+06,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(((p44==0)||(p81==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(((p44==0)||(p81==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t28, t32, t37, t42, t43, t72, t73, t76, t78, t79, t80, t94, t100, t101, t104, ...687

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07b.tgz
mv AutonomousCar-PT-07b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;