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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 18:01 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 51M 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-09a-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-09a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716994531472

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-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 14:55:32] [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 14:55:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:55:34] [INFO ] Load time of PNML (sax parser for PT used): 2013 ms
[2024-05-29 14:55:34] [INFO ] Transformed 364 places.
[2024-05-29 14:55:35] [INFO ] Transformed 50444 transitions.
[2024-05-29 14:55:35] [INFO ] Found NUPN structural information;
[2024-05-29 14:55:35] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 2481 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 319 transition count 2470
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 319 transition count 2470
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 97 place count 319 transition count 2463
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 107 place count 309 transition count 2452
Iterating global reduction 1 with 10 rules applied. Total rules applied 117 place count 309 transition count 2452
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 309 transition count 2449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 308 transition count 2448
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 308 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 307 transition count 2447
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 307 transition count 2447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 306 transition count 2446
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 306 transition count 2446
Applied a total of 126 rules in 154 ms. Remains 306 /364 variables (removed 58) and now considering 2446/2520 (removed 74) transitions.
[2024-05-29 14:55:35] [INFO ] Flow matrix only has 2426 transitions (discarded 20 similar events)
// Phase 1: matrix 2426 rows 306 cols
[2024-05-29 14:55:35] [INFO ] Computed 6 invariants in 44 ms
[2024-05-29 14:55:36] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-05-29 14:55:36] [INFO ] Flow matrix only has 2426 transitions (discarded 20 similar events)
[2024-05-29 14:55:36] [INFO ] Invariant cache hit.
[2024-05-29 14:55:37] [INFO ] State equation strengthened by 2175 read => feed constraints.
[2024-05-29 14:55:38] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3300 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 305/364 places, 2446/2520 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 296 transition count 2437
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 296 transition count 2437
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 296 transition count 2435
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 291 transition count 2430
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 291 transition count 2430
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 289 transition count 2428
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 289 transition count 2428
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 288 transition count 2427
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 288 transition count 2427
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 287 transition count 2426
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 287 transition count 2426
Applied a total of 38 rules in 69 ms. Remains 287 /305 variables (removed 18) and now considering 2426/2446 (removed 20) transitions.
[2024-05-29 14:55:39] [INFO ] Flow matrix only has 2406 transitions (discarded 20 similar events)
// Phase 1: matrix 2406 rows 287 cols
[2024-05-29 14:55:39] [INFO ] Computed 5 invariants in 12 ms
[2024-05-29 14:55:39] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-29 14:55:39] [INFO ] Flow matrix only has 2406 transitions (discarded 20 similar events)
[2024-05-29 14:55:39] [INFO ] Invariant cache hit.
[2024-05-29 14:55:40] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 14:55:40] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 287/364 places, 2426/2520 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5511 ms. Remains : 287/364 places, 2426/2520 transitions.
Support contains 126 out of 287 places after structural reductions.
[2024-05-29 14:55:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-29 14:55:41] [INFO ] Flatten gal took : 351 ms
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 14:55:41] [INFO ] Flatten gal took : 203 ms
[2024-05-29 14:55:42] [INFO ] Input system was already deterministic with 2426 transitions.
Support contains 102 out of 287 places (down from 126) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 5452 ms. (7 steps per ms) remains 28/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
[2024-05-29 14:55:43] [INFO ] Flow matrix only has 2406 transitions (discarded 20 similar events)
[2024-05-29 14:55:43] [INFO ] Invariant cache hit.
[2024-05-29 14:55:44] [INFO ] State equation strengthened by 2055 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 236/287 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2405/2692 variables, 287/292 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2692 variables, 2054/2346 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2692 variables, 0/2346 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/2693 variables, 1/2347 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2693 variables, 0/2347 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/2693 variables, 0/2347 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2693/2693 variables, and 2347 constraints, problems are : Problem set: 0 solved, 28 unsolved in 4171 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 287/287 constraints, ReadFeed: 2055/2055 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 236/287 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-29 14:55:49] [INFO ] Deduced a trap composed of 16 places in 761 ms of which 25 ms to minimize.
[2024-05-29 14:55:49] [INFO ] Deduced a trap composed of 19 places in 702 ms of which 3 ms to minimize.
[2024-05-29 14:55:50] [INFO ] Deduced a trap composed of 16 places in 733 ms of which 36 ms to minimize.
[2024-05-29 14:55:51] [INFO ] Deduced a trap composed of 14 places in 757 ms of which 2 ms to minimize.
[2024-05-29 14:55:52] [INFO ] Deduced a trap composed of 16 places in 748 ms of which 2 ms to minimize.
[2024-05-29 14:55:52] [INFO ] Deduced a trap composed of 18 places in 626 ms of which 2 ms to minimize.
[2024-05-29 14:55:53] [INFO ] Deduced a trap composed of 18 places in 635 ms of which 3 ms to minimize.
SMT process timed out in 9667ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 51 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Graph (complete) has 658 edges and 287 vertex of which 286 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.29 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 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 286 transition count 2295
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 130 rules applied. Total rules applied 261 place count 181 transition count 2270
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 272 place count 172 transition count 2268
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 3 with 20 rules applied. Total rules applied 292 place count 171 transition count 2249
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 313 place count 153 transition count 2246
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 313 place count 153 transition count 2237
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 331 place count 144 transition count 2237
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 350 place count 125 transition count 2215
Iterating global reduction 5 with 19 rules applied. Total rules applied 369 place count 125 transition count 2215
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 432 place count 125 transition count 2152
Performed 25 Post agglomeration using F-continuation condition with reduction of 1624 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 482 place count 100 transition count 503
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 311 transitions
Reduce isomorphic transitions removed 319 transitions.
Iterating post reduction 6 with 319 rules applied. Total rules applied 801 place count 100 transition count 184
Performed 4 Post agglomeration using F-continuation condition with reduction of 31 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 809 place count 96 transition count 149
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 831 place count 96 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 835 place count 96 transition count 123
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 843 place count 96 transition count 115
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 851 place count 88 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 854 place count 88 transition count 112
Applied a total of 854 rules in 222 ms. Remains 88 /287 variables (removed 199) and now considering 112/2426 (removed 2314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 88/287 places, 112/2426 transitions.
RANDOM walk for 40000 steps (779 resets) in 287 ms. (138 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40003 steps (113 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (138 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (135 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (133 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
// Phase 1: matrix 112 rows 88 cols
[2024-05-29 14:55:53] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:55:53] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/76 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 99/175 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/192 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/200 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 114 constraints, problems are : Problem set: 0 solved, 4 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 88/88 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem AtomicPropp24 is UNSAT
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem AtomicPropp39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 17/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/76 variables, 2/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 99/175 variables, 76/104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 17/192 variables, 6/110 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 17/127 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 2/129 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:55:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 2/131 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Int declared 200/200 variables, and 137 constraints, problems are : Problem set: 4 solved, 0 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 88/88 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 21/21 constraints]
After SMT, in 757ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2024-05-29 14:55:54] [INFO ] Flatten gal took : 156 ms
[2024-05-29 14:55:55] [INFO ] Flatten gal took : 157 ms
[2024-05-29 14:55:55] [INFO ] Input system was already deterministic with 2426 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 232 transition count 2362
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 232 transition count 2362
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 117 place count 232 transition count 2355
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 156 place count 193 transition count 2311
Iterating global reduction 1 with 39 rules applied. Total rules applied 195 place count 193 transition count 2311
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 207 place count 193 transition count 2299
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 228 place count 172 transition count 2278
Iterating global reduction 2 with 21 rules applied. Total rules applied 249 place count 172 transition count 2278
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 264 place count 157 transition count 2263
Iterating global reduction 2 with 15 rules applied. Total rules applied 279 place count 157 transition count 2263
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 293 place count 143 transition count 2249
Iterating global reduction 2 with 14 rules applied. Total rules applied 307 place count 143 transition count 2249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 308 place count 143 transition count 2248
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 319 place count 132 transition count 2237
Iterating global reduction 3 with 11 rules applied. Total rules applied 330 place count 132 transition count 2237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 336 place count 132 transition count 2231
Applied a total of 336 rules in 75 ms. Remains 132 /287 variables (removed 155) and now considering 2231/2426 (removed 195) transitions.
[2024-05-29 14:55:55] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
// Phase 1: matrix 2220 rows 132 cols
[2024-05-29 14:55:55] [INFO ] Computed 1 invariants in 21 ms
[2024-05-29 14:55:56] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-29 14:55:56] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
[2024-05-29 14:55:56] [INFO ] Invariant cache hit.
[2024-05-29 14:55:56] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 14:55:57] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Running 2230 sub problems to find dead transitions.
[2024-05-29 14:55:57] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
[2024-05-29 14:55:57] [INFO ] Invariant cache hit.
[2024-05-29 14:55:57] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 14:56:44] [INFO ] Deduced a trap composed of 13 places in 573 ms of which 2 ms to minimize.
[2024-05-29 14:56:44] [INFO ] Deduced a trap composed of 13 places in 671 ms of which 1 ms to minimize.
[2024-05-29 14:56:45] [INFO ] Deduced a trap composed of 13 places in 680 ms of which 1 ms to minimize.
[2024-05-29 14:56:46] [INFO ] Deduced a trap composed of 13 places in 557 ms of which 1 ms to minimize.
[2024-05-29 14:56:46] [INFO ] Deduced a trap composed of 13 places in 493 ms of which 1 ms to minimize.
[2024-05-29 14:56:47] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 2 ms to minimize.
[2024-05-29 14:56:47] [INFO ] Deduced a trap composed of 14 places in 437 ms of which 9 ms to minimize.
[2024-05-29 14:56:47] [INFO ] Deduced a trap composed of 17 places in 425 ms of which 1 ms to minimize.
[2024-05-29 14:56:48] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 1 ms to minimize.
[2024-05-29 14:56:48] [INFO ] Deduced a trap composed of 17 places in 344 ms of which 1 ms to minimize.
[2024-05-29 14:56:49] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2024-05-29 14:56:49] [INFO ] Deduced a trap composed of 15 places in 355 ms of which 2 ms to minimize.
[2024-05-29 14:56:49] [INFO ] Deduced a trap composed of 15 places in 363 ms of which 1 ms to minimize.
[2024-05-29 14:56:50] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 0 ms to minimize.
[2024-05-29 14:56:50] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
[2024-05-29 14:56:50] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 1 ms to minimize.
[2024-05-29 14:56:51] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 1 ms to minimize.
[2024-05-29 14:56:51] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 1 ms to minimize.
[2024-05-29 14:56:51] [INFO ] Deduced a trap composed of 13 places in 464 ms of which 1 ms to minimize.
[2024-05-29 14:56:52] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 0 ms to minimize.
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 1 ms to minimize.
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 2 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 1 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 1 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 1 ms to minimize.
[2024-05-29 14:56:55] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2024-05-29 14:56:55] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2024-05-29 14:56:55] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 4 ms to minimize.
[2024-05-29 14:56:55] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:56:55] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:56:56] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:56:56] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:56:56] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-05-29 14:56:56] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-05-29 14:56:56] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2024-05-29 14:56:57] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 0 ms to minimize.
[2024-05-29 14:56:57] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2024-05-29 14:56:57] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:56:57] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 132/2352 variables, and 41 constraints, problems are : Problem set: 0 solved, 2230 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/132 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2230/173 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 14:57:08] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2024-05-29 14:57:08] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 1 ms to minimize.
[2024-05-29 14:57:09] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 1 ms to minimize.
[2024-05-29 14:57:09] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 1 ms to minimize.
[2024-05-29 14:57:09] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 0 ms to minimize.
[2024-05-29 14:57:10] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 1 ms to minimize.
[2024-05-29 14:57:10] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2024-05-29 14:57:10] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:57:10] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 0 ms to minimize.
[2024-05-29 14:57:10] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:57:11] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:57:11] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 1 ms to minimize.
[2024-05-29 14:57:11] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 0 ms to minimize.
[2024-05-29 14:57:12] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 1 ms to minimize.
[2024-05-29 14:57:12] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 1 ms to minimize.
[2024-05-29 14:57:12] [INFO ] Deduced a trap composed of 15 places in 414 ms of which 0 ms to minimize.
[2024-05-29 14:57:13] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 0 ms to minimize.
[2024-05-29 14:57:13] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2024-05-29 14:57:13] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:57:14] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 14:57:14] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-29 14:57:15] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:57:15] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:57:15] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 1 ms to minimize.
[2024-05-29 14:57:16] [INFO ] Deduced a trap composed of 17 places in 402 ms of which 0 ms to minimize.
[2024-05-29 14:57:16] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 0 ms to minimize.
[2024-05-29 14:57:16] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 1 ms to minimize.
[2024-05-29 14:57:17] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 0 ms to minimize.
[2024-05-29 14:57:17] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 1 ms to minimize.
[2024-05-29 14:57:17] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:57:17] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2024-05-29 14:57:18] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2024-05-29 14:57:18] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:57:18] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:57:18] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:57:18] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 1 ms to minimize.
[2024-05-29 14:57:19] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 1 ms to minimize.
[2024-05-29 14:57:19] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 0 ms to minimize.
[2024-05-29 14:57:19] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:57:19] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 14:57:22] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:57:22] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:57:22] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:57:22] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:57:22] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:57:22] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:57:23] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 1 ms to minimize.
[2024-05-29 14:57:23] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 0 ms to minimize.
[2024-05-29 14:57:23] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 1 ms to minimize.
[2024-05-29 14:57:23] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2024-05-29 14:57:24] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:57:24] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:57:24] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2024-05-29 14:57:24] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2024-05-29 14:57:24] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:57:25] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:57:25] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 0 ms to minimize.
[2024-05-29 14:57:25] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:57:25] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:57:26] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 14:57:27] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:57:28] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2024-05-29 14:57:28] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:57:28] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:57:28] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:57:28] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:57:28] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:57:28] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:57:29] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:57:29] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:57:29] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:57:29] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:57:30] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2024-05-29 14:57:30] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/2352 variables, and 115 constraints, problems are : Problem set: 0 solved, 2230 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/132 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2057/173 constraints, Known Traps: 114/114 constraints]
After SMT, in 92740ms problems are : Problem set: 0 solved, 2230 unsolved
Search for dead transitions found 0 dead transitions in 92771ms
Starting structural reductions in LTL mode, iteration 1 : 132/287 places, 2231/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95027 ms. Remains : 132/287 places, 2231/2426 transitions.
[2024-05-29 14:57:30] [INFO ] Flatten gal took : 124 ms
[2024-05-29 14:57:30] [INFO ] Flatten gal took : 128 ms
[2024-05-29 14:57:31] [INFO ] Input system was already deterministic with 2231 transitions.
[2024-05-29 14:57:31] [INFO ] Flatten gal took : 119 ms
[2024-05-29 14:57:31] [INFO ] Flatten gal took : 119 ms
[2024-05-29 14:57:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality13627125283744607480.gal : 66 ms
[2024-05-29 14:57:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14807969237221836534.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/CTLCardinality13627125283744607480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14807969237221836534.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 14:58:01] [INFO ] Flatten gal took : 125 ms
[2024-05-29 14:58:01] [INFO ] Applying decomposition
[2024-05-29 14:58:01] [INFO ] Flatten gal took : 126 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/graph1584912313808616478.txt' '-o' '/tmp/graph1584912313808616478.bin' '-w' '/tmp/graph1584912313808616478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1584912313808616478.bin' '-l' '-1' '-v' '-w' '/tmp/graph1584912313808616478.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:58:02] [INFO ] Decomposing Gal with order
[2024-05-29 14:58:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:58:03] [INFO ] Removed a total of 20553 redundant transitions.
[2024-05-29 14:58:03] [INFO ] Flatten gal took : 689 ms
[2024-05-29 14:58:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 212 ms.
[2024-05-29 14:58:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality17122996590835137774.gal : 28 ms
[2024-05-29 14:58:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality763965434800538283.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/CTLCardinality17122996590835137774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality763965434800538283.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.72948e+08,29.1565,864460,7766,34,131560,365,2218,1.07825e+07,61,1501,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 236 transition count 2367
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 236 transition count 2367
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 109 place count 236 transition count 2360
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 142 place count 203 transition count 2323
Iterating global reduction 1 with 33 rules applied. Total rules applied 175 place count 203 transition count 2323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 183 place count 203 transition count 2315
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 202 place count 184 transition count 2296
Iterating global reduction 2 with 19 rules applied. Total rules applied 221 place count 184 transition count 2296
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 235 place count 170 transition count 2282
Iterating global reduction 2 with 14 rules applied. Total rules applied 249 place count 170 transition count 2282
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 261 place count 158 transition count 2270
Iterating global reduction 2 with 12 rules applied. Total rules applied 273 place count 158 transition count 2270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 158 transition count 2269
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 283 place count 149 transition count 2260
Iterating global reduction 3 with 9 rules applied. Total rules applied 292 place count 149 transition count 2260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 298 place count 149 transition count 2254
Applied a total of 298 rules in 67 ms. Remains 149 /287 variables (removed 138) and now considering 2254/2426 (removed 172) transitions.
[2024-05-29 14:58:33] [INFO ] Flow matrix only has 2242 transitions (discarded 12 similar events)
// Phase 1: matrix 2242 rows 149 cols
[2024-05-29 14:58:33] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 14:58:34] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-29 14:58:34] [INFO ] Flow matrix only has 2242 transitions (discarded 12 similar events)
[2024-05-29 14:58:34] [INFO ] Invariant cache hit.
[2024-05-29 14:58:34] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 14:58:35] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
Running 2253 sub problems to find dead transitions.
[2024-05-29 14:58:35] [INFO ] Flow matrix only has 2242 transitions (discarded 12 similar events)
[2024-05-29 14:58:35] [INFO ] Invariant cache hit.
[2024-05-29 14:58:35] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
[2024-05-29 14:59:23] [INFO ] Deduced a trap composed of 15 places in 510 ms of which 4 ms to minimize.
[2024-05-29 14:59:24] [INFO ] Deduced a trap composed of 13 places in 491 ms of which 0 ms to minimize.
[2024-05-29 14:59:24] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 1 ms to minimize.
[2024-05-29 14:59:25] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 1 ms to minimize.
[2024-05-29 14:59:25] [INFO ] Deduced a trap composed of 15 places in 513 ms of which 1 ms to minimize.
[2024-05-29 14:59:26] [INFO ] Deduced a trap composed of 19 places in 491 ms of which 0 ms to minimize.
[2024-05-29 14:59:26] [INFO ] Deduced a trap composed of 13 places in 490 ms of which 1 ms to minimize.
[2024-05-29 14:59:27] [INFO ] Deduced a trap composed of 13 places in 488 ms of which 1 ms to minimize.
[2024-05-29 14:59:27] [INFO ] Deduced a trap composed of 13 places in 594 ms of which 2 ms to minimize.
[2024-05-29 14:59:28] [INFO ] Deduced a trap composed of 13 places in 596 ms of which 1 ms to minimize.
[2024-05-29 14:59:28] [INFO ] Deduced a trap composed of 13 places in 495 ms of which 1 ms to minimize.
[2024-05-29 14:59:29] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2024-05-29 14:59:29] [INFO ] Deduced a trap composed of 15 places in 368 ms of which 1 ms to minimize.
[2024-05-29 14:59:30] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 0 ms to minimize.
[2024-05-29 14:59:30] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-29 14:59:30] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:59:30] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 0 ms to minimize.
[2024-05-29 14:59:31] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 1 ms to minimize.
[2024-05-29 14:59:31] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2024-05-29 14:59:32] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
[2024-05-29 14:59:32] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 0 ms to minimize.
[2024-05-29 14:59:33] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 1 ms to minimize.
[2024-05-29 14:59:33] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 0 ms to minimize.
[2024-05-29 14:59:33] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 1 ms to minimize.
[2024-05-29 14:59:34] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-29 14:59:34] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:59:34] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2024-05-29 14:59:34] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2024-05-29 14:59:34] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:59:35] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 0 ms to minimize.
[2024-05-29 14:59:35] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:59:35] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:59:36] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-05-29 14:59:36] [INFO ] Deduced a trap composed of 13 places in 357 ms of which 1 ms to minimize.
[2024-05-29 14:59:36] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 0 ms to minimize.
[2024-05-29 14:59:37] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:59:37] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 1 ms to minimize.
[2024-05-29 14:59:37] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
[2024-05-29 14:59:38] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 1 ms to minimize.
[2024-05-29 14:59:38] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 149/2391 variables, and 41 constraints, problems are : Problem set: 0 solved, 2253 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/149 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2253/196 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
[2024-05-29 14:59:47] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 0 ms to minimize.
[2024-05-29 14:59:47] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 1 ms to minimize.
[2024-05-29 14:59:47] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 0 ms to minimize.
[2024-05-29 14:59:47] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:59:47] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:59:48] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:59:48] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:59:48] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:59:48] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:59:48] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:59:48] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:59:49] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:59:49] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:59:49] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:59:49] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:59:49] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:59:50] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2024-05-29 14:59:50] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 1 ms to minimize.
[2024-05-29 14:59:50] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:59:50] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
[2024-05-29 14:59:51] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 1 ms to minimize.
[2024-05-29 14:59:51] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 0 ms to minimize.
[2024-05-29 14:59:52] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:59:52] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:59:52] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:59:52] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2024-05-29 14:59:53] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2024-05-29 14:59:53] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:59:53] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:59:53] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-05-29 14:59:53] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:59:53] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:59:53] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:59:53] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:59:54] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:59:54] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2024-05-29 14:59:54] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:59:54] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:59:54] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:59:55] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
[2024-05-29 14:59:56] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:59:56] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:59:56] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 14:59:57] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:59:57] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:59:57] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:59:57] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:59:57] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-29 14:59:57] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 14:59:57] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:59:57] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:59:58] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:59:58] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:59:58] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:59:58] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:59:58] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:59:59] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:59:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:59:59] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:59:59] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
[2024-05-29 15:00:06] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:00:06] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:00:06] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:00:07] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 0 ms to minimize.
[2024-05-29 15:00:07] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-05-29 15:00:07] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-05-29 15:00:07] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 15:00:08] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2024-05-29 15:00:08] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:00:08] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-05-29 15:00:08] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
SMT process timed out in 93007ms, After SMT, problems are : Problem set: 0 solved, 2253 unsolved
Search for dead transitions found 0 dead transitions in 93040ms
Starting structural reductions in LTL mode, iteration 1 : 149/287 places, 2254/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95038 ms. Remains : 149/287 places, 2254/2426 transitions.
[2024-05-29 15:00:08] [INFO ] Flatten gal took : 113 ms
[2024-05-29 15:00:08] [INFO ] Flatten gal took : 122 ms
[2024-05-29 15:00:09] [INFO ] Input system was already deterministic with 2254 transitions.
[2024-05-29 15:00:09] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:00:09] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:00:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality17266016972653057801.gal : 24 ms
[2024-05-29 15:00:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality2377789368083654901.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/CTLCardinality17266016972653057801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2377789368083654901.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:00:39] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:00:39] [INFO ] Applying decomposition
[2024-05-29 15:00:39] [INFO ] Flatten gal took : 117 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/graph4454156165088694804.txt' '-o' '/tmp/graph4454156165088694804.bin' '-w' '/tmp/graph4454156165088694804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4454156165088694804.bin' '-l' '-1' '-v' '-w' '/tmp/graph4454156165088694804.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:00:40] [INFO ] Decomposing Gal with order
[2024-05-29 15:00:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:00:40] [INFO ] Removed a total of 20559 redundant transitions.
[2024-05-29 15:00:40] [INFO ] Flatten gal took : 308 ms
[2024-05-29 15:00:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 146 ms.
[2024-05-29 15:00:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9354777653162100913.gal : 13 ms
[2024-05-29 15:00:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5808938062837006227.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/CTLCardinality9354777653162100913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5808938062837006227.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 : 287/287 places, 2426/2426 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 232 transition count 2362
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 232 transition count 2362
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 117 place count 232 transition count 2355
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 154 place count 195 transition count 2313
Iterating global reduction 1 with 37 rules applied. Total rules applied 191 place count 195 transition count 2313
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 201 place count 195 transition count 2303
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 224 place count 172 transition count 2280
Iterating global reduction 2 with 23 rules applied. Total rules applied 247 place count 172 transition count 2280
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 262 place count 157 transition count 2265
Iterating global reduction 2 with 15 rules applied. Total rules applied 277 place count 157 transition count 2265
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 291 place count 143 transition count 2251
Iterating global reduction 2 with 14 rules applied. Total rules applied 305 place count 143 transition count 2251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 307 place count 143 transition count 2249
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 317 place count 133 transition count 2239
Iterating global reduction 3 with 10 rules applied. Total rules applied 327 place count 133 transition count 2239
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 333 place count 133 transition count 2233
Applied a total of 333 rules in 61 ms. Remains 133 /287 variables (removed 154) and now considering 2233/2426 (removed 193) transitions.
[2024-05-29 15:01:10] [INFO ] Flow matrix only has 2222 transitions (discarded 11 similar events)
// Phase 1: matrix 2222 rows 133 cols
[2024-05-29 15:01:10] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 15:01:11] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-29 15:01:11] [INFO ] Flow matrix only has 2222 transitions (discarded 11 similar events)
[2024-05-29 15:01:11] [INFO ] Invariant cache hit.
[2024-05-29 15:01:12] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:01:12] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
Running 2232 sub problems to find dead transitions.
[2024-05-29 15:01:12] [INFO ] Flow matrix only has 2222 transitions (discarded 11 similar events)
[2024-05-29 15:01:12] [INFO ] Invariant cache hit.
[2024-05-29 15:01:12] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-29 15:01:58] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 1 ms to minimize.
[2024-05-29 15:01:58] [INFO ] Deduced a trap composed of 13 places in 432 ms of which 1 ms to minimize.
[2024-05-29 15:01:58] [INFO ] Deduced a trap composed of 13 places in 427 ms of which 4 ms to minimize.
[2024-05-29 15:01:59] [INFO ] Deduced a trap composed of 13 places in 511 ms of which 1 ms to minimize.
[2024-05-29 15:01:59] [INFO ] Deduced a trap composed of 13 places in 493 ms of which 0 ms to minimize.
[2024-05-29 15:02:00] [INFO ] Deduced a trap composed of 14 places in 483 ms of which 0 ms to minimize.
[2024-05-29 15:02:00] [INFO ] Deduced a trap composed of 13 places in 483 ms of which 1 ms to minimize.
[2024-05-29 15:02:01] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 1 ms to minimize.
[2024-05-29 15:02:01] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 1 ms to minimize.
[2024-05-29 15:02:02] [INFO ] Deduced a trap composed of 13 places in 476 ms of which 1 ms to minimize.
[2024-05-29 15:02:02] [INFO ] Deduced a trap composed of 13 places in 494 ms of which 1 ms to minimize.
[2024-05-29 15:02:03] [INFO ] Deduced a trap composed of 15 places in 480 ms of which 1 ms to minimize.
[2024-05-29 15:02:03] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 1 ms to minimize.
[2024-05-29 15:02:04] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2024-05-29 15:02:04] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 1 ms to minimize.
[2024-05-29 15:02:04] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 0 ms to minimize.
[2024-05-29 15:02:05] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 1 ms to minimize.
[2024-05-29 15:02:05] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-29 15:02:05] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 0 ms to minimize.
[2024-05-29 15:02:06] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-29 15:02:06] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 0 ms to minimize.
[2024-05-29 15:02:07] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 0 ms to minimize.
[2024-05-29 15:02:07] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 1 ms to minimize.
[2024-05-29 15:02:08] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 1 ms to minimize.
[2024-05-29 15:02:08] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:02:08] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 1 ms to minimize.
[2024-05-29 15:02:08] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:02:09] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 ms to minimize.
[2024-05-29 15:02:09] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 0 ms to minimize.
[2024-05-29 15:02:09] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 0 ms to minimize.
[2024-05-29 15:02:09] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2024-05-29 15:02:10] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:02:10] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 1 ms to minimize.
[2024-05-29 15:02:10] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 1 ms to minimize.
[2024-05-29 15:02:11] [INFO ] Deduced a trap composed of 14 places in 412 ms of which 1 ms to minimize.
[2024-05-29 15:02:11] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 0 ms to minimize.
[2024-05-29 15:02:12] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 1 ms to minimize.
[2024-05-29 15:02:12] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 1 ms to minimize.
[2024-05-29 15:02:12] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:02:12] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/2355 variables, and 41 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/133 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2232/175 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-29 15:02:22] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2024-05-29 15:02:22] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 0 ms to minimize.
[2024-05-29 15:02:22] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2024-05-29 15:02:22] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:02:23] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-29 15:02:23] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:02:23] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:02:23] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 1 ms to minimize.
[2024-05-29 15:02:23] [INFO ] Deduced a trap composed of 15 places in 316 ms of which 1 ms to minimize.
[2024-05-29 15:02:24] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 0 ms to minimize.
[2024-05-29 15:02:24] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 1 ms to minimize.
[2024-05-29 15:02:24] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 0 ms to minimize.
[2024-05-29 15:02:24] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 1 ms to minimize.
[2024-05-29 15:02:25] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2024-05-29 15:02:25] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 0 ms to minimize.
[2024-05-29 15:02:25] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 0 ms to minimize.
[2024-05-29 15:02:26] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2024-05-29 15:02:26] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:02:26] [INFO ] Deduced a trap composed of 16 places in 307 ms of which 1 ms to minimize.
[2024-05-29 15:02:26] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-29 15:02:27] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 0 ms to minimize.
[2024-05-29 15:02:27] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 1 ms to minimize.
[2024-05-29 15:02:28] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2024-05-29 15:02:28] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:02:28] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:02:28] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 1 ms to minimize.
[2024-05-29 15:02:28] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 0 ms to minimize.
[2024-05-29 15:02:29] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 0 ms to minimize.
[2024-05-29 15:02:29] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2024-05-29 15:02:29] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:02:29] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-29 15:02:29] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:02:29] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-29 15:02:29] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 1 ms to minimize.
[2024-05-29 15:02:30] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:02:30] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 0 ms to minimize.
[2024-05-29 15:02:30] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2024-05-29 15:02:30] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2024-05-29 15:02:30] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:02:31] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-29 15:02:31] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:02:32] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:02:32] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:02:32] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2024-05-29 15:02:32] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 15:02:32] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 1 ms to minimize.
[2024-05-29 15:02:33] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2024-05-29 15:02:33] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 15:02:33] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 15:02:33] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2024-05-29 15:02:33] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:02:33] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:02:34] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:02:34] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2024-05-29 15:02:34] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:02:35] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2024-05-29 15:02:35] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 15:02:36] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2024-05-29 15:02:36] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 1 ms to minimize.
[2024-05-29 15:02:37] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-29 15:02:42] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:02:42] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2024-05-29 15:02:42] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:02:43] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 15:02:43] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-05-29 15:02:44] [INFO ] Deduced a trap composed of 16 places in 415 ms of which 1 ms to minimize.
[2024-05-29 15:02:44] [INFO ] Deduced a trap composed of 16 places in 409 ms of which 1 ms to minimize.
[2024-05-29 15:02:44] [INFO ] Deduced a trap composed of 16 places in 407 ms of which 0 ms to minimize.
SMT process timed out in 92019ms, After SMT, problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 92042ms
Starting structural reductions in LTL mode, iteration 1 : 133/287 places, 2233/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93987 ms. Remains : 133/287 places, 2233/2426 transitions.
[2024-05-29 15:02:45] [INFO ] Flatten gal took : 122 ms
[2024-05-29 15:02:45] [INFO ] Flatten gal took : 134 ms
[2024-05-29 15:02:45] [INFO ] Input system was already deterministic with 2233 transitions.
[2024-05-29 15:02:45] [INFO ] Flatten gal took : 116 ms
[2024-05-29 15:02:45] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:02:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality7926029078376198802.gal : 25 ms
[2024-05-29 15:02:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality4697747719888340508.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/CTLCardinality7926029078376198802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4697747719888340508.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:03:15] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:03:15] [INFO ] Applying decomposition
[2024-05-29 15:03:16] [INFO ] Flatten gal took : 118 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/graph7911014965066007780.txt' '-o' '/tmp/graph7911014965066007780.bin' '-w' '/tmp/graph7911014965066007780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7911014965066007780.bin' '-l' '-1' '-v' '-w' '/tmp/graph7911014965066007780.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:03:16] [INFO ] Decomposing Gal with order
[2024-05-29 15:03:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:03:16] [INFO ] Removed a total of 20553 redundant transitions.
[2024-05-29 15:03:16] [INFO ] Flatten gal took : 276 ms
[2024-05-29 15:03:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 95 ms.
[2024-05-29 15:03:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality570831577220911609.gal : 14 ms
[2024-05-29 15:03:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality18280782340973673798.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/CTLCardinality570831577220911609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18280782340973673798.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 : 287/287 places, 2426/2426 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 240 transition count 2370
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 240 transition count 2370
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 100 place count 240 transition count 2364
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 131 place count 209 transition count 2328
Iterating global reduction 1 with 31 rules applied. Total rules applied 162 place count 209 transition count 2328
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 170 place count 209 transition count 2320
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 189 place count 190 transition count 2301
Iterating global reduction 2 with 19 rules applied. Total rules applied 208 place count 190 transition count 2301
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 219 place count 179 transition count 2290
Iterating global reduction 2 with 11 rules applied. Total rules applied 230 place count 179 transition count 2290
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 240 place count 169 transition count 2280
Iterating global reduction 2 with 10 rules applied. Total rules applied 250 place count 169 transition count 2280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 252 place count 169 transition count 2278
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 259 place count 162 transition count 2271
Iterating global reduction 3 with 7 rules applied. Total rules applied 266 place count 162 transition count 2271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 270 place count 162 transition count 2267
Applied a total of 270 rules in 58 ms. Remains 162 /287 variables (removed 125) and now considering 2267/2426 (removed 159) transitions.
[2024-05-29 15:03:47] [INFO ] Flow matrix only has 2254 transitions (discarded 13 similar events)
// Phase 1: matrix 2254 rows 162 cols
[2024-05-29 15:03:47] [INFO ] Computed 3 invariants in 14 ms
[2024-05-29 15:03:47] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-29 15:03:47] [INFO ] Flow matrix only has 2254 transitions (discarded 13 similar events)
[2024-05-29 15:03:47] [INFO ] Invariant cache hit.
[2024-05-29 15:03:48] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:03:48] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
Running 2266 sub problems to find dead transitions.
[2024-05-29 15:03:48] [INFO ] Flow matrix only has 2254 transitions (discarded 13 similar events)
[2024-05-29 15:03:48] [INFO ] Invariant cache hit.
[2024-05-29 15:03:49] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2024-05-29 15:04:37] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 1 ms to minimize.
[2024-05-29 15:04:37] [INFO ] Deduced a trap composed of 15 places in 433 ms of which 1 ms to minimize.
[2024-05-29 15:04:38] [INFO ] Deduced a trap composed of 13 places in 479 ms of which 1 ms to minimize.
[2024-05-29 15:04:38] [INFO ] Deduced a trap composed of 13 places in 557 ms of which 1 ms to minimize.
[2024-05-29 15:04:39] [INFO ] Deduced a trap composed of 17 places in 480 ms of which 1 ms to minimize.
[2024-05-29 15:04:39] [INFO ] Deduced a trap composed of 14 places in 552 ms of which 1 ms to minimize.
[2024-05-29 15:04:40] [INFO ] Deduced a trap composed of 14 places in 568 ms of which 1 ms to minimize.
[2024-05-29 15:04:40] [INFO ] Deduced a trap composed of 13 places in 658 ms of which 1 ms to minimize.
[2024-05-29 15:04:41] [INFO ] Deduced a trap composed of 15 places in 522 ms of which 1 ms to minimize.
[2024-05-29 15:04:42] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 1 ms to minimize.
[2024-05-29 15:04:42] [INFO ] Deduced a trap composed of 15 places in 570 ms of which 2 ms to minimize.
[2024-05-29 15:04:43] [INFO ] Deduced a trap composed of 19 places in 478 ms of which 1 ms to minimize.
[2024-05-29 15:04:43] [INFO ] Deduced a trap composed of 14 places in 479 ms of which 1 ms to minimize.
[2024-05-29 15:04:44] [INFO ] Deduced a trap composed of 14 places in 483 ms of which 1 ms to minimize.
[2024-05-29 15:04:44] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2024-05-29 15:04:45] [INFO ] Deduced a trap composed of 13 places in 675 ms of which 1 ms to minimize.
[2024-05-29 15:04:45] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 1 ms to minimize.
[2024-05-29 15:04:46] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2024-05-29 15:04:46] [INFO ] Deduced a trap composed of 13 places in 544 ms of which 1 ms to minimize.
[2024-05-29 15:04:47] [INFO ] Deduced a trap composed of 13 places in 460 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2024-05-29 15:04:47] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 1 ms to minimize.
[2024-05-29 15:04:48] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 1 ms to minimize.
[2024-05-29 15:04:48] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 0 ms to minimize.
[2024-05-29 15:04:48] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:04:48] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:04:49] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 1 ms to minimize.
[2024-05-29 15:04:49] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:04:49] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 1 ms to minimize.
[2024-05-29 15:04:49] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:04:49] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 0 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 1 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 0 ms to minimize.
[2024-05-29 15:04:51] [INFO ] Deduced a trap composed of 14 places in 434 ms of which 1 ms to minimize.
SMT process timed out in 62387ms, After SMT, problems are : Problem set: 0 solved, 2266 unsolved
Search for dead transitions found 0 dead transitions in 62410ms
Starting structural reductions in LTL mode, iteration 1 : 162/287 places, 2267/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64312 ms. Remains : 162/287 places, 2267/2426 transitions.
[2024-05-29 15:04:51] [INFO ] Flatten gal took : 111 ms
[2024-05-29 15:04:51] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:04:51] [INFO ] Input system was already deterministic with 2267 transitions.
[2024-05-29 15:04:51] [INFO ] Flatten gal took : 115 ms
[2024-05-29 15:04:52] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:04:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8559649214383241530.gal : 25 ms
[2024-05-29 15:04:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality5438539609770855923.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/CTLCardinality8559649214383241530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5438539609770855923.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:05:22] [INFO ] Flatten gal took : 121 ms
[2024-05-29 15:05:22] [INFO ] Applying decomposition
[2024-05-29 15:05:22] [INFO ] Flatten gal took : 121 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/graph5299639068794357832.txt' '-o' '/tmp/graph5299639068794357832.bin' '-w' '/tmp/graph5299639068794357832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5299639068794357832.bin' '-l' '-1' '-v' '-w' '/tmp/graph5299639068794357832.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:05:22] [INFO ] Decomposing Gal with order
[2024-05-29 15:05:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:05:23] [INFO ] Removed a total of 20565 redundant transitions.
[2024-05-29 15:05:23] [INFO ] Flatten gal took : 296 ms
[2024-05-29 15:05:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 106 ms.
[2024-05-29 15:05:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality13664484340800227020.gal : 11 ms
[2024-05-29 15:05:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12775136451218588072.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/CTLCardinality13664484340800227020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12775136451218588072.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 SI_CTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 286 transition count 2256
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 199 rules applied. Total rules applied 368 place count 117 transition count 2226
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 11 rules applied. Total rules applied 379 place count 113 transition count 2219
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 386 place count 110 transition count 2215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 388 place count 108 transition count 2215
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 18 Pre rules applied. Total rules applied 388 place count 108 transition count 2197
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 424 place count 90 transition count 2197
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 437 place count 77 transition count 2176
Iterating global reduction 5 with 13 rules applied. Total rules applied 450 place count 77 transition count 2176
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 481 place count 77 transition count 2145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 481 place count 77 transition count 2144
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 483 place count 76 transition count 2144
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 487 place count 72 transition count 2136
Iterating global reduction 6 with 4 rules applied. Total rules applied 491 place count 72 transition count 2136
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Iterating post reduction 6 with 480 rules applied. Total rules applied 971 place count 72 transition count 1656
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 997 place count 59 transition count 1643
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1010 place count 59 transition count 1630
Drop transitions (Redundant composition of simpler transitions.) removed 1450 transitions
Redundant transition composition rules discarded 1450 transitions
Iterating global reduction 8 with 1450 rules applied. Total rules applied 2460 place count 59 transition count 180
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 2480 place count 49 transition count 170
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 2490 place count 39 transition count 160
Applied a total of 2490 rules in 554 ms. Remains 39 /287 variables (removed 248) and now considering 160/2426 (removed 2266) transitions.
[2024-05-29 15:05:53] [INFO ] Flow matrix only has 149 transitions (discarded 11 similar events)
// Phase 1: matrix 149 rows 39 cols
[2024-05-29 15:05:53] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 15:05:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 15:05:53] [INFO ] Flow matrix only has 149 transitions (discarded 11 similar events)
[2024-05-29 15:05:53] [INFO ] Invariant cache hit.
[2024-05-29 15:05:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 15:05:54] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-29 15:05:54] [INFO ] Redundant transitions in 6 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 15:05:54] [INFO ] Flow matrix only has 149 transitions (discarded 11 similar events)
[2024-05-29 15:05:54] [INFO ] Invariant cache hit.
[2024-05-29 15:05:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 10/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:05:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 15:05:55] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 148/187 variables, 39/114 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:05:58] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 1/188 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 139 constraints, problems are : Problem set: 0 solved, 54 unsolved in 6013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 10/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 15:06:00] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 148/187 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 54/194 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 15:06:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/188 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 196 constraints, problems are : Problem set: 0 solved, 54 unsolved in 4102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 101/101 constraints]
After SMT, in 10141ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 10143ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/287 places, 160/2426 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10854 ms. Remains : 39/287 places, 160/2426 transitions.
[2024-05-29 15:06:04] [INFO ] Flatten gal took : 11 ms
[2024-05-29 15:06:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 15:06:04] [INFO ] Input system was already deterministic with 160 transitions.
Support contains 1 out of 39 places (down from 4) after GAL structural reductions.
[2024-05-29 15:06:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 15:06:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 15:06:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality7624413891055866642.gal : 2 ms
[2024-05-29 15:06:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality6713178370161702360.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/CTLCardinality7624413891055866642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6713178370161702360.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,2074,0.07962,7076,2,294,5,4816,6,0,305,2633,0


Converting to forward existential form...Done !
original formula: EG((p124==0))
=> equivalent forward existential formula: [FwdG(Init,(p124==0))] != FALSE
Hit Full ! (commute/partial/dont) 158/0/2
(forward)formula 0,1,0.164465,7076,1,0,7,9946,19,2,5147,5148,8
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 286 transition count 2250
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 207 rules applied. Total rules applied 382 place count 111 transition count 2218
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 11 rules applied. Total rules applied 393 place count 107 transition count 2211
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 399 place count 104 transition count 2208
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 399 place count 104 transition count 2189
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 437 place count 85 transition count 2189
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 451 place count 71 transition count 2166
Iterating global reduction 4 with 14 rules applied. Total rules applied 465 place count 71 transition count 2166
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 496 place count 71 transition count 2135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 496 place count 71 transition count 2134
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 498 place count 70 transition count 2134
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 503 place count 65 transition count 2124
Iterating global reduction 5 with 5 rules applied. Total rules applied 508 place count 65 transition count 2124
Ensure Unique test removed 992 transitions
Reduce isomorphic transitions removed 992 transitions.
Iterating post reduction 5 with 992 rules applied. Total rules applied 1500 place count 65 transition count 1132
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1526 place count 52 transition count 1119
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1539 place count 52 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 1002 transitions
Redundant transition composition rules discarded 1002 transitions
Iterating global reduction 7 with 1002 rules applied. Total rules applied 2541 place count 52 transition count 104
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2561 place count 42 transition count 94
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 2570 place count 33 transition count 85
Applied a total of 2570 rules in 225 ms. Remains 33 /287 variables (removed 254) and now considering 85/2426 (removed 2341) transitions.
[2024-05-29 15:06:04] [INFO ] Flow matrix only has 75 transitions (discarded 10 similar events)
// Phase 1: matrix 75 rows 33 cols
[2024-05-29 15:06:04] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 15:06:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 15:06:04] [INFO ] Flow matrix only has 75 transitions (discarded 10 similar events)
[2024-05-29 15:06:04] [INFO ] Invariant cache hit.
[2024-05-29 15:06:04] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-29 15:06:04] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-29 15:06:04] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-29 15:06:04] [INFO ] Flow matrix only has 75 transitions (discarded 10 similar events)
[2024-05-29 15:06:04] [INFO ] Invariant cache hit.
[2024-05-29 15:06:04] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:06:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:06:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:06:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:06:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:06:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:06:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 74/107 variables, 33/129 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 25/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 15 (OVERLAPS) 1/108 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 17 (OVERLAPS) 0/108 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 156 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 74/107 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 25/160 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 84/244 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 1/108 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 0/108 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 245 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 101/101 constraints]
After SMT, in 9394ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 9395ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/287 places, 85/2426 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9723 ms. Remains : 33/287 places, 85/2426 transitions.
[2024-05-29 15:06:14] [INFO ] Flatten gal took : 14 ms
[2024-05-29 15:06:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 15:06:14] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-29 15:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 15:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 15:06:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality280069536656519191.gal : 1 ms
[2024-05-29 15:06:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality7400319595105583027.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/CTLCardinality280069536656519191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7400319595105583027.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,1046,0.034582,4916,2,228,5,2510,6,0,206,1523,0


Converting to forward existential form...Done !
original formula: AG(EF((p355==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p355==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...305
(forward)formula 0,0,0.10073,5500,1,0,147,7603,180,48,3308,5979,168
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 154 place count 286 transition count 2271
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 178 rules applied. Total rules applied 332 place count 132 transition count 2247
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 340 place count 129 transition count 2242
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 351 place count 127 transition count 2233
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 360 place count 120 transition count 2231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 363 place count 119 transition count 2229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 365 place count 118 transition count 2228
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 365 place count 118 transition count 2208
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 405 place count 98 transition count 2208
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 418 place count 85 transition count 2187
Iterating global reduction 7 with 13 rules applied. Total rules applied 431 place count 85 transition count 2187
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 462 place count 85 transition count 2156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 462 place count 85 transition count 2155
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 464 place count 84 transition count 2155
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 468 place count 80 transition count 2147
Iterating global reduction 8 with 4 rules applied. Total rules applied 472 place count 80 transition count 2147
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Iterating post reduction 8 with 480 rules applied. Total rules applied 952 place count 80 transition count 1667
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 978 place count 67 transition count 1654
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 990 place count 67 transition count 1642
Drop transitions (Redundant composition of simpler transitions.) removed 1498 transitions
Redundant transition composition rules discarded 1498 transitions
Iterating global reduction 10 with 1498 rules applied. Total rules applied 2488 place count 67 transition count 144
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 2508 place count 57 transition count 134
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2512 place count 57 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2513 place count 57 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2514 place count 57 transition count 132
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2522 place count 49 transition count 124
Applied a total of 2522 rules in 331 ms. Remains 49 /287 variables (removed 238) and now considering 124/2426 (removed 2302) transitions.
[2024-05-29 15:06:14] [INFO ] Flow matrix only has 113 transitions (discarded 11 similar events)
// Phase 1: matrix 113 rows 49 cols
[2024-05-29 15:06:14] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 15:06:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 15:06:14] [INFO ] Flow matrix only has 113 transitions (discarded 11 similar events)
[2024-05-29 15:06:14] [INFO ] Invariant cache hit.
[2024-05-29 15:06:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 15:06:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-29 15:06:14] [INFO ] Redundant transitions in 3 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-29 15:06:14] [INFO ] Flow matrix only has 113 transitions (discarded 11 similar events)
[2024-05-29 15:06:14] [INFO ] Invariant cache hit.
[2024-05-29 15:06:14] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 2/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 26 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, 122 unsolved
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 15:06:16] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:06:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:06:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:06:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:06:19] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:06:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:06:19] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:06:19] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 112/161 variables, 49/147 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 48/195 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:20] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (OVERLAPS) 1/162 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/162 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 197 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 2/49 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:06:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 112/161 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 48/198 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 122/320 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 1/162 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 15:06:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 322 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7998 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 101/101 constraints]
After SMT, in 16100ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 16102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/287 places, 124/2426 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16555 ms. Remains : 49/287 places, 124/2426 transitions.
[2024-05-29 15:06:30] [INFO ] Flatten gal took : 8 ms
[2024-05-29 15:06:30] [INFO ] Flatten gal took : 4 ms
[2024-05-29 15:06:30] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-29 15:06:30] [INFO ] Flatten gal took : 5 ms
[2024-05-29 15:06:30] [INFO ] Flatten gal took : 5 ms
[2024-05-29 15:06:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality12308123292445001077.gal : 1 ms
[2024-05-29 15:06:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1512630989669080748.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/CTLCardinality12308123292445001077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1512630989669080748.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2088,0.071098,5636,2,524,5,4284,6,0,307,2831,0


Converting to forward existential form...Done !
original formula: E((EG((((p137==0)||(p236==1))&&((p337==0)||(p163==1)))) * (((p18==1)||(p356==0))||(((p31==0)||(p109==1))&&((p137==0)||(!((p91==0)||(p308=...176
=> equivalent forward existential formula: [(FwdU(Init,(EG((((p137==0)||(p236==1))&&((p337==0)||(p163==1)))) * (((p18==1)||(p356==0))||(((p31==0)||(p109==1...222
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, t21, t25...336
(forward)formula 0,1,0.398115,13612,1,0,237,25222,264,96,4898,27472,296
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 235 transition count 2365
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 235 transition count 2365
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 111 place count 235 transition count 2358
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 148 place count 198 transition count 2316
Iterating global reduction 1 with 37 rules applied. Total rules applied 185 place count 198 transition count 2316
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 196 place count 198 transition count 2305
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 216 place count 178 transition count 2285
Iterating global reduction 2 with 20 rules applied. Total rules applied 236 place count 178 transition count 2285
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 251 place count 163 transition count 2270
Iterating global reduction 2 with 15 rules applied. Total rules applied 266 place count 163 transition count 2270
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 279 place count 150 transition count 2257
Iterating global reduction 2 with 13 rules applied. Total rules applied 292 place count 150 transition count 2257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 150 transition count 2256
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 304 place count 139 transition count 2245
Iterating global reduction 3 with 11 rules applied. Total rules applied 315 place count 139 transition count 2245
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 321 place count 139 transition count 2239
Applied a total of 321 rules in 52 ms. Remains 139 /287 variables (removed 148) and now considering 2239/2426 (removed 187) transitions.
[2024-05-29 15:06:31] [INFO ] Flow matrix only has 2227 transitions (discarded 12 similar events)
// Phase 1: matrix 2227 rows 139 cols
[2024-05-29 15:06:31] [INFO ] Computed 2 invariants in 16 ms
[2024-05-29 15:06:31] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-29 15:06:31] [INFO ] Flow matrix only has 2227 transitions (discarded 12 similar events)
[2024-05-29 15:06:31] [INFO ] Invariant cache hit.
[2024-05-29 15:06:32] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:06:33] [INFO ] Implicit Places using invariants and state equation in 1370 ms returned []
Implicit Place search using SMT with State Equation took 1945 ms to find 0 implicit places.
Running 2238 sub problems to find dead transitions.
[2024-05-29 15:06:33] [INFO ] Flow matrix only has 2227 transitions (discarded 12 similar events)
[2024-05-29 15:06:33] [INFO ] Invariant cache hit.
[2024-05-29 15:06:33] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-29 15:07:20] [INFO ] Deduced a trap composed of 13 places in 511 ms of which 1 ms to minimize.
[2024-05-29 15:07:21] [INFO ] Deduced a trap composed of 13 places in 622 ms of which 1 ms to minimize.
[2024-05-29 15:07:21] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 1 ms to minimize.
[2024-05-29 15:07:22] [INFO ] Deduced a trap composed of 13 places in 506 ms of which 1 ms to minimize.
[2024-05-29 15:07:22] [INFO ] Deduced a trap composed of 13 places in 638 ms of which 1 ms to minimize.
[2024-05-29 15:07:23] [INFO ] Deduced a trap composed of 13 places in 625 ms of which 1 ms to minimize.
[2024-05-29 15:07:23] [INFO ] Deduced a trap composed of 15 places in 650 ms of which 1 ms to minimize.
[2024-05-29 15:07:24] [INFO ] Deduced a trap composed of 13 places in 516 ms of which 1 ms to minimize.
[2024-05-29 15:07:25] [INFO ] Deduced a trap composed of 13 places in 520 ms of which 0 ms to minimize.
[2024-05-29 15:07:25] [INFO ] Deduced a trap composed of 13 places in 529 ms of which 0 ms to minimize.
[2024-05-29 15:07:26] [INFO ] Deduced a trap composed of 13 places in 511 ms of which 1 ms to minimize.
[2024-05-29 15:07:26] [INFO ] Deduced a trap composed of 18 places in 430 ms of which 1 ms to minimize.
[2024-05-29 15:07:26] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 0 ms to minimize.
[2024-05-29 15:07:27] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 1 ms to minimize.
[2024-05-29 15:07:27] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 0 ms to minimize.
[2024-05-29 15:07:28] [INFO ] Deduced a trap composed of 13 places in 511 ms of which 1 ms to minimize.
[2024-05-29 15:07:28] [INFO ] Deduced a trap composed of 15 places in 420 ms of which 0 ms to minimize.
[2024-05-29 15:07:28] [INFO ] Deduced a trap composed of 15 places in 360 ms of which 0 ms to minimize.
[2024-05-29 15:07:29] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 0 ms to minimize.
[2024-05-29 15:07:29] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-29 15:07:30] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2024-05-29 15:07:30] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-05-29 15:07:30] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 5 ms to minimize.
[2024-05-29 15:07:30] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:07:31] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:07:31] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2024-05-29 15:07:31] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:07:31] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:07:31] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2024-05-29 15:07:32] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 1 ms to minimize.
[2024-05-29 15:07:32] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 0 ms to minimize.
[2024-05-29 15:07:32] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 1 ms to minimize.
[2024-05-29 15:07:33] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 0 ms to minimize.
[2024-05-29 15:07:33] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2024-05-29 15:07:33] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 1 ms to minimize.
[2024-05-29 15:07:33] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 0 ms to minimize.
[2024-05-29 15:07:34] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2024-05-29 15:07:34] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 0 ms to minimize.
[2024-05-29 15:07:34] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 1 ms to minimize.
[2024-05-29 15:07:34] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 139/2366 variables, and 42 constraints, problems are : Problem set: 0 solved, 2238 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/139 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2238/181 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-29 15:07:44] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:07:44] [INFO ] Deduced a trap composed of 16 places in 477 ms of which 1 ms to minimize.
[2024-05-29 15:07:45] [INFO ] Deduced a trap composed of 17 places in 426 ms of which 1 ms to minimize.
[2024-05-29 15:07:45] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2024-05-29 15:07:46] [INFO ] Deduced a trap composed of 16 places in 364 ms of which 1 ms to minimize.
[2024-05-29 15:07:46] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 1 ms to minimize.
[2024-05-29 15:07:46] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-29 15:07:46] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 0 ms to minimize.
[2024-05-29 15:07:47] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2024-05-29 15:07:47] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 1 ms to minimize.
[2024-05-29 15:07:47] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 15:07:48] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2024-05-29 15:07:48] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2024-05-29 15:07:48] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2024-05-29 15:07:48] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 0 ms to minimize.
[2024-05-29 15:07:49] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 1 ms to minimize.
[2024-05-29 15:07:49] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 1 ms to minimize.
[2024-05-29 15:07:49] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 15:07:49] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2024-05-29 15:07:50] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-29 15:07:51] [INFO ] Deduced a trap composed of 16 places in 521 ms of which 1 ms to minimize.
[2024-05-29 15:07:51] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 15:07:51] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 15:07:51] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:07:52] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:07:52] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:07:52] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 1 ms to minimize.
[2024-05-29 15:07:52] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2024-05-29 15:07:52] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-29 15:07:53] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2024-05-29 15:07:53] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2024-05-29 15:07:53] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2024-05-29 15:07:53] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:07:53] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2024-05-29 15:07:54] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 1 ms to minimize.
[2024-05-29 15:07:54] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 0 ms to minimize.
[2024-05-29 15:07:54] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:07:54] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 0 ms to minimize.
[2024-05-29 15:07:55] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 0 ms to minimize.
[2024-05-29 15:07:55] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-29 15:07:56] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:07:57] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 0 ms to minimize.
[2024-05-29 15:07:57] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-05-29 15:07:57] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:07:57] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:07:57] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:07:57] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:07:58] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2024-05-29 15:07:58] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2024-05-29 15:07:58] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
[2024-05-29 15:07:58] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:07:58] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:07:59] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2024-05-29 15:07:59] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:07:59] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:07:59] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:07:59] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:08:00] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2024-05-29 15:08:00] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:08:00] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-29 15:08:03] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:08:03] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:08:03] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2024-05-29 15:08:03] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2024-05-29 15:08:03] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:08:03] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:08:04] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 15:08:04] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2024-05-29 15:08:04] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:08:04] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:08:05] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2024-05-29 15:08:05] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:08:05] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 1 ms to minimize.
[2024-05-29 15:08:05] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-05-29 15:08:05] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:08:05] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:08:06] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:08:06] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
SMT process timed out in 93085ms, After SMT, problems are : Problem set: 0 solved, 2238 unsolved
Search for dead transitions found 0 dead transitions in 93109ms
Starting structural reductions in LTL mode, iteration 1 : 139/287 places, 2239/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95120 ms. Remains : 139/287 places, 2239/2426 transitions.
[2024-05-29 15:08:06] [INFO ] Flatten gal took : 109 ms
[2024-05-29 15:08:06] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:08:06] [INFO ] Input system was already deterministic with 2239 transitions.
[2024-05-29 15:08:07] [INFO ] Flatten gal took : 116 ms
[2024-05-29 15:08:07] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:08:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5130581256170492088.gal : 24 ms
[2024-05-29 15:08:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality7826187154133458412.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/CTLCardinality5130581256170492088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7826187154133458412.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:08:37] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:08:37] [INFO ] Applying decomposition
[2024-05-29 15:08:37] [INFO ] Flatten gal took : 116 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/graph1515808576759160175.txt' '-o' '/tmp/graph1515808576759160175.bin' '-w' '/tmp/graph1515808576759160175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1515808576759160175.bin' '-l' '-1' '-v' '-w' '/tmp/graph1515808576759160175.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:08:37] [INFO ] Decomposing Gal with order
[2024-05-29 15:08:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:08:38] [INFO ] Removed a total of 20557 redundant transitions.
[2024-05-29 15:08:38] [INFO ] Flatten gal took : 268 ms
[2024-05-29 15:08:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 87 ms.
[2024-05-29 15:08:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality14370156586474902572.gal : 14 ms
[2024-05-29 15:08:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality17996067808926074893.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/CTLCardinality14370156586474902572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17996067808926074893.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.7321e+08,15.5269,238832,5467,34,184046,441,2500,1.73943e+06,56,1454,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 167 place count 286 transition count 2258
Reduce places removed 167 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 193 rules applied. Total rules applied 360 place count 119 transition count 2232
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 369 place count 116 transition count 2226
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 375 place count 113 transition count 2223
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 375 place count 113 transition count 2205
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 411 place count 95 transition count 2205
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 430 place count 76 transition count 2178
Iterating global reduction 4 with 19 rules applied. Total rules applied 449 place count 76 transition count 2178
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 469 place count 76 transition count 2158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 469 place count 76 transition count 2157
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 471 place count 75 transition count 2157
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 476 place count 70 transition count 2147
Iterating global reduction 5 with 5 rules applied. Total rules applied 481 place count 70 transition count 2147
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 5 with 240 rules applied. Total rules applied 721 place count 70 transition count 1907
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 747 place count 57 transition count 1894
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 760 place count 57 transition count 1881
Drop transitions (Redundant composition of simpler transitions.) removed 1723 transitions
Redundant transition composition rules discarded 1723 transitions
Iterating global reduction 7 with 1723 rules applied. Total rules applied 2483 place count 57 transition count 158
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2503 place count 47 transition count 148
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 2512 place count 38 transition count 139
Applied a total of 2512 rules in 365 ms. Remains 38 /287 variables (removed 249) and now considering 139/2426 (removed 2287) transitions.
[2024-05-29 15:09:08] [INFO ] Flow matrix only has 129 transitions (discarded 10 similar events)
// Phase 1: matrix 129 rows 38 cols
[2024-05-29 15:09:08] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 15:09:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 15:09:08] [INFO ] Flow matrix only has 129 transitions (discarded 10 similar events)
[2024-05-29 15:09:08] [INFO ] Invariant cache hit.
[2024-05-29 15:09:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-29 15:09:08] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-29 15:09:08] [INFO ] Redundant transitions in 5 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-29 15:09:08] [INFO ] Flow matrix only has 129 transitions (discarded 10 similar events)
[2024-05-29 15:09:08] [INFO ] Invariant cache hit.
[2024-05-29 15:09:08] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 128/166 variables, 38/119 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 49/168 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 15:09:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:09:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 1/167 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 14 (OVERLAPS) 0/167 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 171 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6762 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 128/166 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 49/190 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 138/328 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 1/167 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (OVERLAPS) 0/167 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 329 constraints, problems are : Problem set: 0 solved, 138 unsolved in 11083 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 102/102 constraints]
After SMT, in 18050ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 18053ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/287 places, 139/2426 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18563 ms. Remains : 38/287 places, 139/2426 transitions.
[2024-05-29 15:09:26] [INFO ] Flatten gal took : 9 ms
[2024-05-29 15:09:26] [INFO ] Flatten gal took : 6 ms
[2024-05-29 15:09:26] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-29 15:09:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 15:09:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 15:09:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality17948051320991681561.gal : 3 ms
[2024-05-29 15:09:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11952780559111970308.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/CTLCardinality17948051320991681561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11952780559111970308.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,4119,0.071047,6540,2,311,5,3617,6,0,281,2327,0


Converting to forward existential form...Done !
original formula: AG(EF(((A((p166==1) U (p166==0)) * (p291==1)) * ((p30==0)||(p326==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!((E(!((p166==0)) U (!((p166==1)) * !((p166==0)))) + EG(!((p166==0))))) * (p291...197
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...308
(forward)formula 0,0,0.401533,13724,1,0,232,27526,301,77,5550,23588,337
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 236 transition count 2368
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 236 transition count 2368
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 236 transition count 2362
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 141 place count 203 transition count 2326
Iterating global reduction 1 with 33 rules applied. Total rules applied 174 place count 203 transition count 2326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 186 place count 203 transition count 2314
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 204 place count 185 transition count 2296
Iterating global reduction 2 with 18 rules applied. Total rules applied 222 place count 185 transition count 2296
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 234 place count 173 transition count 2284
Iterating global reduction 2 with 12 rules applied. Total rules applied 246 place count 173 transition count 2284
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 258 place count 161 transition count 2272
Iterating global reduction 2 with 12 rules applied. Total rules applied 270 place count 161 transition count 2272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 271 place count 161 transition count 2271
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 280 place count 152 transition count 2262
Iterating global reduction 3 with 9 rules applied. Total rules applied 289 place count 152 transition count 2262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 294 place count 152 transition count 2257
Applied a total of 294 rules in 53 ms. Remains 152 /287 variables (removed 135) and now considering 2257/2426 (removed 169) transitions.
[2024-05-29 15:09:27] [INFO ] Flow matrix only has 2245 transitions (discarded 12 similar events)
// Phase 1: matrix 2245 rows 152 cols
[2024-05-29 15:09:27] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 15:09:27] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-29 15:09:27] [INFO ] Flow matrix only has 2245 transitions (discarded 12 similar events)
[2024-05-29 15:09:27] [INFO ] Invariant cache hit.
[2024-05-29 15:09:28] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:09:29] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
Running 2256 sub problems to find dead transitions.
[2024-05-29 15:09:29] [INFO ] Flow matrix only has 2245 transitions (discarded 12 similar events)
[2024-05-29 15:09:29] [INFO ] Invariant cache hit.
[2024-05-29 15:09:29] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2256 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2256 unsolved
[2024-05-29 15:10:16] [INFO ] Deduced a trap composed of 13 places in 496 ms of which 1 ms to minimize.
[2024-05-29 15:10:17] [INFO ] Deduced a trap composed of 19 places in 494 ms of which 0 ms to minimize.
[2024-05-29 15:10:17] [INFO ] Deduced a trap composed of 13 places in 611 ms of which 1 ms to minimize.
[2024-05-29 15:10:18] [INFO ] Deduced a trap composed of 13 places in 628 ms of which 1 ms to minimize.
[2024-05-29 15:10:19] [INFO ] Deduced a trap composed of 13 places in 616 ms of which 1 ms to minimize.
[2024-05-29 15:10:19] [INFO ] Deduced a trap composed of 13 places in 608 ms of which 0 ms to minimize.
[2024-05-29 15:10:20] [INFO ] Deduced a trap composed of 18 places in 610 ms of which 1 ms to minimize.
[2024-05-29 15:10:20] [INFO ] Deduced a trap composed of 15 places in 608 ms of which 1 ms to minimize.
[2024-05-29 15:10:21] [INFO ] Deduced a trap composed of 13 places in 594 ms of which 1 ms to minimize.
[2024-05-29 15:10:22] [INFO ] Deduced a trap composed of 13 places in 622 ms of which 1 ms to minimize.
[2024-05-29 15:10:22] [INFO ] Deduced a trap composed of 17 places in 618 ms of which 1 ms to minimize.
[2024-05-29 15:10:23] [INFO ] Deduced a trap composed of 18 places in 508 ms of which 1 ms to minimize.
[2024-05-29 15:10:23] [INFO ] Deduced a trap composed of 13 places in 506 ms of which 1 ms to minimize.
[2024-05-29 15:10:24] [INFO ] Deduced a trap composed of 15 places in 510 ms of which 0 ms to minimize.
[2024-05-29 15:10:24] [INFO ] Deduced a trap composed of 19 places in 601 ms of which 1 ms to minimize.
[2024-05-29 15:10:25] [INFO ] Deduced a trap composed of 16 places in 521 ms of which 1 ms to minimize.
[2024-05-29 15:10:25] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 1 ms to minimize.
[2024-05-29 15:10:26] [INFO ] Deduced a trap composed of 14 places in 432 ms of which 1 ms to minimize.
[2024-05-29 15:10:26] [INFO ] Deduced a trap composed of 16 places in 438 ms of which 0 ms to minimize.
[2024-05-29 15:10:27] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2256 unsolved
[2024-05-29 15:10:28] [INFO ] Deduced a trap composed of 17 places in 488 ms of which 1 ms to minimize.
[2024-05-29 15:10:28] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 1 ms to minimize.
[2024-05-29 15:10:29] [INFO ] Deduced a trap composed of 17 places in 485 ms of which 1 ms to minimize.
[2024-05-29 15:10:29] [INFO ] Deduced a trap composed of 17 places in 484 ms of which 1 ms to minimize.
[2024-05-29 15:10:30] [INFO ] Deduced a trap composed of 16 places in 410 ms of which 1 ms to minimize.
[2024-05-29 15:10:30] [INFO ] Deduced a trap composed of 15 places in 406 ms of which 0 ms to minimize.
[2024-05-29 15:10:31] [INFO ] Deduced a trap composed of 16 places in 426 ms of which 1 ms to minimize.
[2024-05-29 15:10:31] [INFO ] Deduced a trap composed of 18 places in 412 ms of which 1 ms to minimize.
SMT process timed out in 62257ms, After SMT, problems are : Problem set: 0 solved, 2256 unsolved
Search for dead transitions found 0 dead transitions in 62282ms
Starting structural reductions in LTL mode, iteration 1 : 152/287 places, 2257/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64223 ms. Remains : 152/287 places, 2257/2426 transitions.
[2024-05-29 15:10:31] [INFO ] Flatten gal took : 109 ms
[2024-05-29 15:10:31] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:10:32] [INFO ] Input system was already deterministic with 2257 transitions.
[2024-05-29 15:10:32] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:10:32] [INFO ] Flatten gal took : 116 ms
[2024-05-29 15:10:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13877113301212076534.gal : 23 ms
[2024-05-29 15:10:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality9732363985070964709.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/CTLCardinality13877113301212076534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9732363985070964709.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:11:02] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:11:02] [INFO ] Applying decomposition
[2024-05-29 15:11:02] [INFO ] Flatten gal took : 118 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/graph8605372547243822697.txt' '-o' '/tmp/graph8605372547243822697.bin' '-w' '/tmp/graph8605372547243822697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8605372547243822697.bin' '-l' '-1' '-v' '-w' '/tmp/graph8605372547243822697.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:11:02] [INFO ] Decomposing Gal with order
[2024-05-29 15:11:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:11:03] [INFO ] Removed a total of 20566 redundant transitions.
[2024-05-29 15:11:03] [INFO ] Flatten gal took : 273 ms
[2024-05-29 15:11:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 128 ms.
[2024-05-29 15:11:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality14120902174056996940.gal : 76 ms
[2024-05-29 15:11:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality10510284622412458893.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/CTLCardinality14120902174056996940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10510284622412458893.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 : 287/287 places, 2426/2426 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 237 transition count 2368
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 237 transition count 2368
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 106 place count 237 transition count 2362
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 138 place count 205 transition count 2326
Iterating global reduction 1 with 32 rules applied. Total rules applied 170 place count 205 transition count 2326
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 180 place count 205 transition count 2316
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 197 place count 188 transition count 2299
Iterating global reduction 2 with 17 rules applied. Total rules applied 214 place count 188 transition count 2299
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 225 place count 177 transition count 2288
Iterating global reduction 2 with 11 rules applied. Total rules applied 236 place count 177 transition count 2288
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 245 place count 168 transition count 2279
Iterating global reduction 2 with 9 rules applied. Total rules applied 254 place count 168 transition count 2279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 256 place count 168 transition count 2277
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 263 place count 161 transition count 2270
Iterating global reduction 3 with 7 rules applied. Total rules applied 270 place count 161 transition count 2270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 273 place count 161 transition count 2267
Applied a total of 273 rules in 63 ms. Remains 161 /287 variables (removed 126) and now considering 2267/2426 (removed 159) transitions.
[2024-05-29 15:11:33] [INFO ] Flow matrix only has 2254 transitions (discarded 13 similar events)
// Phase 1: matrix 2254 rows 161 cols
[2024-05-29 15:11:33] [INFO ] Computed 2 invariants in 16 ms
[2024-05-29 15:11:34] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-29 15:11:34] [INFO ] Flow matrix only has 2254 transitions (discarded 13 similar events)
[2024-05-29 15:11:34] [INFO ] Invariant cache hit.
[2024-05-29 15:11:34] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:11:35] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Running 2266 sub problems to find dead transitions.
[2024-05-29 15:11:35] [INFO ] Flow matrix only has 2254 transitions (discarded 13 similar events)
[2024-05-29 15:11:35] [INFO ] Invariant cache hit.
[2024-05-29 15:11:35] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2024-05-29 15:12:23] [INFO ] Deduced a trap composed of 16 places in 483 ms of which 1 ms to minimize.
[2024-05-29 15:12:23] [INFO ] Deduced a trap composed of 17 places in 479 ms of which 1 ms to minimize.
[2024-05-29 15:12:23] [INFO ] Deduced a trap composed of 17 places in 415 ms of which 1 ms to minimize.
[2024-05-29 15:12:24] [INFO ] Deduced a trap composed of 13 places in 486 ms of which 1 ms to minimize.
[2024-05-29 15:12:24] [INFO ] Deduced a trap composed of 17 places in 406 ms of which 1 ms to minimize.
[2024-05-29 15:12:25] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 0 ms to minimize.
[2024-05-29 15:12:25] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 1 ms to minimize.
[2024-05-29 15:12:26] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2024-05-29 15:12:26] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 0 ms to minimize.
[2024-05-29 15:12:27] [INFO ] Deduced a trap composed of 13 places in 504 ms of which 0 ms to minimize.
[2024-05-29 15:12:27] [INFO ] Deduced a trap composed of 13 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:12:28] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 0 ms to minimize.
[2024-05-29 15:12:28] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 1 ms to minimize.
[2024-05-29 15:12:28] [INFO ] Deduced a trap composed of 16 places in 378 ms of which 0 ms to minimize.
[2024-05-29 15:12:29] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 1 ms to minimize.
[2024-05-29 15:12:29] [INFO ] Deduced a trap composed of 17 places in 376 ms of which 1 ms to minimize.
[2024-05-29 15:12:29] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 0 ms to minimize.
[2024-05-29 15:12:30] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 0 ms to minimize.
[2024-05-29 15:12:30] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2024-05-29 15:12:30] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2024-05-29 15:12:31] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 1 ms to minimize.
[2024-05-29 15:12:32] [INFO ] Deduced a trap composed of 16 places in 354 ms of which 1 ms to minimize.
[2024-05-29 15:12:32] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 1 ms to minimize.
[2024-05-29 15:12:32] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 0 ms to minimize.
[2024-05-29 15:12:33] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 0 ms to minimize.
[2024-05-29 15:12:33] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 1 ms to minimize.
[2024-05-29 15:12:33] [INFO ] Deduced a trap composed of 14 places in 415 ms of which 1 ms to minimize.
[2024-05-29 15:12:34] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 1 ms to minimize.
[2024-05-29 15:12:34] [INFO ] Deduced a trap composed of 13 places in 365 ms of which 0 ms to minimize.
[2024-05-29 15:12:34] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 0 ms to minimize.
[2024-05-29 15:12:35] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 1 ms to minimize.
[2024-05-29 15:12:35] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 0 ms to minimize.
[2024-05-29 15:12:35] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 0 ms to minimize.
[2024-05-29 15:12:35] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 15:12:36] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 1 ms to minimize.
[2024-05-29 15:12:36] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 1 ms to minimize.
[2024-05-29 15:12:36] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2024-05-29 15:12:36] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2024-05-29 15:12:37] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2024-05-29 15:12:37] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/2415 variables, and 42 constraints, problems are : Problem set: 0 solved, 2266 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/161 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2266/209 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2024-05-29 15:12:46] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 1 ms to minimize.
[2024-05-29 15:12:46] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-05-29 15:12:46] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2024-05-29 15:12:47] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2024-05-29 15:12:47] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 0 ms to minimize.
[2024-05-29 15:12:47] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2024-05-29 15:12:48] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 0 ms to minimize.
[2024-05-29 15:12:48] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 1 ms to minimize.
[2024-05-29 15:12:48] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 1 ms to minimize.
[2024-05-29 15:12:48] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 0 ms to minimize.
[2024-05-29 15:12:49] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 1 ms to minimize.
[2024-05-29 15:12:49] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-05-29 15:12:49] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2024-05-29 15:12:50] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 1 ms to minimize.
[2024-05-29 15:12:50] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2024-05-29 15:12:50] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:12:50] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:12:50] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2024-05-29 15:12:51] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 0 ms to minimize.
[2024-05-29 15:12:51] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2024-05-29 15:12:52] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 1 ms to minimize.
[2024-05-29 15:12:52] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 1 ms to minimize.
[2024-05-29 15:12:53] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-05-29 15:12:53] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 15:12:53] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 15:12:53] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:12:53] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2024-05-29 15:12:54] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2024-05-29 15:12:54] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:12:54] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2024-05-29 15:12:54] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:12:54] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-05-29 15:12:54] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 15:12:54] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:12:55] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:12:55] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:12:55] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2024-05-29 15:12:55] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:12:55] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:12:55] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2024-05-29 15:12:58] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 15:12:58] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2024-05-29 15:12:58] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2024-05-29 15:12:58] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:12:59] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2024-05-29 15:12:59] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
[2024-05-29 15:12:59] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:12:59] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:12:59] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 15:12:59] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:13:00] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:13:00] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:13:00] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:13:00] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2024-05-29 15:13:00] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:13:00] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:13:01] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2024-05-29 15:13:01] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:13:01] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2024-05-29 15:13:01] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2024-05-29 15:13:03] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:13:04] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:13:04] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 15:13:04] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 15:13:04] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2024-05-29 15:13:04] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 15:13:04] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2024-05-29 15:13:05] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 15:13:05] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2024-05-29 15:13:05] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:13:05] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 15:13:06] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:13:06] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:13:07] [INFO ] Deduced a trap composed of 17 places in 486 ms of which 1 ms to minimize.
[2024-05-29 15:13:07] [INFO ] Deduced a trap composed of 16 places in 483 ms of which 1 ms to minimize.
SMT process timed out in 92186ms, After SMT, problems are : Problem set: 0 solved, 2266 unsolved
Search for dead transitions found 0 dead transitions in 92209ms
Starting structural reductions in LTL mode, iteration 1 : 161/287 places, 2267/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94140 ms. Remains : 161/287 places, 2267/2426 transitions.
[2024-05-29 15:13:07] [INFO ] Flatten gal took : 110 ms
[2024-05-29 15:13:07] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:13:08] [INFO ] Input system was already deterministic with 2267 transitions.
[2024-05-29 15:13:08] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:13:08] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:13:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6286696797705920243.gal : 25 ms
[2024-05-29 15:13:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7289231863047850107.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/CTLCardinality6286696797705920243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7289231863047850107.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:13:38] [INFO ] Flatten gal took : 120 ms
[2024-05-29 15:13:38] [INFO ] Applying decomposition
[2024-05-29 15:13:38] [INFO ] Flatten gal took : 121 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/graph10931730275324495897.txt' '-o' '/tmp/graph10931730275324495897.bin' '-w' '/tmp/graph10931730275324495897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10931730275324495897.bin' '-l' '-1' '-v' '-w' '/tmp/graph10931730275324495897.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:13:39] [INFO ] Decomposing Gal with order
[2024-05-29 15:13:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:13:39] [INFO ] Removed a total of 20561 redundant transitions.
[2024-05-29 15:13:39] [INFO ] Flatten gal took : 284 ms
[2024-05-29 15:13:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 82 ms.
[2024-05-29 15:13:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality3662388287224253609.gal : 15 ms
[2024-05-29 15:13:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality1422279094074415909.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/CTLCardinality3662388287224253609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1422279094074415909.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.73735e+08,27.2556,596544,8801,33,258081,383,2279,6.42717e+06,61,1331,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 232 transition count 2362
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 232 transition count 2362
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 232 transition count 2356
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 156 place count 192 transition count 2311
Iterating global reduction 1 with 40 rules applied. Total rules applied 196 place count 192 transition count 2311
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 208 place count 192 transition count 2299
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 231 place count 169 transition count 2276
Iterating global reduction 2 with 23 rules applied. Total rules applied 254 place count 169 transition count 2276
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 271 place count 152 transition count 2259
Iterating global reduction 2 with 17 rules applied. Total rules applied 288 place count 152 transition count 2259
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 302 place count 138 transition count 2245
Iterating global reduction 2 with 14 rules applied. Total rules applied 316 place count 138 transition count 2245
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 318 place count 138 transition count 2243
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 329 place count 127 transition count 2232
Iterating global reduction 3 with 11 rules applied. Total rules applied 340 place count 127 transition count 2232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 346 place count 127 transition count 2226
Applied a total of 346 rules in 60 ms. Remains 127 /287 variables (removed 160) and now considering 2226/2426 (removed 200) transitions.
[2024-05-29 15:14:09] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
// Phase 1: matrix 2215 rows 127 cols
[2024-05-29 15:14:09] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 15:14:10] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-29 15:14:10] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
[2024-05-29 15:14:10] [INFO ] Invariant cache hit.
[2024-05-29 15:14:10] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:14:11] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
Running 2225 sub problems to find dead transitions.
[2024-05-29 15:14:11] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
[2024-05-29 15:14:11] [INFO ] Invariant cache hit.
[2024-05-29 15:14:11] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:14:56] [INFO ] Deduced a trap composed of 13 places in 596 ms of which 1 ms to minimize.
[2024-05-29 15:14:57] [INFO ] Deduced a trap composed of 15 places in 606 ms of which 1 ms to minimize.
[2024-05-29 15:14:58] [INFO ] Deduced a trap composed of 14 places in 610 ms of which 1 ms to minimize.
[2024-05-29 15:14:58] [INFO ] Deduced a trap composed of 17 places in 593 ms of which 1 ms to minimize.
[2024-05-29 15:14:59] [INFO ] Deduced a trap composed of 14 places in 600 ms of which 1 ms to minimize.
[2024-05-29 15:14:59] [INFO ] Deduced a trap composed of 15 places in 615 ms of which 1 ms to minimize.
[2024-05-29 15:15:00] [INFO ] Deduced a trap composed of 14 places in 515 ms of which 1 ms to minimize.
[2024-05-29 15:15:00] [INFO ] Deduced a trap composed of 17 places in 501 ms of which 1 ms to minimize.
[2024-05-29 15:15:01] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:15:01] [INFO ] Deduced a trap composed of 13 places in 500 ms of which 1 ms to minimize.
[2024-05-29 15:15:02] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 1 ms to minimize.
[2024-05-29 15:15:02] [INFO ] Deduced a trap composed of 13 places in 518 ms of which 0 ms to minimize.
[2024-05-29 15:15:03] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 0 ms to minimize.
[2024-05-29 15:15:03] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 1 ms to minimize.
[2024-05-29 15:15:04] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 0 ms to minimize.
[2024-05-29 15:15:04] [INFO ] Deduced a trap composed of 13 places in 357 ms of which 1 ms to minimize.
[2024-05-29 15:15:04] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 1 ms to minimize.
[2024-05-29 15:15:05] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 1 ms to minimize.
[2024-05-29 15:15:05] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 1 ms to minimize.
[2024-05-29 15:15:05] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:15:06] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 1 ms to minimize.
[2024-05-29 15:15:06] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 0 ms to minimize.
[2024-05-29 15:15:07] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2024-05-29 15:15:07] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 1 ms to minimize.
[2024-05-29 15:15:08] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 1 ms to minimize.
[2024-05-29 15:15:08] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-05-29 15:15:08] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2024-05-29 15:15:08] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 0 ms to minimize.
[2024-05-29 15:15:09] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
[2024-05-29 15:15:09] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 0 ms to minimize.
[2024-05-29 15:15:09] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 0 ms to minimize.
[2024-05-29 15:15:09] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:15:10] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
[2024-05-29 15:15:10] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 0 ms to minimize.
[2024-05-29 15:15:10] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 1 ms to minimize.
[2024-05-29 15:15:11] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 0 ms to minimize.
[2024-05-29 15:15:11] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 1 ms to minimize.
[2024-05-29 15:15:11] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2024-05-29 15:15:11] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 0 ms to minimize.
[2024-05-29 15:15:12] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 127/2342 variables, and 41 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/127 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2225/168 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:15:21] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2024-05-29 15:15:21] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2024-05-29 15:15:21] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 0 ms to minimize.
[2024-05-29 15:15:22] [INFO ] Deduced a trap composed of 13 places in 365 ms of which 1 ms to minimize.
[2024-05-29 15:15:22] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 2 ms to minimize.
[2024-05-29 15:15:22] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 0 ms to minimize.
[2024-05-29 15:15:23] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 1 ms to minimize.
[2024-05-29 15:15:23] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2024-05-29 15:15:23] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:15:23] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 0 ms to minimize.
[2024-05-29 15:15:23] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 0 ms to minimize.
[2024-05-29 15:15:24] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:15:24] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 1 ms to minimize.
[2024-05-29 15:15:24] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 0 ms to minimize.
[2024-05-29 15:15:24] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 15:15:25] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:15:25] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:15:25] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:15:25] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2024-05-29 15:15:25] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:15:26] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 1 ms to minimize.
[2024-05-29 15:15:26] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 0 ms to minimize.
[2024-05-29 15:15:26] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 15:15:27] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:15:27] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-29 15:15:27] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:15:27] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:15:27] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:15:27] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 0 ms to minimize.
[2024-05-29 15:15:27] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2024-05-29 15:15:28] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2024-05-29 15:15:28] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:15:28] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 15:15:28] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:15:29] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2024-05-29 15:15:29] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2024-05-29 15:15:29] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2024-05-29 15:15:29] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2024-05-29 15:15:29] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:15:30] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:15:31] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:15:31] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-29 15:15:31] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:15:31] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:15:32] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:15:32] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-29 15:15:32] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:15:32] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:15:32] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:15:32] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 15:15:32] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 15:15:33] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:15:33] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:15:33] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:15:33] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:15:34] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:15:34] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:15:34] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:15:34] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:15:34] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:15:37] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-29 15:15:37] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
[2024-05-29 15:15:37] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:15:37] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-29 15:15:38] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 15:15:38] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 15:15:38] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 15:15:38] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:15:38] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:15:38] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:15:39] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:15:39] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 15:15:39] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:15:39] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 15:15:40] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:15:40] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:15:40] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:15:40] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 15:15:40] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:15:41] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/2342 variables, and 121 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/127 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2057/168 constraints, Known Traps: 120/120 constraints]
After SMT, in 91947ms problems are : Problem set: 0 solved, 2225 unsolved
Search for dead transitions found 0 dead transitions in 91972ms
Starting structural reductions in LTL mode, iteration 1 : 127/287 places, 2226/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93938 ms. Remains : 127/287 places, 2226/2426 transitions.
[2024-05-29 15:15:43] [INFO ] Flatten gal took : 109 ms
[2024-05-29 15:15:43] [INFO ] Flatten gal took : 116 ms
[2024-05-29 15:15:44] [INFO ] Input system was already deterministic with 2226 transitions.
[2024-05-29 15:15:44] [INFO ] Flatten gal took : 115 ms
[2024-05-29 15:15:44] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:15:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1353443892295811208.gal : 24 ms
[2024-05-29 15:15:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7204932037485376734.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/CTLCardinality1353443892295811208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7204932037485376734.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:16:14] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:16:14] [INFO ] Applying decomposition
[2024-05-29 15:16:14] [INFO ] Flatten gal took : 118 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/graph11137947137085557212.txt' '-o' '/tmp/graph11137947137085557212.bin' '-w' '/tmp/graph11137947137085557212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11137947137085557212.bin' '-l' '-1' '-v' '-w' '/tmp/graph11137947137085557212.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:16:15] [INFO ] Decomposing Gal with order
[2024-05-29 15:16:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:16:15] [INFO ] Removed a total of 20550 redundant transitions.
[2024-05-29 15:16:15] [INFO ] Flatten gal took : 266 ms
[2024-05-29 15:16:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 83 ms.
[2024-05-29 15:16:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality1766145005041022596.gal : 14 ms
[2024-05-29 15:16:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality7179033606974903637.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/CTLCardinality1766145005041022596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7179033606974903637.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.72948e+08,20.8304,608940,9795,45,183122,475,2466,6.68798e+06,60,1732,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 2426/2426 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 232 transition count 2362
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 232 transition count 2362
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 117 place count 232 transition count 2355
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 156 place count 193 transition count 2311
Iterating global reduction 1 with 39 rules applied. Total rules applied 195 place count 193 transition count 2311
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 206 place count 193 transition count 2300
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 229 place count 170 transition count 2277
Iterating global reduction 2 with 23 rules applied. Total rules applied 252 place count 170 transition count 2277
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 269 place count 153 transition count 2260
Iterating global reduction 2 with 17 rules applied. Total rules applied 286 place count 153 transition count 2260
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 301 place count 138 transition count 2245
Iterating global reduction 2 with 15 rules applied. Total rules applied 316 place count 138 transition count 2245
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 318 place count 138 transition count 2243
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 329 place count 127 transition count 2232
Iterating global reduction 3 with 11 rules applied. Total rules applied 340 place count 127 transition count 2232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 346 place count 127 transition count 2226
Applied a total of 346 rules in 68 ms. Remains 127 /287 variables (removed 160) and now considering 2226/2426 (removed 200) transitions.
[2024-05-29 15:16:45] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
// Phase 1: matrix 2215 rows 127 cols
[2024-05-29 15:16:45] [INFO ] Computed 1 invariants in 17 ms
[2024-05-29 15:16:46] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-05-29 15:16:46] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
[2024-05-29 15:16:46] [INFO ] Invariant cache hit.
[2024-05-29 15:16:46] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:16:47] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
Running 2225 sub problems to find dead transitions.
[2024-05-29 15:16:47] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
[2024-05-29 15:16:47] [INFO ] Invariant cache hit.
[2024-05-29 15:16:47] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:17:32] [INFO ] Deduced a trap composed of 15 places in 586 ms of which 1 ms to minimize.
[2024-05-29 15:17:33] [INFO ] Deduced a trap composed of 13 places in 580 ms of which 1 ms to minimize.
[2024-05-29 15:17:34] [INFO ] Deduced a trap composed of 13 places in 588 ms of which 1 ms to minimize.
[2024-05-29 15:17:34] [INFO ] Deduced a trap composed of 13 places in 577 ms of which 0 ms to minimize.
[2024-05-29 15:17:35] [INFO ] Deduced a trap composed of 13 places in 590 ms of which 0 ms to minimize.
[2024-05-29 15:17:35] [INFO ] Deduced a trap composed of 13 places in 606 ms of which 1 ms to minimize.
[2024-05-29 15:17:36] [INFO ] Deduced a trap composed of 15 places in 608 ms of which 1 ms to minimize.
[2024-05-29 15:17:37] [INFO ] Deduced a trap composed of 13 places in 601 ms of which 0 ms to minimize.
[2024-05-29 15:17:37] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2024-05-29 15:17:38] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2024-05-29 15:17:38] [INFO ] Deduced a trap composed of 15 places in 589 ms of which 1 ms to minimize.
[2024-05-29 15:17:39] [INFO ] Deduced a trap composed of 15 places in 496 ms of which 1 ms to minimize.
[2024-05-29 15:17:39] [INFO ] Deduced a trap composed of 15 places in 504 ms of which 1 ms to minimize.
[2024-05-29 15:17:40] [INFO ] Deduced a trap composed of 15 places in 425 ms of which 0 ms to minimize.
[2024-05-29 15:17:40] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 0 ms to minimize.
[2024-05-29 15:17:40] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2024-05-29 15:17:41] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 1 ms to minimize.
[2024-05-29 15:17:41] [INFO ] Deduced a trap composed of 18 places in 356 ms of which 1 ms to minimize.
[2024-05-29 15:17:42] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 0 ms to minimize.
[2024-05-29 15:17:42] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:17:43] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 0 ms to minimize.
[2024-05-29 15:17:43] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2024-05-29 15:17:43] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 1 ms to minimize.
[2024-05-29 15:17:44] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 0 ms to minimize.
[2024-05-29 15:17:44] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-05-29 15:17:44] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:17:44] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 0 ms to minimize.
[2024-05-29 15:17:45] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 0 ms to minimize.
[2024-05-29 15:17:45] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 1 ms to minimize.
[2024-05-29 15:17:45] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 1 ms to minimize.
[2024-05-29 15:17:46] [INFO ] Deduced a trap composed of 17 places in 385 ms of which 1 ms to minimize.
[2024-05-29 15:17:46] [INFO ] Deduced a trap composed of 14 places in 352 ms of which 1 ms to minimize.
[2024-05-29 15:17:46] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 1 ms to minimize.
[2024-05-29 15:17:47] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2024-05-29 15:17:47] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 0 ms to minimize.
[2024-05-29 15:17:48] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 1 ms to minimize.
[2024-05-29 15:17:48] [INFO ] Deduced a trap composed of 17 places in 411 ms of which 1 ms to minimize.
[2024-05-29 15:17:48] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2024-05-29 15:17:49] [INFO ] Deduced a trap composed of 13 places in 469 ms of which 1 ms to minimize.
[2024-05-29 15:17:49] [INFO ] Deduced a trap composed of 15 places in 429 ms of which 1 ms to minimize.
SMT process timed out in 62405ms, After SMT, problems are : Problem set: 0 solved, 2225 unsolved
Search for dead transitions found 0 dead transitions in 62428ms
Starting structural reductions in LTL mode, iteration 1 : 127/287 places, 2226/2426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64318 ms. Remains : 127/287 places, 2226/2426 transitions.
[2024-05-29 15:17:49] [INFO ] Flatten gal took : 108 ms
[2024-05-29 15:17:50] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:17:50] [INFO ] Input system was already deterministic with 2226 transitions.
[2024-05-29 15:17:50] [INFO ] Flatten gal took : 137 ms
[2024-05-29 15:17:50] [INFO ] Flatten gal took : 130 ms
[2024-05-29 15:17:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality8507168812242731381.gal : 27 ms
[2024-05-29 15:17:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1601164431991687334.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/CTLCardinality8507168812242731381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1601164431991687334.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:18:20] [INFO ] Flatten gal took : 128 ms
[2024-05-29 15:18:20] [INFO ] Applying decomposition
[2024-05-29 15:18:20] [INFO ] Flatten gal took : 130 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/graph8480416275243273511.txt' '-o' '/tmp/graph8480416275243273511.bin' '-w' '/tmp/graph8480416275243273511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8480416275243273511.bin' '-l' '-1' '-v' '-w' '/tmp/graph8480416275243273511.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:18:21] [INFO ] Decomposing Gal with order
[2024-05-29 15:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:18:21] [INFO ] Removed a total of 20555 redundant transitions.
[2024-05-29 15:18:21] [INFO ] Flatten gal took : 308 ms
[2024-05-29 15:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 67 ms.
[2024-05-29 15:18:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16677005752022117904.gal : 17 ms
[2024-05-29 15:18:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality137695527621504840.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/CTLCardinality16677005752022117904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality137695527621504840.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.
[2024-05-29 15:18:52] [INFO ] Flatten gal took : 132 ms
[2024-05-29 15:18:52] [INFO ] Flatten gal took : 135 ms
[2024-05-29 15:18:52] [INFO ] Applying decomposition
[2024-05-29 15:18:52] [INFO ] Flatten gal took : 135 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/graph7424713200597572755.txt' '-o' '/tmp/graph7424713200597572755.bin' '-w' '/tmp/graph7424713200597572755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7424713200597572755.bin' '-l' '-1' '-v' '-w' '/tmp/graph7424713200597572755.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:18:52] [INFO ] Decomposing Gal with order
[2024-05-29 15:18:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:18:53] [INFO ] Removed a total of 20603 redundant transitions.
[2024-05-29 15:18:53] [INFO ] Flatten gal took : 336 ms
[2024-05-29 15:18:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 134 ms.
[2024-05-29 15:18:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality3793397541119454468.gal : 13 ms
[2024-05-29 15:18:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality3185330813362924559.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/CTLCardinality3793397541119454468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3185330813362924559.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.73997e+08,27.2621,405108,8493,67,270436,627,2465,3.67868e+06,85,2174,0


Converting to forward existential form...Done !
original formula: (AX(EF(((i10.i1.i1.u72.p235==0) + AX(FALSE)))) * EG((i5.u40.p123==0)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((i10.i1.i1.u72.p235==0) + !(EX(!(FALSE)))))))] = FALSE * [(Init * !(EG((i5.u40.p123==0...169
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t20, t26, t29, t31, t36, t38, t40, t49, t52, t56, t63, t67, t71, t85, t127, t146, t1...847
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,118.184,2197464,1,0,696708,982,46704,1.53141e+07,403,3285,21604332
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((AG(((i16.u101.p334!=0)&&(i6.u51.p158!=1))) * (i6.u49.p153!=0)) * ((i3.u17.p47!=1) * EF(((i10.i1.i1.u72.p236!=0)&&(i1.u9.p26!=1)))))...266
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((!(E(TRUE U !(((i16.u101.p334!=0)&&(i6.u51.p158!=1))))) * (i6.u49.p153!=0)) * ((i3.u17.p4...342
(forward)formula 1,0,335.667,2599704,1,0,933473,1059,11339,3.0277e+07,233,3417,2849681
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF(AX((((i1.u4.p12==0)||(i10.i1.i1.u78.p252==1)) * ((E((i5.u42.p128==1) U ((i4.u26.p75==0)||(i17.u108.p358==1))) + (i15.u65.p40==0)) +...183
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((((i1.u4.p12==0)||(i10.i1.i1.u78.p252==1)) * ((E((i5.u42.p128==1) U ((i4.u26.p75==0)|...238
(forward)formula 2,1,415.678,2599704,1,0,1.12541e+06,1234,18242,3.0277e+07,305,4012,5174221
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((AG(AF((((i6.u52.p159==0)||(i6.u53.p164==1))&&(i14.u98.p310==1)))) * (A(((i1.u2.p8==1)||((i10.i2.i0.u82.p263==0)&&(i1.u5.p15==1))) U AX...355
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(E(TRUE U !(!(EG(!((((i6.u52.p159==0)||(i6.u53.p164==1))&&(i14.u98.p310==1)))))))) * (!((E(!(...521
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 3,1,424.42,2599704,1,0,1.16695e+06,1264,18374,3.0277e+07,306,4226,5275457
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((!(E(((i3.u18.p51==0)||(i6.u50.p173==1)) U (i10.i1.i0.u75.p243==0))) + AG((i16.u102.p332==1))) + (EX(((i15.u1.p43==0)||(i3.u16.p65==...216
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,TRUE) * !(E(TRUE U EG((i6.u51.p157==0))))) * !((EX(((i15.u1.p43==0)||(i3.u16.p65==1))) + (i1...292
(forward)formula 4,1,428.31,2599704,1,0,1.18579e+06,1266,18429,3.0277e+07,307,4240,5332674
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((EG(((AF(((i6.u58.p178==0)&&(i11.u68.p217==1))) + ((i15.u106.p331==0)&&(i15.u33.p187==1))) + ((i0.u79.p258==0)&&(i10.i0.i0.u28.p93==1...279
=> equivalent forward existential formula: [((EY(((FwdU(Init,TRUE) * ((i10.i0.i0.u32.p97==0)&&(i10.i1.i1.u77.p233==1))) * EG(((!(EG(!(((i6.u58.p178==0)&&(i...343
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 5,0,430.682,2599704,1,0,1.21887e+06,1291,18487,3.0277e+07,309,4363,5378417
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(A(E(((i10.i2.i2.u87.p275!=1) + AG(((i3.u19.p54==0)||(i1.u4.p12==1)))) U AX(!(((i7.u60.p194==0)||(i12.u34.p103==1))))) U (AG(AX(((i15.u...368
=> equivalent forward existential formula: [FwdG(Init,!((E(!((!(E(TRUE U !(!(EX(!(((i15.u93.p293==0)||(i1.u8.p23==1)))))))) * (EX((i10.i0.i0.u32.p98==1)) +...1283
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 6,0,881.881,3834168,1,0,1.58978e+06,1374,11517,4.46563e+07,240,4808,6855621
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AX(((i1.u3.p10==0)||(i5.u44.p134==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((i1.u3.p10==0)||(i5.u44.p134==1))))] = FALSE
(forward)formula 7,0,888.949,4110048,1,0,1.63293e+06,1374,17351,4.80405e+07,249,4808,7338107
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF(((EX((i15.u100.p328==1)) * (i10.i2.i0.u83.p265==0)) * (i10.i2.i1.u86.p272==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((EX((i15.u100.p328==1)) * (i10.i2.i0.u83.p265==0)) * (i10.i2.i1.u86.p272==1))))] = FALSE
(forward)formula 8,0,1015.05,4298280,1,0,1.78838e+06,1426,11485,4.9476e+07,234,4985,2205684
FORMULA StigmergyCommit-PT-09a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2417165 ms.

BK_STOP 1716996949869

--------------------
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-09a"
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-09a, 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-171690531800201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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