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.r400-tall-171690531800217.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 StigmergyCommit-PT-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 155M May 18 16:43 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 StigmergyCommit-PT-10a-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-10a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716997021050

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 15:37:02] [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-29 15:37:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 15:37:07] [INFO ] Load time of PNML (sax parser for PT used): 5532 ms
[2024-05-29 15:37:08] [INFO ] Transformed 400 places.
[2024-05-29 15:37:09] [INFO ] Transformed 136960 transitions.
[2024-05-29 15:37:09] [INFO ] Found NUPN structural information;
[2024-05-29 15:37:09] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 6856 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 178 ms.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
Support contains 85 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 339 transition count 4545
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 339 transition count 4545
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 125 place count 339 transition count 4542
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 145 place count 319 transition count 4519
Iterating global reduction 1 with 20 rules applied. Total rules applied 165 place count 319 transition count 4519
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 169 place count 319 transition count 4515
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 173 place count 315 transition count 4511
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 315 transition count 4511
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 181 place count 311 transition count 4507
Iterating global reduction 2 with 4 rules applied. Total rules applied 185 place count 311 transition count 4507
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 187 place count 309 transition count 4505
Iterating global reduction 2 with 2 rules applied. Total rules applied 189 place count 309 transition count 4505
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 191 place count 307 transition count 4503
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 307 transition count 4503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 195 place count 307 transition count 4501
Applied a total of 195 rules in 337 ms. Remains 307 /400 variables (removed 93) and now considering 4501/4615 (removed 114) transitions.
[2024-05-29 15:37:11] [INFO ] Flow matrix only has 4485 transitions (discarded 16 similar events)
// Phase 1: matrix 4485 rows 307 cols
[2024-05-29 15:37:11] [INFO ] Computed 4 invariants in 80 ms
[2024-05-29 15:37:12] [INFO ] Implicit Places using invariants in 1559 ms returned []
[2024-05-29 15:37:12] [INFO ] Flow matrix only has 4485 transitions (discarded 16 similar events)
[2024-05-29 15:37:12] [INFO ] Invariant cache hit.
[2024-05-29 15:37:14] [INFO ] State equation strengthened by 4224 read => feed constraints.
[2024-05-29 15:37:19] [INFO ] Implicit Places using invariants and state equation in 6730 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8351 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 306/400 places, 4501/4615 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 288 transition count 4483
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 288 transition count 4483
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 43 place count 288 transition count 4476
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 280 transition count 4468
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 280 transition count 4468
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 274 transition count 4462
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 274 transition count 4462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 271 transition count 4459
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 271 transition count 4459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 269 transition count 4457
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 269 transition count 4457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 267 transition count 4455
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 267 transition count 4455
Applied a total of 85 rules in 122 ms. Remains 267 /306 variables (removed 39) and now considering 4455/4501 (removed 46) transitions.
[2024-05-29 15:37:19] [INFO ] Flow matrix only has 4439 transitions (discarded 16 similar events)
// Phase 1: matrix 4439 rows 267 cols
[2024-05-29 15:37:19] [INFO ] Computed 3 invariants in 29 ms
[2024-05-29 15:37:20] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-29 15:37:20] [INFO ] Flow matrix only has 4439 transitions (discarded 16 similar events)
[2024-05-29 15:37:20] [INFO ] Invariant cache hit.
[2024-05-29 15:37:21] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:37:23] [INFO ] Implicit Places using invariants and state equation in 2795 ms returned []
Implicit Place search using SMT with State Equation took 3745 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 267/400 places, 4455/4615 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12581 ms. Remains : 267/400 places, 4455/4615 transitions.
Support contains 85 out of 267 places after structural reductions.
[2024-05-29 15:37:24] [INFO ] Flatten gal took : 538 ms
[2024-05-29 15:37:24] [INFO ] Flatten gal took : 346 ms
[2024-05-29 15:37:25] [INFO ] Input system was already deterministic with 4455 transitions.
Support contains 79 out of 267 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 12079 ms. (3 steps per ms) remains 30/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
[2024-05-29 15:37:28] [INFO ] Flow matrix only has 4439 transitions (discarded 16 similar events)
[2024-05-29 15:37:28] [INFO ] Invariant cache hit.
[2024-05-29 15:37:29] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 211/267 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 3 (OVERLAPS) 4438/4705 variables, 267/270 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4705 variables, 4103/4373 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4705 variables, 0/4373 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 1/4706 variables, 1/4374 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4706/4706 variables, and 4374 constraints, problems are : Problem set: 1 solved, 29 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 267/267 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 30/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 213/267 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 29 unsolved
[2024-05-29 15:37:36] [INFO ] Deduced a trap composed of 13 places in 1314 ms of which 21 ms to minimize.
[2024-05-29 15:37:37] [INFO ] Deduced a trap composed of 17 places in 1334 ms of which 2 ms to minimize.
[2024-05-29 15:37:38] [INFO ] Deduced a trap composed of 16 places in 1316 ms of which 3 ms to minimize.
[2024-05-29 15:37:40] [INFO ] Deduced a trap composed of 13 places in 1598 ms of which 2 ms to minimize.
SMT process timed out in 11702ms, After SMT, problems are : Problem set: 1 solved, 29 unsolved
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 54 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Graph (complete) has 706 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.35 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 266 transition count 4350
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 93 rules applied. Total rules applied 198 place count 186 transition count 4337
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 16 rules applied. Total rules applied 214 place count 181 transition count 4326
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 227 place count 171 transition count 4323
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 227 place count 171 transition count 4309
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 255 place count 157 transition count 4309
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 273 place count 139 transition count 4288
Iterating global reduction 4 with 18 rules applied. Total rules applied 291 place count 139 transition count 4288
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 323 place count 139 transition count 4256
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 324 place count 138 transition count 4255
Iterating global reduction 5 with 1 rules applied. Total rules applied 325 place count 138 transition count 4255
Performed 30 Post agglomeration using F-continuation condition with reduction of 2811 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 385 place count 108 transition count 1414
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1019 transitions
Reduce isomorphic transitions removed 1026 transitions.
Iterating post reduction 5 with 1026 rules applied. Total rules applied 1411 place count 108 transition count 388
Performed 4 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1419 place count 104 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 6 with 108 rules applied. Total rules applied 1527 place count 104 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 7 with 44 rules applied. Total rules applied 1571 place count 104 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1575 place count 102 transition count 134
Free-agglomeration rule applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1587 place count 102 transition count 122
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1599 place count 90 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1600 place count 90 transition count 121
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1601 place count 90 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1602 place count 90 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1603 place count 89 transition count 119
Applied a total of 1603 rules in 591 ms. Remains 89 /267 variables (removed 178) and now considering 119/4455 (removed 4336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 89/267 places, 119/4455 transitions.
RANDOM walk for 40000 steps (369 resets) in 209 ms. (190 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40004 steps (53 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (47 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (25 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (50 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
// Phase 1: matrix 119 rows 89 cols
[2024-05-29 15:37:41] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 15:37:41] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 81/141 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 19/160 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 10/170 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 14/184 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/185 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/187 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 14/201 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 6/207 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/207 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/207 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 1/208 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/208 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/208 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 119 constraints, problems are : Problem set: 0 solved, 5 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 89/89 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 4 ms to minimize.
Problem AtomicPropp13 is UNSAT
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem AtomicPropp19 is UNSAT
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem AtomicPropp35 is UNSAT
After SMT solving in domain Int declared 60/208 variables, and 25 constraints, problems are : Problem set: 5 solved, 0 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 7/10 constraints, State Equation: 0/89 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 18/18 constraints]
After SMT, in 756ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 15:37:42] [INFO ] Flatten gal took : 280 ms
[2024-05-29 15:37:42] [INFO ] Flatten gal took : 291 ms
[2024-05-29 15:37:43] [INFO ] Input system was already deterministic with 4455 transitions.
Support contains 62 out of 267 places (down from 63) after GAL structural reductions.
Computed a total of 37 stabilizing places and 37 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 213 transition count 4393
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 213 transition count 4393
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 121 place count 213 transition count 4380
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 151 place count 183 transition count 4348
Iterating global reduction 1 with 30 rules applied. Total rules applied 181 place count 183 transition count 4348
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 188 place count 183 transition count 4341
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 167 transition count 4325
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 167 transition count 4325
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 230 place count 157 transition count 4315
Iterating global reduction 2 with 10 rules applied. Total rules applied 240 place count 157 transition count 4315
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 250 place count 147 transition count 4305
Iterating global reduction 2 with 10 rules applied. Total rules applied 260 place count 147 transition count 4305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 262 place count 147 transition count 4303
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 267 place count 142 transition count 4298
Iterating global reduction 3 with 5 rules applied. Total rules applied 272 place count 142 transition count 4298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 276 place count 142 transition count 4294
Applied a total of 276 rules in 138 ms. Remains 142 /267 variables (removed 125) and now considering 4294/4455 (removed 161) transitions.
[2024-05-29 15:37:43] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
// Phase 1: matrix 4282 rows 142 cols
[2024-05-29 15:37:43] [INFO ] Computed 1 invariants in 22 ms
[2024-05-29 15:37:44] [INFO ] Implicit Places using invariants in 1324 ms returned []
[2024-05-29 15:37:44] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 15:37:44] [INFO ] Invariant cache hit.
[2024-05-29 15:37:46] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:37:47] [INFO ] Implicit Places using invariants and state equation in 3056 ms returned []
Implicit Place search using SMT with State Equation took 4390 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2024-05-29 15:37:47] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 15:37:47] [INFO ] Invariant cache hit.
[2024-05-29 15:37:48] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
SMT process timed out in 98468ms, After SMT, problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 98525ms
Starting structural reductions in LTL mode, iteration 1 : 142/267 places, 4294/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103082 ms. Remains : 142/267 places, 4294/4455 transitions.
[2024-05-29 15:39:26] [INFO ] Flatten gal took : 275 ms
[2024-05-29 15:39:27] [INFO ] Flatten gal took : 296 ms
[2024-05-29 15:39:27] [INFO ] Input system was already deterministic with 4294 transitions.
[2024-05-29 15:39:28] [INFO ] Flatten gal took : 281 ms
[2024-05-29 15:39:28] [INFO ] Flatten gal took : 282 ms
[2024-05-29 15:39:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality4114027625756363689.gal : 124 ms
[2024-05-29 15:39:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality12592297877173736373.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4114027625756363689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12592297877173736373.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-29 15:39:58] [INFO ] Flatten gal took : 263 ms
[2024-05-29 15:39:58] [INFO ] Applying decomposition
[2024-05-29 15:39:59] [INFO ] Flatten gal took : 264 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/graph6994326647346278195.txt' '-o' '/tmp/graph6994326647346278195.bin' '-w' '/tmp/graph6994326647346278195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6994326647346278195.bin' '-l' '-1' '-v' '-w' '/tmp/graph6994326647346278195.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:40:00] [INFO ] Decomposing Gal with order
[2024-05-29 15:40:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:40:01] [INFO ] Removed a total of 45142 redundant transitions.
[2024-05-29 15:40:01] [INFO ] Flatten gal took : 1269 ms
[2024-05-29 15:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 658 ms.
[2024-05-29 15:40:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10516672117123919640.gal : 58 ms
[2024-05-29 15:40:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality4068263827118767290.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/CTLCardinality10516672117123919640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4068263827118767290.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 LTL mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 213 transition count 4393
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 213 transition count 4393
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 121 place count 213 transition count 4380
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 152 place count 182 transition count 4347
Iterating global reduction 1 with 31 rules applied. Total rules applied 183 place count 182 transition count 4347
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 190 place count 182 transition count 4340
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 207 place count 165 transition count 4323
Iterating global reduction 2 with 17 rules applied. Total rules applied 224 place count 165 transition count 4323
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 235 place count 154 transition count 4312
Iterating global reduction 2 with 11 rules applied. Total rules applied 246 place count 154 transition count 4312
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 257 place count 143 transition count 4301
Iterating global reduction 2 with 11 rules applied. Total rules applied 268 place count 143 transition count 4301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 270 place count 143 transition count 4299
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 276 place count 137 transition count 4293
Iterating global reduction 3 with 6 rules applied. Total rules applied 282 place count 137 transition count 4293
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 287 place count 137 transition count 4288
Applied a total of 287 rules in 113 ms. Remains 137 /267 variables (removed 130) and now considering 4288/4455 (removed 167) transitions.
[2024-05-29 15:40:32] [INFO ] Flow matrix only has 4276 transitions (discarded 12 similar events)
// Phase 1: matrix 4276 rows 137 cols
[2024-05-29 15:40:32] [INFO ] Computed 1 invariants in 21 ms
[2024-05-29 15:40:34] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2024-05-29 15:40:34] [INFO ] Flow matrix only has 4276 transitions (discarded 12 similar events)
[2024-05-29 15:40:34] [INFO ] Invariant cache hit.
[2024-05-29 15:40:35] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:40:36] [INFO ] Implicit Places using invariants and state equation in 2796 ms returned []
Implicit Place search using SMT with State Equation took 4030 ms to find 0 implicit places.
Running 4287 sub problems to find dead transitions.
[2024-05-29 15:40:36] [INFO ] Flow matrix only has 4276 transitions (discarded 12 similar events)
[2024-05-29 15:40:36] [INFO ] Invariant cache hit.
[2024-05-29 15:40:37] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4287 unsolved
SMT process timed out in 99856ms, After SMT, problems are : Problem set: 0 solved, 4287 unsolved
Search for dead transitions found 0 dead transitions in 99914ms
Starting structural reductions in LTL mode, iteration 1 : 137/267 places, 4288/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104081 ms. Remains : 137/267 places, 4288/4455 transitions.
[2024-05-29 15:42:17] [INFO ] Flatten gal took : 254 ms
[2024-05-29 15:42:17] [INFO ] Flatten gal took : 279 ms
[2024-05-29 15:42:17] [INFO ] Input system was already deterministic with 4288 transitions.
[2024-05-29 15:42:18] [INFO ] Flatten gal took : 258 ms
[2024-05-29 15:42:18] [INFO ] Flatten gal took : 261 ms
[2024-05-29 15:42:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8110027108374973334.gal : 56 ms
[2024-05-29 15:42:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3302947694807719856.ctl : 134 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/CTLCardinality8110027108374973334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3302947694807719856.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-29 15:42:48] [INFO ] Flatten gal took : 298 ms
[2024-05-29 15:42:48] [INFO ] Applying decomposition
[2024-05-29 15:42:49] [INFO ] Flatten gal took : 260 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/graph10138430373070396258.txt' '-o' '/tmp/graph10138430373070396258.bin' '-w' '/tmp/graph10138430373070396258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10138430373070396258.bin' '-l' '-1' '-v' '-w' '/tmp/graph10138430373070396258.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:42:50] [INFO ] Decomposing Gal with order
[2024-05-29 15:42:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:42:50] [INFO ] Removed a total of 45146 redundant transitions.
[2024-05-29 15:42:50] [INFO ] Flatten gal took : 668 ms
[2024-05-29 15:42:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 286 ms.
[2024-05-29 15:42:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality8824623353965002283.gal : 27 ms
[2024-05-29 15:42:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3598047291164441708.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/CTLCardinality8824623353965002283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3598047291164441708.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 : 267/267 places, 4455/4455 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 266 transition count 4305
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 1 with 175 rules applied. Total rules applied 324 place count 117 transition count 4279
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 330 place count 114 transition count 4276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 332 place count 113 transition count 4275
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 332 place count 113 transition count 4258
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 366 place count 96 transition count 4258
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 378 place count 84 transition count 4238
Iterating global reduction 4 with 12 rules applied. Total rules applied 390 place count 84 transition count 4238
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 4 with 255 rules applied. Total rules applied 645 place count 84 transition count 3983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 645 place count 84 transition count 3981
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 649 place count 82 transition count 3981
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 651 place count 80 transition count 3977
Iterating global reduction 5 with 2 rules applied. Total rules applied 653 place count 80 transition count 3977
Ensure Unique test removed 768 transitions
Reduce isomorphic transitions removed 768 transitions.
Iterating post reduction 5 with 768 rules applied. Total rules applied 1421 place count 80 transition count 3209
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1467 place count 57 transition count 3186
Ensure Unique test removed 1045 transitions
Reduce isomorphic transitions removed 1045 transitions.
Iterating post reduction 6 with 1045 rules applied. Total rules applied 2512 place count 57 transition count 2141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2516 place count 55 transition count 2139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2518 place count 55 transition count 2137
Drop transitions (Redundant composition of simpler transitions.) removed 2051 transitions
Redundant transition composition rules discarded 2051 transitions
Iterating global reduction 8 with 2051 rules applied. Total rules applied 4569 place count 55 transition count 86
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 4591 place count 44 transition count 75
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 4593 place count 44 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 4594 place count 44 transition count 74
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 8 with 9 rules applied. Total rules applied 4603 place count 35 transition count 65
Applied a total of 4603 rules in 965 ms. Remains 35 /267 variables (removed 232) and now considering 65/4455 (removed 4390) transitions.
[2024-05-29 15:43:22] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
// Phase 1: matrix 54 rows 35 cols
[2024-05-29 15:43:22] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 15:43:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 15:43:22] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
[2024-05-29 15:43:22] [INFO ] Invariant cache hit.
[2024-05-29 15:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 15:43:22] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-29 15:43:22] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-29 15:43:22] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
[2024-05-29 15:43:22] [INFO ] Invariant cache hit.
[2024-05-29 15:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 11/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 4 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:43:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 53/88 variables, 35/133 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:43:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:43:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 1/89 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 0/89 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 159 constraints, problems are : Problem set: 0 solved, 45 unsolved in 4999 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 11/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 122/123 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:27] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 53/88 variables, 35/159 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 45/204 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 205 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 123/123 constraints]
After SMT, in 6955ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 6955ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/267 places, 65/4455 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8009 ms. Remains : 35/267 places, 65/4455 transitions.
[2024-05-29 15:43:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 15:43:29] [INFO ] Flatten gal took : 3 ms
[2024-05-29 15:43:29] [INFO ] Input system was already deterministic with 65 transitions.
RANDOM walk for 424 steps (29 resets) in 12 ms. (32 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 15:43:29] [INFO ] Flatten gal took : 4 ms
[2024-05-29 15:43:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 15:43:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7898421791137621927.gal : 0 ms
[2024-05-29 15:43:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11902858296169814740.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7898421791137621927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11902858296169814740.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 266 transition count 4305
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 1 with 175 rules applied. Total rules applied 324 place count 117 transition count 4279
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 330 place count 114 transition count 4276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 332 place count 113 transition count 4275
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 332 place count 113 transition count 4258
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 366 place count 96 transition count 4258
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 378 place count 84 transition count 4238
Iterating global reduction 4 with 12 rules applied. Total rules applied 390 place count 84 transition count 4238
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 4 with 255 rules applied. Total rules applied 645 place count 84 transition count 3983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 645 place count 84 transition count 3981
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 649 place count 82 transition count 3981
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 651 place count 80 transition count 3977
Iterating global reduction 5 with 2 rules applied. Total rules applied 653 place count 80 transition count 3977
Ensure Unique test removed 768 transitions
Reduce isomorphic transitions removed 768 transitions.
Iterating post reduction 5 with 768 rules applied. Total rules applied 1421 place count 80 transition count 3209
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1467 place count 57 transition count 3186
Ensure Unique test removed 1045 transitions
Reduce isomorphic transitions removed 1045 transitions.
Iterating post reduction 6 with 1045 rules applied. Total rules applied 2512 place count 57 transition count 2141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2516 place count 55 transition count 2139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2518 place count 55 transition count 2137
Drop transitions (Redundant composition of simpler transitions.) removed 2051 transitions
Redundant transition composition rules discarded 2051 transitions
Iterating global reduction 8 with 2051 rules applied. Total rules applied 4569 place count 55 transition count 86
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 4591 place count 44 transition count 75
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 4593 place count 44 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 4594 place count 44 transition count 74
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 8 with 9 rules applied. Total rules applied 4603 place count 35 transition count 65
Applied a total of 4603 rules in 672 ms. Remains 35 /267 variables (removed 232) and now considering 65/4455 (removed 4390) transitions.
[2024-05-29 15:43:30] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
// Phase 1: matrix 54 rows 35 cols
[2024-05-29 15:43:30] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 15:43:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 15:43:30] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
[2024-05-29 15:43:30] [INFO ] Invariant cache hit.
[2024-05-29 15:43:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 15:43:30] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-29 15:43:30] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-29 15:43:30] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
[2024-05-29 15:43:30] [INFO ] Invariant cache hit.
[2024-05-29 15:43:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 11/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 53/88 variables, 35/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 4 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:43:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:43:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 1/89 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (OVERLAPS) 0/89 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 154 constraints, problems are : Problem set: 0 solved, 45 unsolved in 4790 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 11/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 15:43:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 53/88 variables, 35/154 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 45/199 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 200 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 118/118 constraints]
After SMT, in 6088ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 6088ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/267 places, 65/4455 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6851 ms. Remains : 35/267 places, 65/4455 transitions.
[2024-05-29 15:43:36] [INFO ] Flatten gal took : 6 ms
[2024-05-29 15:43:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 15:43:36] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-29 15:43:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 15:43:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 15:43:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7582246576426663092.gal : 0 ms
[2024-05-29 15:43:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality9591720596296417792.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/CTLCardinality7582246576426663092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9591720596296417792.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,2071,0.025538,4220,2,304,5,3212,6,0,194,1564,0


Converting to forward existential form...Done !
original formula: EG((p352==0))
=> equivalent forward existential formula: [FwdG(Init,(p352==0))] != FALSE
Hit Full ! (commute/partial/dont) 63/0/2
(forward)formula 0,1,0.05618,5056,1,0,7,7804,19,2,1636,3972,8
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 213 transition count 4393
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 213 transition count 4393
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 122 place count 213 transition count 4379
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 152 place count 183 transition count 4347
Iterating global reduction 1 with 30 rules applied. Total rules applied 182 place count 183 transition count 4347
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 189 place count 183 transition count 4340
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 205 place count 167 transition count 4324
Iterating global reduction 2 with 16 rules applied. Total rules applied 221 place count 167 transition count 4324
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 232 place count 156 transition count 4313
Iterating global reduction 2 with 11 rules applied. Total rules applied 243 place count 156 transition count 4313
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 254 place count 145 transition count 4302
Iterating global reduction 2 with 11 rules applied. Total rules applied 265 place count 145 transition count 4302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 267 place count 145 transition count 4300
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 273 place count 139 transition count 4294
Iterating global reduction 3 with 6 rules applied. Total rules applied 279 place count 139 transition count 4294
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 284 place count 139 transition count 4289
Applied a total of 284 rules in 106 ms. Remains 139 /267 variables (removed 128) and now considering 4289/4455 (removed 166) transitions.
[2024-05-29 15:43:36] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
// Phase 1: matrix 4277 rows 139 cols
[2024-05-29 15:43:36] [INFO ] Computed 1 invariants in 23 ms
[2024-05-29 15:43:37] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-05-29 15:43:37] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-05-29 15:43:37] [INFO ] Invariant cache hit.
[2024-05-29 15:43:38] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:43:40] [INFO ] Implicit Places using invariants and state equation in 2752 ms returned []
Implicit Place search using SMT with State Equation took 3964 ms to find 0 implicit places.
Running 4288 sub problems to find dead transitions.
[2024-05-29 15:43:40] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-05-29 15:43:40] [INFO ] Invariant cache hit.
[2024-05-29 15:43:40] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4288 unsolved
SMT process timed out in 97453ms, After SMT, problems are : Problem set: 0 solved, 4288 unsolved
Search for dead transitions found 0 dead transitions in 97496ms
Starting structural reductions in LTL mode, iteration 1 : 139/267 places, 4289/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101583 ms. Remains : 139/267 places, 4289/4455 transitions.
[2024-05-29 15:45:18] [INFO ] Flatten gal took : 270 ms
[2024-05-29 15:45:18] [INFO ] Flatten gal took : 258 ms
[2024-05-29 15:45:19] [INFO ] Input system was already deterministic with 4289 transitions.
[2024-05-29 15:45:19] [INFO ] Flatten gal took : 261 ms
[2024-05-29 15:45:19] [INFO ] Flatten gal took : 264 ms
[2024-05-29 15:45:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality17578666856918879793.gal : 52 ms
[2024-05-29 15:45:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality11367128109683914614.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/CTLCardinality17578666856918879793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11367128109683914614.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-29 15:45:49] [INFO ] Flatten gal took : 264 ms
[2024-05-29 15:45:49] [INFO ] Applying decomposition
[2024-05-29 15:45:50] [INFO ] Flatten gal took : 264 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/graph14677692513255128446.txt' '-o' '/tmp/graph14677692513255128446.bin' '-w' '/tmp/graph14677692513255128446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14677692513255128446.bin' '-l' '-1' '-v' '-w' '/tmp/graph14677692513255128446.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:45:51] [INFO ] Decomposing Gal with order
[2024-05-29 15:45:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:45:51] [INFO ] Removed a total of 45149 redundant transitions.
[2024-05-29 15:45:51] [INFO ] Flatten gal took : 661 ms
[2024-05-29 15:45:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 211 ms.
[2024-05-29 15:45:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality1722035137202121075.gal : 26 ms
[2024-05-29 15:45:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16443141702976230109.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/CTLCardinality1722035137202121075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16443141702976230109.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 LTL mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 217 transition count 4398
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 217 transition count 4398
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 113 place count 217 transition count 4385
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 141 place count 189 transition count 4356
Iterating global reduction 1 with 28 rules applied. Total rules applied 169 place count 189 transition count 4356
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 176 place count 189 transition count 4349
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 190 place count 175 transition count 4335
Iterating global reduction 2 with 14 rules applied. Total rules applied 204 place count 175 transition count 4335
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 213 place count 166 transition count 4326
Iterating global reduction 2 with 9 rules applied. Total rules applied 222 place count 166 transition count 4326
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 231 place count 157 transition count 4317
Iterating global reduction 2 with 9 rules applied. Total rules applied 240 place count 157 transition count 4317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 157 transition count 4316
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 246 place count 152 transition count 4311
Iterating global reduction 3 with 5 rules applied. Total rules applied 251 place count 152 transition count 4311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 255 place count 152 transition count 4307
Applied a total of 255 rules in 105 ms. Remains 152 /267 variables (removed 115) and now considering 4307/4455 (removed 148) transitions.
[2024-05-29 15:46:22] [INFO ] Flow matrix only has 4294 transitions (discarded 13 similar events)
// Phase 1: matrix 4294 rows 152 cols
[2024-05-29 15:46:22] [INFO ] Computed 1 invariants in 21 ms
[2024-05-29 15:46:23] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2024-05-29 15:46:23] [INFO ] Flow matrix only has 4294 transitions (discarded 13 similar events)
[2024-05-29 15:46:23] [INFO ] Invariant cache hit.
[2024-05-29 15:46:24] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:46:26] [INFO ] Implicit Places using invariants and state equation in 2769 ms returned []
Implicit Place search using SMT with State Equation took 3984 ms to find 0 implicit places.
Running 4306 sub problems to find dead transitions.
[2024-05-29 15:46:26] [INFO ] Flow matrix only has 4294 transitions (discarded 13 similar events)
[2024-05-29 15:46:26] [INFO ] Invariant cache hit.
[2024-05-29 15:46:26] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4306 unsolved
SMT process timed out in 97178ms, After SMT, problems are : Problem set: 0 solved, 4306 unsolved
Search for dead transitions found 0 dead transitions in 97220ms
Starting structural reductions in LTL mode, iteration 1 : 152/267 places, 4307/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101332 ms. Remains : 152/267 places, 4307/4455 transitions.
[2024-05-29 15:48:03] [INFO ] Flatten gal took : 270 ms
[2024-05-29 15:48:04] [INFO ] Flatten gal took : 288 ms
[2024-05-29 15:48:04] [INFO ] Input system was already deterministic with 4307 transitions.
[2024-05-29 15:48:05] [INFO ] Flatten gal took : 287 ms
[2024-05-29 15:48:05] [INFO ] Flatten gal took : 290 ms
[2024-05-29 15:48:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality17627092898346746620.gal : 57 ms
[2024-05-29 15:48:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality18247087252371987454.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/CTLCardinality17627092898346746620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18247087252371987454.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-29 15:48:36] [INFO ] Flatten gal took : 325 ms
[2024-05-29 15:48:36] [INFO ] Applying decomposition
[2024-05-29 15:48:36] [INFO ] Flatten gal took : 277 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/graph8363803884778929029.txt' '-o' '/tmp/graph8363803884778929029.bin' '-w' '/tmp/graph8363803884778929029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8363803884778929029.bin' '-l' '-1' '-v' '-w' '/tmp/graph8363803884778929029.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:48:37] [INFO ] Decomposing Gal with order
[2024-05-29 15:48:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:48:38] [INFO ] Removed a total of 45152 redundant transitions.
[2024-05-29 15:48:38] [INFO ] Flatten gal took : 650 ms
[2024-05-29 15:48:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 207 ms.
[2024-05-29 15:48:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality3661881813565229249.gal : 26 ms
[2024-05-29 15:48:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality2142348611245263267.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/CTLCardinality3661881813565229249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2142348611245263267.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 : 267/267 places, 4455/4455 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 219 transition count 4401
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 219 transition count 4401
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 107 place count 219 transition count 4390
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 134 place count 192 transition count 4361
Iterating global reduction 1 with 27 rules applied. Total rules applied 161 place count 192 transition count 4361
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 166 place count 192 transition count 4356
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 183 place count 175 transition count 4339
Iterating global reduction 2 with 17 rules applied. Total rules applied 200 place count 175 transition count 4339
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 211 place count 164 transition count 4328
Iterating global reduction 2 with 11 rules applied. Total rules applied 222 place count 164 transition count 4328
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 233 place count 153 transition count 4317
Iterating global reduction 2 with 11 rules applied. Total rules applied 244 place count 153 transition count 4317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 153 transition count 4315
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 252 place count 147 transition count 4309
Iterating global reduction 3 with 6 rules applied. Total rules applied 258 place count 147 transition count 4309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 263 place count 147 transition count 4304
Applied a total of 263 rules in 106 ms. Remains 147 /267 variables (removed 120) and now considering 4304/4455 (removed 151) transitions.
[2024-05-29 15:49:08] [INFO ] Flow matrix only has 4292 transitions (discarded 12 similar events)
// Phase 1: matrix 4292 rows 147 cols
[2024-05-29 15:49:08] [INFO ] Computed 1 invariants in 29 ms
[2024-05-29 15:49:09] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2024-05-29 15:49:09] [INFO ] Flow matrix only has 4292 transitions (discarded 12 similar events)
[2024-05-29 15:49:09] [INFO ] Invariant cache hit.
[2024-05-29 15:49:10] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:49:12] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 3822 ms to find 0 implicit places.
Running 4303 sub problems to find dead transitions.
[2024-05-29 15:49:12] [INFO ] Flow matrix only has 4292 transitions (discarded 12 similar events)
[2024-05-29 15:49:12] [INFO ] Invariant cache hit.
[2024-05-29 15:49:12] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4303 unsolved
SMT process timed out in 103826ms, After SMT, problems are : Problem set: 0 solved, 4303 unsolved
Search for dead transitions found 0 dead transitions in 103880ms
Starting structural reductions in LTL mode, iteration 1 : 147/267 places, 4304/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107832 ms. Remains : 147/267 places, 4304/4455 transitions.
[2024-05-29 15:50:56] [INFO ] Flatten gal took : 251 ms
[2024-05-29 15:50:56] [INFO ] Flatten gal took : 261 ms
[2024-05-29 15:50:57] [INFO ] Input system was already deterministic with 4304 transitions.
[2024-05-29 15:50:57] [INFO ] Flatten gal took : 264 ms
[2024-05-29 15:50:58] [INFO ] Flatten gal took : 271 ms
[2024-05-29 15:50:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality6775275349926200865.gal : 54 ms
[2024-05-29 15:50:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10565530161294200760.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/CTLCardinality6775275349926200865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10565530161294200760.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-29 15:51:28] [INFO ] Flatten gal took : 287 ms
[2024-05-29 15:51:28] [INFO ] Applying decomposition
[2024-05-29 15:51:28] [INFO ] Flatten gal took : 281 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/graph3895620660702679638.txt' '-o' '/tmp/graph3895620660702679638.bin' '-w' '/tmp/graph3895620660702679638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3895620660702679638.bin' '-l' '-1' '-v' '-w' '/tmp/graph3895620660702679638.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:51:29] [INFO ] Decomposing Gal with order
[2024-05-29 15:51:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:51:30] [INFO ] Removed a total of 45150 redundant transitions.
[2024-05-29 15:51:30] [INFO ] Flatten gal took : 787 ms
[2024-05-29 15:51:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 262 ms.
[2024-05-29 15:51:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality11238954150853150369.gal : 28 ms
[2024-05-29 15:51:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality14697487608797105126.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/CTLCardinality11238954150853150369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14697487608797105126.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 218 transition count 4398
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 218 transition count 4398
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 111 place count 218 transition count 4385
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 136 place count 193 transition count 4358
Iterating global reduction 1 with 25 rules applied. Total rules applied 161 place count 193 transition count 4358
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 164 place count 193 transition count 4355
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 179 place count 178 transition count 4340
Iterating global reduction 2 with 15 rules applied. Total rules applied 194 place count 178 transition count 4340
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 204 place count 168 transition count 4330
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 168 transition count 4330
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 224 place count 158 transition count 4320
Iterating global reduction 2 with 10 rules applied. Total rules applied 234 place count 158 transition count 4320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 236 place count 158 transition count 4318
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 242 place count 152 transition count 4312
Iterating global reduction 3 with 6 rules applied. Total rules applied 248 place count 152 transition count 4312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 252 place count 152 transition count 4308
Applied a total of 252 rules in 114 ms. Remains 152 /267 variables (removed 115) and now considering 4308/4455 (removed 147) transitions.
[2024-05-29 15:52:01] [INFO ] Flow matrix only has 4296 transitions (discarded 12 similar events)
// Phase 1: matrix 4296 rows 152 cols
[2024-05-29 15:52:01] [INFO ] Computed 1 invariants in 26 ms
[2024-05-29 15:52:02] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2024-05-29 15:52:02] [INFO ] Flow matrix only has 4296 transitions (discarded 12 similar events)
[2024-05-29 15:52:02] [INFO ] Invariant cache hit.
[2024-05-29 15:52:03] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:52:05] [INFO ] Implicit Places using invariants and state equation in 2695 ms returned []
Implicit Place search using SMT with State Equation took 3924 ms to find 0 implicit places.
Running 4307 sub problems to find dead transitions.
[2024-05-29 15:52:05] [INFO ] Flow matrix only has 4296 transitions (discarded 12 similar events)
[2024-05-29 15:52:05] [INFO ] Invariant cache hit.
[2024-05-29 15:52:05] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4307 unsolved
SMT process timed out in 106863ms, After SMT, problems are : Problem set: 0 solved, 4307 unsolved
Search for dead transitions found 0 dead transitions in 106916ms
Starting structural reductions in LTL mode, iteration 1 : 152/267 places, 4308/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110972 ms. Remains : 152/267 places, 4308/4455 transitions.
[2024-05-29 15:53:52] [INFO ] Flatten gal took : 245 ms
[2024-05-29 15:53:52] [INFO ] Flatten gal took : 299 ms
[2024-05-29 15:53:53] [INFO ] Input system was already deterministic with 4308 transitions.
[2024-05-29 15:53:53] [INFO ] Flatten gal took : 261 ms
[2024-05-29 15:53:53] [INFO ] Flatten gal took : 263 ms
[2024-05-29 15:53:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality12432108561245057865.gal : 52 ms
[2024-05-29 15:53:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality2075792037777825869.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/CTLCardinality12432108561245057865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2075792037777825869.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-29 15:54:24] [INFO ] Flatten gal took : 262 ms
[2024-05-29 15:54:24] [INFO ] Applying decomposition
[2024-05-29 15:54:24] [INFO ] Flatten gal took : 268 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/graph7140312028790513226.txt' '-o' '/tmp/graph7140312028790513226.bin' '-w' '/tmp/graph7140312028790513226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7140312028790513226.bin' '-l' '-1' '-v' '-w' '/tmp/graph7140312028790513226.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:54:25] [INFO ] Decomposing Gal with order
[2024-05-29 15:54:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:54:26] [INFO ] Removed a total of 45142 redundant transitions.
[2024-05-29 15:54:26] [INFO ] Flatten gal took : 661 ms
[2024-05-29 15:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 372 ms.
[2024-05-29 15:54:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality17059513482045035012.gal : 32 ms
[2024-05-29 15:54:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality676817148972987393.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/CTLCardinality17059513482045035012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality676817148972987393.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 : 267/267 places, 4455/4455 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 216 transition count 4397
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 216 transition count 4397
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 114 place count 216 transition count 4385
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 143 place count 187 transition count 4354
Iterating global reduction 1 with 29 rules applied. Total rules applied 172 place count 187 transition count 4354
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 179 place count 187 transition count 4347
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 195 place count 171 transition count 4331
Iterating global reduction 2 with 16 rules applied. Total rules applied 211 place count 171 transition count 4331
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 219 place count 163 transition count 4323
Iterating global reduction 2 with 8 rules applied. Total rules applied 227 place count 163 transition count 4323
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 235 place count 155 transition count 4315
Iterating global reduction 2 with 8 rules applied. Total rules applied 243 place count 155 transition count 4315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 244 place count 155 transition count 4314
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 150 transition count 4309
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 150 transition count 4309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 258 place count 150 transition count 4305
Applied a total of 258 rules in 117 ms. Remains 150 /267 variables (removed 117) and now considering 4305/4455 (removed 150) transitions.
[2024-05-29 15:54:56] [INFO ] Flow matrix only has 4293 transitions (discarded 12 similar events)
// Phase 1: matrix 4293 rows 150 cols
[2024-05-29 15:54:56] [INFO ] Computed 1 invariants in 19 ms
[2024-05-29 15:54:58] [INFO ] Implicit Places using invariants in 1234 ms returned []
[2024-05-29 15:54:58] [INFO ] Flow matrix only has 4293 transitions (discarded 12 similar events)
[2024-05-29 15:54:58] [INFO ] Invariant cache hit.
[2024-05-29 15:54:59] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:55:01] [INFO ] Implicit Places using invariants and state equation in 2899 ms returned []
Implicit Place search using SMT with State Equation took 4137 ms to find 0 implicit places.
Running 4304 sub problems to find dead transitions.
[2024-05-29 15:55:01] [INFO ] Flow matrix only has 4293 transitions (discarded 12 similar events)
[2024-05-29 15:55:01] [INFO ] Invariant cache hit.
[2024-05-29 15:55:01] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4304 unsolved
SMT process timed out in 99127ms, After SMT, problems are : Problem set: 0 solved, 4304 unsolved
Search for dead transitions found 0 dead transitions in 99181ms
Starting structural reductions in LTL mode, iteration 1 : 150/267 places, 4305/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103457 ms. Remains : 150/267 places, 4305/4455 transitions.
[2024-05-29 15:56:40] [INFO ] Flatten gal took : 246 ms
[2024-05-29 15:56:40] [INFO ] Flatten gal took : 296 ms
[2024-05-29 15:56:41] [INFO ] Input system was already deterministic with 4305 transitions.
[2024-05-29 15:56:41] [INFO ] Flatten gal took : 259 ms
[2024-05-29 15:56:41] [INFO ] Flatten gal took : 262 ms
[2024-05-29 15:56:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2796784574452766297.gal : 52 ms
[2024-05-29 15:56:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16711273319457684007.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/CTLCardinality2796784574452766297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16711273319457684007.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-29 15:57:12] [INFO ] Flatten gal took : 260 ms
[2024-05-29 15:57:12] [INFO ] Applying decomposition
[2024-05-29 15:57:12] [INFO ] Flatten gal took : 264 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/graph9830129634455850856.txt' '-o' '/tmp/graph9830129634455850856.bin' '-w' '/tmp/graph9830129634455850856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9830129634455850856.bin' '-l' '-1' '-v' '-w' '/tmp/graph9830129634455850856.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:57:13] [INFO ] Decomposing Gal with order
[2024-05-29 15:57:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:57:14] [INFO ] Removed a total of 45151 redundant transitions.
[2024-05-29 15:57:14] [INFO ] Flatten gal took : 629 ms
[2024-05-29 15:57:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 320 ms.
[2024-05-29 15:57:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3955204663038653951.gal : 26 ms
[2024-05-29 15:57:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality7887337298361987960.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/CTLCardinality3955204663038653951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7887337298361987960.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 : 267/267 places, 4455/4455 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 213 transition count 4393
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 213 transition count 4393
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 122 place count 213 transition count 4379
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 150 place count 185 transition count 4349
Iterating global reduction 1 with 28 rules applied. Total rules applied 178 place count 185 transition count 4349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 183 place count 185 transition count 4344
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 199 place count 169 transition count 4328
Iterating global reduction 2 with 16 rules applied. Total rules applied 215 place count 169 transition count 4328
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 224 place count 160 transition count 4319
Iterating global reduction 2 with 9 rules applied. Total rules applied 233 place count 160 transition count 4319
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 242 place count 151 transition count 4310
Iterating global reduction 2 with 9 rules applied. Total rules applied 251 place count 151 transition count 4310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 253 place count 151 transition count 4308
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 257 place count 147 transition count 4304
Iterating global reduction 3 with 4 rules applied. Total rules applied 261 place count 147 transition count 4304
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 265 place count 147 transition count 4300
Applied a total of 265 rules in 103 ms. Remains 147 /267 variables (removed 120) and now considering 4300/4455 (removed 155) transitions.
[2024-05-29 15:57:44] [INFO ] Flow matrix only has 4288 transitions (discarded 12 similar events)
// Phase 1: matrix 4288 rows 147 cols
[2024-05-29 15:57:44] [INFO ] Computed 1 invariants in 19 ms
[2024-05-29 15:57:45] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2024-05-29 15:57:45] [INFO ] Flow matrix only has 4288 transitions (discarded 12 similar events)
[2024-05-29 15:57:45] [INFO ] Invariant cache hit.
[2024-05-29 15:57:46] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 15:57:48] [INFO ] Implicit Places using invariants and state equation in 2852 ms returned []
Implicit Place search using SMT with State Equation took 4084 ms to find 0 implicit places.
Running 4299 sub problems to find dead transitions.
[2024-05-29 15:57:48] [INFO ] Flow matrix only has 4288 transitions (discarded 12 similar events)
[2024-05-29 15:57:48] [INFO ] Invariant cache hit.
[2024-05-29 15:57:49] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4299 unsolved
SMT process timed out in 109383ms, After SMT, problems are : Problem set: 0 solved, 4299 unsolved
Search for dead transitions found 0 dead transitions in 109425ms
Starting structural reductions in LTL mode, iteration 1 : 147/267 places, 4300/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113633 ms. Remains : 147/267 places, 4300/4455 transitions.
[2024-05-29 15:59:38] [INFO ] Flatten gal took : 248 ms
[2024-05-29 15:59:38] [INFO ] Flatten gal took : 265 ms
[2024-05-29 15:59:39] [INFO ] Input system was already deterministic with 4300 transitions.
[2024-05-29 15:59:39] [INFO ] Flatten gal took : 265 ms
[2024-05-29 15:59:39] [INFO ] Flatten gal took : 283 ms
[2024-05-29 15:59:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5357695241274139702.gal : 55 ms
[2024-05-29 15:59:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality14671171988004420299.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/CTLCardinality5357695241274139702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14671171988004420299.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-29 16:00:10] [INFO ] Flatten gal took : 265 ms
[2024-05-29 16:00:10] [INFO ] Applying decomposition
[2024-05-29 16:00:10] [INFO ] Flatten gal took : 307 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/graph9246130056361892552.txt' '-o' '/tmp/graph9246130056361892552.bin' '-w' '/tmp/graph9246130056361892552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9246130056361892552.bin' '-l' '-1' '-v' '-w' '/tmp/graph9246130056361892552.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:00:11] [INFO ] Decomposing Gal with order
[2024-05-29 16:00:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:00:12] [INFO ] Removed a total of 45153 redundant transitions.
[2024-05-29 16:00:12] [INFO ] Flatten gal took : 657 ms
[2024-05-29 16:00:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 341 ms.
[2024-05-29 16:00:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6821434697843993265.gal : 30 ms
[2024-05-29 16:00:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9822218799845566734.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/CTLCardinality6821434697843993265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9822218799845566734.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 : 267/267 places, 4455/4455 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 266 transition count 4321
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 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 1 with 156 rules applied. Total rules applied 289 place count 133 transition count 4298
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 295 place count 130 transition count 4295
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 301 place count 129 transition count 4290
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 305 place count 125 transition count 4290
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 305 place count 125 transition count 4273
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 339 place count 108 transition count 4273
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 350 place count 97 transition count 4254
Iterating global reduction 5 with 11 rules applied. Total rules applied 361 place count 97 transition count 4254
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 5 with 127 rules applied. Total rules applied 488 place count 97 transition count 4127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 488 place count 97 transition count 4126
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 490 place count 96 transition count 4126
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 492 place count 94 transition count 4122
Iterating global reduction 6 with 2 rules applied. Total rules applied 494 place count 94 transition count 4122
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 6 with 384 rules applied. Total rules applied 878 place count 94 transition count 3738
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 926 place count 70 transition count 3714
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Iterating post reduction 7 with 531 rules applied. Total rules applied 1457 place count 70 transition count 3183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1461 place count 68 transition count 3181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1463 place count 68 transition count 3179
Drop transitions (Redundant composition of simpler transitions.) removed 3043 transitions
Redundant transition composition rules discarded 3043 transitions
Iterating global reduction 9 with 3043 rules applied. Total rules applied 4506 place count 68 transition count 136
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 4528 place count 57 transition count 125
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 4532 place count 57 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4533 place count 57 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 4534 place count 57 transition count 123
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4542 place count 49 transition count 115
Applied a total of 4542 rules in 1204 ms. Remains 49 /267 variables (removed 218) and now considering 115/4455 (removed 4340) transitions.
[2024-05-29 16:00:44] [INFO ] Flow matrix only has 104 transitions (discarded 11 similar events)
// Phase 1: matrix 104 rows 49 cols
[2024-05-29 16:00:44] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 16:00:44] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 16:00:44] [INFO ] Flow matrix only has 104 transitions (discarded 11 similar events)
[2024-05-29 16:00:44] [INFO ] Invariant cache hit.
[2024-05-29 16:00:44] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-29 16:00:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-29 16:00:44] [INFO ] Redundant transitions in 3 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-29 16:00:44] [INFO ] Flow matrix only has 104 transitions (discarded 11 similar events)
[2024-05-29 16:00:44] [INFO ] Invariant cache hit.
[2024-05-29 16:00:44] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:00:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:00:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:00:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:00:47] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:00:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/49 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (OVERLAPS) 103/152 variables, 49/155 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 27/182 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (OVERLAPS) 1/153 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/153 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 19 (OVERLAPS) 0/153 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 183 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 16:00:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 16:00:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 103/152 variables, 49/159 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 27/186 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 114/300 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 1/153 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (OVERLAPS) 0/153 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 301 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 109/109 constraints]
After SMT, in 14887ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 14889ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/267 places, 115/4455 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16231 ms. Remains : 49/267 places, 115/4455 transitions.
[2024-05-29 16:00:59] [INFO ] Flatten gal took : 11 ms
[2024-05-29 16:00:59] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:00:59] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-29 16:00:59] [INFO ] Flatten gal took : 5 ms
[2024-05-29 16:00:59] [INFO ] Flatten gal took : 5 ms
[2024-05-29 16:00:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15877342639552124584.gal : 1 ms
[2024-05-29 16:00:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13438115922472596120.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/CTLCardinality15877342639552124584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13438115922472596120.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,3108,0.091296,5564,2,561,5,4992,6,0,299,3295,0


Converting to forward existential form...Done !
original formula: AF((EG(((((p342==0)||(p199==1))&&((p54==0)||(p350==1)))&&(((p35==0)||((p4==0)&&(p381==1)))||(p32==0)))) * AG((p12==1))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(((((p342==0)||(p199==1))&&((p54==0)||(p350==1)))&&(((p35==0)||((p4==0)&&(p381==1)))||(p32==0)))...195
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t24...331
(forward)formula 0,0,0.317152,10900,1,0,187,22688,245,68,4961,18817,240
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 266 transition count 4305
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 1 with 175 rules applied. Total rules applied 324 place count 117 transition count 4279
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 330 place count 114 transition count 4276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 332 place count 113 transition count 4275
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 332 place count 113 transition count 4258
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 366 place count 96 transition count 4258
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 378 place count 84 transition count 4238
Iterating global reduction 4 with 12 rules applied. Total rules applied 390 place count 84 transition count 4238
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 4 with 255 rules applied. Total rules applied 645 place count 84 transition count 3983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 645 place count 84 transition count 3981
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 649 place count 82 transition count 3981
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 651 place count 80 transition count 3977
Iterating global reduction 5 with 2 rules applied. Total rules applied 653 place count 80 transition count 3977
Ensure Unique test removed 768 transitions
Reduce isomorphic transitions removed 768 transitions.
Iterating post reduction 5 with 768 rules applied. Total rules applied 1421 place count 80 transition count 3209
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1467 place count 57 transition count 3186
Ensure Unique test removed 1045 transitions
Reduce isomorphic transitions removed 1045 transitions.
Iterating post reduction 6 with 1045 rules applied. Total rules applied 2512 place count 57 transition count 2141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2516 place count 55 transition count 2139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2518 place count 55 transition count 2137
Drop transitions (Redundant composition of simpler transitions.) removed 2051 transitions
Redundant transition composition rules discarded 2051 transitions
Iterating global reduction 8 with 2051 rules applied. Total rules applied 4569 place count 55 transition count 86
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 4591 place count 44 transition count 75
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 4593 place count 44 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 4594 place count 44 transition count 74
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 8 with 9 rules applied. Total rules applied 4603 place count 35 transition count 65
Applied a total of 4603 rules in 656 ms. Remains 35 /267 variables (removed 232) and now considering 65/4455 (removed 4390) transitions.
[2024-05-29 16:01:00] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
// Phase 1: matrix 54 rows 35 cols
[2024-05-29 16:01:00] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 16:01:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 16:01:00] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
[2024-05-29 16:01:00] [INFO ] Invariant cache hit.
[2024-05-29 16:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 16:01:00] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-29 16:01:00] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-29 16:01:00] [INFO ] Flow matrix only has 54 transitions (discarded 11 similar events)
[2024-05-29 16:01:00] [INFO ] Invariant cache hit.
[2024-05-29 16:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 11/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:01:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:01:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 53/88 variables, 35/96 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:01:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:01:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 16:01:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:01:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:01:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 1/89 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 0/89 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 153 constraints, problems are : Problem set: 0 solved, 45 unsolved in 4796 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 11/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 116/117 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 16:01:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 53/88 variables, 35/153 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 45/198 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 199 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 117/117 constraints]
After SMT, in 6432ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 6446ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/267 places, 65/4455 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7196 ms. Remains : 35/267 places, 65/4455 transitions.
[2024-05-29 16:01:06] [INFO ] Flatten gal took : 2 ms
[2024-05-29 16:01:06] [INFO ] Flatten gal took : 2 ms
[2024-05-29 16:01:06] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-29 16:01:06] [INFO ] Flatten gal took : 2 ms
[2024-05-29 16:01:06] [INFO ] Flatten gal took : 1 ms
[2024-05-29 16:01:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality11456399633837300718.gal : 1 ms
[2024-05-29 16:01:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10579648206198348064.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/CTLCardinality11456399633837300718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10579648206198348064.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,2071,0.020546,4232,2,304,5,3222,6,0,194,1573,0


Converting to forward existential form...Done !
original formula: AG(AF(EG((p388==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG((p388==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...310
(forward)formula 0,0,0.074639,5608,1,0,126,10398,142,49,2076,8519,133
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 4455/4455 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 221 transition count 4403
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 221 transition count 4403
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 102 place count 221 transition count 4393
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 129 place count 194 transition count 4365
Iterating global reduction 1 with 27 rules applied. Total rules applied 156 place count 194 transition count 4365
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 163 place count 194 transition count 4358
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 178 place count 179 transition count 4343
Iterating global reduction 2 with 15 rules applied. Total rules applied 193 place count 179 transition count 4343
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 203 place count 169 transition count 4333
Iterating global reduction 2 with 10 rules applied. Total rules applied 213 place count 169 transition count 4333
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 223 place count 159 transition count 4323
Iterating global reduction 2 with 10 rules applied. Total rules applied 233 place count 159 transition count 4323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 159 transition count 4322
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 239 place count 154 transition count 4317
Iterating global reduction 3 with 5 rules applied. Total rules applied 244 place count 154 transition count 4317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 248 place count 154 transition count 4313
Applied a total of 248 rules in 114 ms. Remains 154 /267 variables (removed 113) and now considering 4313/4455 (removed 142) transitions.
[2024-05-29 16:01:06] [INFO ] Flow matrix only has 4299 transitions (discarded 14 similar events)
// Phase 1: matrix 4299 rows 154 cols
[2024-05-29 16:01:06] [INFO ] Computed 2 invariants in 19 ms
[2024-05-29 16:01:08] [INFO ] Implicit Places using invariants in 1287 ms returned []
[2024-05-29 16:01:08] [INFO ] Flow matrix only has 4299 transitions (discarded 14 similar events)
[2024-05-29 16:01:08] [INFO ] Invariant cache hit.
[2024-05-29 16:01:09] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:01:11] [INFO ] Implicit Places using invariants and state equation in 2863 ms returned []
Implicit Place search using SMT with State Equation took 4164 ms to find 0 implicit places.
Running 4312 sub problems to find dead transitions.
[2024-05-29 16:01:11] [INFO ] Flow matrix only has 4299 transitions (discarded 14 similar events)
[2024-05-29 16:01:11] [INFO ] Invariant cache hit.
[2024-05-29 16:01:11] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4312 unsolved
SMT process timed out in 104556ms, After SMT, problems are : Problem set: 0 solved, 4312 unsolved
Search for dead transitions found 0 dead transitions in 104604ms
Starting structural reductions in LTL mode, iteration 1 : 154/267 places, 4313/4455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108896 ms. Remains : 154/267 places, 4313/4455 transitions.
[2024-05-29 16:02:55] [INFO ] Flatten gal took : 245 ms
[2024-05-29 16:02:56] [INFO ] Flatten gal took : 264 ms
[2024-05-29 16:02:56] [INFO ] Input system was already deterministic with 4313 transitions.
[2024-05-29 16:02:57] [INFO ] Flatten gal took : 282 ms
[2024-05-29 16:02:57] [INFO ] Flatten gal took : 277 ms
[2024-05-29 16:02:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality1219854344803972080.gal : 53 ms
[2024-05-29 16:02:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality15206800237699728449.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/CTLCardinality1219854344803972080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15206800237699728449.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-29 16:03:27] [INFO ] Flatten gal took : 288 ms
[2024-05-29 16:03:27] [INFO ] Applying decomposition
[2024-05-29 16:03:28] [INFO ] Flatten gal took : 287 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/graph6334928152736572196.txt' '-o' '/tmp/graph6334928152736572196.bin' '-w' '/tmp/graph6334928152736572196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6334928152736572196.bin' '-l' '-1' '-v' '-w' '/tmp/graph6334928152736572196.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:03:29] [INFO ] Decomposing Gal with order
[2024-05-29 16:03:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:03:29] [INFO ] Removed a total of 45153 redundant transitions.
[2024-05-29 16:03:30] [INFO ] Flatten gal took : 606 ms
[2024-05-29 16:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 323 ms.
[2024-05-29 16:03:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality8756580057110941550.gal : 26 ms
[2024-05-29 16:03:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality5102591199262031690.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/CTLCardinality8756580057110941550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5102591199262031690.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 : 267/267 places, 4455/4455 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 267 transition count 4311
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 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 1 with 169 rules applied. Total rules applied 313 place count 123 transition count 4286
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 319 place count 120 transition count 4283
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 323 place count 119 transition count 4280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 325 place count 117 transition count 4280
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 325 place count 117 transition count 4265
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 355 place count 102 transition count 4265
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 364 place count 93 transition count 4249
Iterating global reduction 5 with 9 rules applied. Total rules applied 373 place count 93 transition count 4249
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 436 place count 93 transition count 4186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 436 place count 93 transition count 4185
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 438 place count 92 transition count 4185
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 440 place count 90 transition count 4181
Iterating global reduction 6 with 2 rules applied. Total rules applied 442 place count 90 transition count 4181
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 6 with 64 rules applied. Total rules applied 506 place count 90 transition count 4117
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 574 place count 56 transition count 4083
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 7 with 151 rules applied. Total rules applied 725 place count 56 transition count 3932
Drop transitions (Redundant composition of simpler transitions.) removed 3822 transitions
Redundant transition composition rules discarded 3822 transitions
Iterating global reduction 8 with 3822 rules applied. Total rules applied 4547 place count 56 transition count 110
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 4569 place count 45 transition count 99
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 4572 place count 45 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4573 place count 45 transition count 98
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 4574 place count 45 transition count 97
Applied a total of 4574 rules in 1405 ms. Remains 45 /267 variables (removed 222) and now considering 97/4455 (removed 4358) transitions.
[2024-05-29 16:04:01] [INFO ] Flow matrix only has 85 transitions (discarded 12 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-05-29 16:04:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 16:04:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 16:04:01] [INFO ] Flow matrix only has 85 transitions (discarded 12 similar events)
[2024-05-29 16:04:01] [INFO ] Invariant cache hit.
[2024-05-29 16:04:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 16:04:01] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-29 16:04:02] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-29 16:04:02] [INFO ] Flow matrix only has 85 transitions (discarded 12 similar events)
[2024-05-29 16:04:02] [INFO ] Invariant cache hit.
[2024-05-29 16:04:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 16:04:02] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:04:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:04:04] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:04:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:06] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 84/129 variables, 45/144 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 40/184 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:07] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 1/130 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/130 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/130 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 19 (OVERLAPS) 0/130 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 188 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8097 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:10] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:04:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:04:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:04:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:04:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:04:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:04:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 16:04:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:11] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 84/129 variables, 45/156 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 40/196 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 96/292 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 16:04:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:04:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
[2024-05-29 16:04:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:04:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 1/130 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 297 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 113/113 constraints]
After SMT, in 16430ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 16433ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/267 places, 97/4455 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17960 ms. Remains : 45/267 places, 97/4455 transitions.
[2024-05-29 16:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:04:18] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:04:18] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-29 16:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:04:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality7321390038562487893.gal : 1 ms
[2024-05-29 16:04:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3896110163619574575.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/CTLCardinality7321390038562487893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3896110163619574575.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,8219,0.045976,5132,2,446,5,4020,6,0,262,2819,0


Converting to forward existential form...Done !
original formula: E(A((p252==1) U (p296==0)) U ((!((p4==0)||(p10==1)))&&(((p291==0)||(p267==1))||(p222==1))))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((p296==0)) U (!((p252==1)) * !((p296==0)))) + EG(!((p296==0)))))) * ((!((p4==0)||(p10==1)))&&...202
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...326
(forward)formula 0,1,0.289166,12052,1,0,200,25356,213,87,3810,33365,238
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 16:04:19] [INFO ] Flatten gal took : 306 ms
[2024-05-29 16:04:19] [INFO ] Flatten gal took : 255 ms
[2024-05-29 16:04:19] [INFO ] Applying decomposition
[2024-05-29 16:04:19] [INFO ] Flatten gal took : 261 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/graph13223959386878961532.txt' '-o' '/tmp/graph13223959386878961532.bin' '-w' '/tmp/graph13223959386878961532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13223959386878961532.bin' '-l' '-1' '-v' '-w' '/tmp/graph13223959386878961532.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:04:20] [INFO ] Decomposing Gal with order
[2024-05-29 16:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:04:21] [INFO ] Removed a total of 45196 redundant transitions.
[2024-05-29 16:04:21] [INFO ] Flatten gal took : 634 ms
[2024-05-29 16:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 295 ms.
[2024-05-29 16:04:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality190778972650671577.gal : 24 ms
[2024-05-29 16:04:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9619652030416687169.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/CTLCardinality190778972650671577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9619652030416687169.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.5953e+09,24.3603,773216,10119,69,383882,1034,3938,6.56397e+06,95,5134,0


Converting to forward existential form...Done !
original formula: !(A(((i2.u14.p52==0)||(i7.u92.p381==1)) U AX(FALSE)))
=> equivalent forward existential formula: ([(EY((FwdU(Init,!(!(EX(!(FALSE))))) * !(((i2.u14.p52==0)||(i7.u92.p381==1))))) * !(FALSE))] != FALSE + [FwdG(In...188
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t10, t17, t35, t39, t42, t50, t54, t62, t107, t4408, t4413, t4414, t4417, t4423, t442...1110
(forward)formula 0,1,229.732,4279720,1,0,1.06666e+06,1593,21915,2.99306e+07,250,7510,4994991
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((AF((i0.u0.p4==1)) + AF(AG((i2.u13.p64==1)))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!(EG(!((i0.u0.p4==1)))))),!(!(E(TRUE U !((i2.u13.p64==1))))))] = FALSE
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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 1,0,465.305,4279720,1,0,1.6666e+06,1702,57333,2.99306e+07,374,7763,7905952
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AX(AF(((i0.u84.p256==0)&&(i7.u95.p394==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(((i0.u84.p256==0)&&(i7.u95.p394==1)))))))))] != FALSE
(forward)formula 2,0,597.554,4279720,1,0,3.12182e+06,1710,57356,2.99306e+07,375,7800,8491682
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((EF(AX(AG(((i4.i3.i1.u60.p264==0)&&(i2.u14.p51==1))))) + (AG(((i1.u67.p289==0)||(i9.u55.p239==1))) * AX(EF((i0.u24.p79==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(EX(!(!(E(TRUE U !(((i4.i3.i1.u60.p264==0)&&(i2.u14.p51==1))))))))) + (!(E(TRUE U !(((i1...241
(forward)formula 3,0,1336.64,5768364,1,0,3.88354e+06,1929,20917,6.24174e+07,192,8417,2618506
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((EF((AG((((i0.u47.p220==0)||(i4.i1.i1.u33.p153==1))||(i0.u84.p354==1))) * EG(((i4.i2.i0.u22.p91!=0)&&(i4.i4.i0.u81.p345!=1))))) * EF(AX(...255
=> equivalent forward existential formula: [FwdG((Init * (E(TRUE U (!(E(TRUE U !((((i0.u47.p220==0)||(i4.i1.i1.u33.p153==1))||(i0.u84.p354==1))))) * EG(((i...328
(forward)formula 4,0,1363.83,5768364,1,0,3.88354e+06,1929,35234,6.24174e+07,274,8417,5215442
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF((((i2.u13.p57==0) + AX(((i4.i3.i1.u61.p265==0)&&(i2.u12.p49==1)))) + EX(((i2.u16.p61==0)||(i3.u30.p140==1))))) * A(((i3.u27.p121==0)|...199
=> equivalent forward existential formula: [(((Init * E(TRUE U (((i2.u13.p57==0) + !(EX(!(((i4.i3.i1.u61.p265==0)&&(i2.u12.p49==1)))))) + EX(((i2.u16.p61==...320
(forward)formula 5,0,1374.68,5768364,1,0,3.88354e+06,1929,35299,6.24174e+07,276,8417,5315069
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((EG(EF((((i4.i2.i1.u45.p203==0)&&(i9.u59.p251==0))&&(i4.i2.i0.u20.p82==1)))) + ((i9.u51.p244==1) * (EG((i2.u19.p0==1)) + EG(((i2.u8.p3...185
=> equivalent forward existential formula: [((EY(Init) * !(((i9.u51.p244==1) * (EG((i2.u19.p0==1)) + EG(((i2.u8.p38==0)&&(i10.u70.p306==1))))))) * !(EG(E(T...241
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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 6,1,1483.58,6244552,1,0,3.88354e+06,1929,35381,6.71057e+07,276,8417,11299749
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG(((i9.u52.p225==0)||(i2.u75.p322==1))) * A(EG(EX((i7.u94.p387==1))) U EF(!(((i0.u17.p148==0)||(i10.u71.p311==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((i9.u52.p225==0)||(i2.u75.p322==1))))] = FALSE * ([((FwdU(Init,!(E(TRUE U !(((i0.u17.p14...360
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 7,0,1650.02,6349096,1,0,3.88354e+06,1929,22071,6.80964e+07,276,8417,8130639
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(((AX(((i4.i0.i0.u3.p21==1)&&((i4.i4.i0.u81.p345==0)||(i2.u13.p64==1)))) + A(((i4.i1.i0.u35.p159==0)||(i3.u26.p120==1)) U (AF((i2.u19.p...255
=> equivalent forward existential formula: [(EY(((EY(Init) * !(((i4.i2.i2.u43.p199==0)&&(u40.p181==1)))) * !(!((E(!((!(EG(!((i2.u19.p0==0)))) * !(!(E(TRUE ...525
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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 a local 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 8,1,1704.69,6349096,1,0,3.88354e+06,1929,25599,6.80964e+07,284,8417,10697459
FORMULA StigmergyCommit-PT-10a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 3346252 ms.

BK_STOP 1717000368608

--------------------
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="StigmergyCommit-PT-10a"
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 StigmergyCommit-PT-10a, 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 r400-tall-171690531800217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-10a.tgz
mv StigmergyCommit-PT-10a 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 ;