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.r136-tall-171631132800513.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 DiscoveryGPU-PT-15b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132800513
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 02:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 02:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 111K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716384154289

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-15b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 13:22:35] [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-22 13:22:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:22:35] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-22 13:22:35] [INFO ] Transformed 436 places.
[2024-05-22 13:22:35] [INFO ] Transformed 464 transitions.
[2024-05-22 13:22:35] [INFO ] Found NUPN structural information;
[2024-05-22 13:22:35] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA DiscoveryGPU-PT-15b-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 77 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 414 transition count 464
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 72 place count 364 transition count 414
Iterating global reduction 1 with 50 rules applied. Total rules applied 122 place count 364 transition count 414
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 358 transition count 408
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 358 transition count 408
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 139 place count 353 transition count 403
Iterating global reduction 1 with 5 rules applied. Total rules applied 144 place count 353 transition count 403
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 147 place count 350 transition count 400
Iterating global reduction 1 with 3 rules applied. Total rules applied 150 place count 350 transition count 400
Applied a total of 150 rules in 96 ms. Remains 350 /436 variables (removed 86) and now considering 400/464 (removed 64) transitions.
// Phase 1: matrix 400 rows 350 cols
[2024-05-22 13:22:35] [INFO ] Computed 4 invariants in 21 ms
[2024-05-22 13:22:36] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-22 13:22:36] [INFO ] Invariant cache hit.
[2024-05-22 13:22:36] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2024-05-22 13:22:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 5/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 13:22:40] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 9 ms to minimize.
[2024-05-22 13:22:40] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 3 ms to minimize.
[2024-05-22 13:22:40] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:22:40] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 400/746 variables, 346/354 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 13:22:47] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 3 ms to minimize.
[2024-05-22 13:22:47] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-22 13:22:47] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-22 13:22:47] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 3 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-22 13:22:48] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:22:49] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-22 13:22:50] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:22:50] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:22:50] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:22:50] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:22:50] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 8 (OVERLAPS) 4/750 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/750 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/750 variables, and 386 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 350/350 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 5/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 400/746 variables, 346/382 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 395/777 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 4/750 variables, 4/781 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 4/785 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/750 variables, and 785 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 350/350 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 32/32 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Starting structural reductions in LTL mode, iteration 1 : 350/436 places, 400/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61010 ms. Remains : 350/436 places, 400/464 transitions.
Support contains 77 out of 350 places after structural reductions.
[2024-05-22 13:23:36] [INFO ] Flatten gal took : 48 ms
[2024-05-22 13:23:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-15b-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 13:23:36] [INFO ] Flatten gal took : 20 ms
[2024-05-22 13:23:36] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 72 out of 350 places (down from 77) after GAL structural reductions.
RANDOM walk for 17159 steps (33 resets) in 673 ms. (25 steps per ms) remains 0/48 properties
[2024-05-22 13:23:37] [INFO ] Flatten gal took : 18 ms
[2024-05-22 13:23:37] [INFO ] Flatten gal took : 19 ms
[2024-05-22 13:23:37] [INFO ] Input system was already deterministic with 400 transitions.
Computed a total of 55 stabilizing places and 55 stable transitions
Graph (complete) has 665 edges and 350 vertex of which 328 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Graph (complete) has 665 edges and 350 vertex of which 328 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 327 transition count 326
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 268 transition count 326
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 119 place count 268 transition count 284
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 203 place count 226 transition count 284
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 218 place count 211 transition count 267
Iterating global reduction 2 with 15 rules applied. Total rules applied 233 place count 211 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 233 place count 211 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 210 transition count 266
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 246 place count 199 transition count 253
Iterating global reduction 2 with 11 rules applied. Total rules applied 257 place count 199 transition count 253
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 266 place count 190 transition count 240
Iterating global reduction 2 with 9 rules applied. Total rules applied 275 place count 190 transition count 240
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 282 place count 183 transition count 230
Iterating global reduction 2 with 7 rules applied. Total rules applied 289 place count 183 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 292 place count 180 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 295 place count 180 transition count 227
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 347 place count 154 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 349 place count 152 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 351 place count 152 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 353 place count 150 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 150 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 356 place count 149 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 149 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 147 transition count 192
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 175 edges and 145 vertex of which 141 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 154 edges and 141 vertex of which 60 / 141 are part of one of the 30 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 2 with 50 rules applied. Total rules applied 409 place count 111 transition count 141
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 78 rules applied. Total rules applied 487 place count 65 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 488 place count 64 transition count 109
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 501 place count 51 transition count 83
Iterating global reduction 5 with 13 rules applied. Total rules applied 514 place count 51 transition count 83
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 526 place count 39 transition count 59
Iterating global reduction 5 with 12 rules applied. Total rules applied 538 place count 39 transition count 59
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 550 place count 27 transition count 35
Iterating global reduction 5 with 12 rules applied. Total rules applied 562 place count 27 transition count 35
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 574 place count 15 transition count 23
Iterating global reduction 5 with 12 rules applied. Total rules applied 586 place count 15 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 587 place count 15 transition count 22
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 588 place count 15 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 589 place count 14 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 592 place count 11 transition count 18
Applied a total of 592 rules in 93 ms. Remains 11 /350 variables (removed 339) and now considering 18/400 (removed 382) transitions.
[2024-05-22 13:23:37] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
// Phase 1: matrix 14 rows 11 cols
[2024-05-22 13:23:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 13:23:37] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 13:23:37] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
[2024-05-22 13:23:37] [INFO ] Invariant cache hit.
[2024-05-22 13:23:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 13:23:37] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-22 13:23:37] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
[2024-05-22 13:23:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 11 constraints, problems are : Problem set: 0 solved, 12 unsolved in 108 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 79 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 192ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/350 places, 18/400 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 327 ms. Remains : 11/350 places, 18/400 transitions.
[2024-05-22 13:23:37] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:23:37] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:23:37] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-22 13:23:37] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:23:37] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:23:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10603528207382371006.gal : 1 ms
[2024-05-22 13:23:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5339172443525484992.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/CTLCardinality10603528207382371006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5339172443525484992.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,3234,0.013438,3200,2,33,5,489,6,0,53,639,0


Converting to forward existential form...Done !
original formula: (AG(EF((p192==0))) * AF((p237==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (p192==0))))] = FALSE * [FwdG(Init,!((p237==1)))] = FALSE)
Hit Full ! (commute/partial/dont) 16/0/2
(forward)formula 0,0,0.017041,3548,1,0,8,760,20,4,272,910,8
FORMULA DiscoveryGPU-PT-15b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Graph (complete) has 665 edges and 350 vertex of which 331 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 330 transition count 330
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 273 transition count 330
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 115 place count 273 transition count 289
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 197 place count 232 transition count 289
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 210 place count 219 transition count 274
Iterating global reduction 2 with 13 rules applied. Total rules applied 223 place count 219 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 223 place count 219 transition count 273
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 225 place count 218 transition count 273
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 234 place count 209 transition count 262
Iterating global reduction 2 with 9 rules applied. Total rules applied 243 place count 209 transition count 262
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 251 place count 201 transition count 250
Iterating global reduction 2 with 8 rules applied. Total rules applied 259 place count 201 transition count 250
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 265 place count 195 transition count 242
Iterating global reduction 2 with 6 rules applied. Total rules applied 271 place count 195 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 273 place count 193 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 193 transition count 240
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 331 place count 165 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 333 place count 163 transition count 209
Iterating global reduction 2 with 2 rules applied. Total rules applied 335 place count 163 transition count 209
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 337 place count 161 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 161 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 340 place count 160 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 341 place count 160 transition count 205
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 343 place count 160 transition count 205
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 158 transition count 203
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 231 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 153 edges and 156 vertex of which 58 / 156 are part of one of the 29 SCC in 0 ms
Free SCC test removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 16 rules applied. Total rules applied 361 place count 127 transition count 189
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 44 rules applied. Total rules applied 405 place count 114 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 407 place count 112 transition count 158
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 407 place count 112 transition count 144
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 435 place count 98 transition count 144
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 445 place count 88 transition count 124
Iterating global reduction 5 with 10 rules applied. Total rules applied 455 place count 88 transition count 124
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 464 place count 79 transition count 106
Iterating global reduction 5 with 9 rules applied. Total rules applied 473 place count 79 transition count 106
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 482 place count 70 transition count 97
Iterating global reduction 5 with 9 rules applied. Total rules applied 491 place count 70 transition count 97
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 500 place count 61 transition count 79
Iterating global reduction 5 with 9 rules applied. Total rules applied 509 place count 61 transition count 79
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 518 place count 52 transition count 70
Iterating global reduction 5 with 9 rules applied. Total rules applied 527 place count 52 transition count 70
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 533 place count 46 transition count 64
Applied a total of 533 rules in 81 ms. Remains 46 /350 variables (removed 304) and now considering 64/400 (removed 336) transitions.
[2024-05-22 13:23:37] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 46 cols
[2024-05-22 13:23:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 13:23:37] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 13:23:37] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-22 13:23:37] [INFO ] Invariant cache hit.
[2024-05-22 13:23:37] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-22 13:23:37] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-22 13:23:37] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-22 13:23:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/93 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 7/100 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/101 variables, and 47 constraints, problems are : Problem set: 0 solved, 52 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/93 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 51/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 7/100 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/101 variables, and 99 constraints, problems are : Problem set: 0 solved, 52 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 973ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 973ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/350 places, 64/400 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1134 ms. Remains : 46/350 places, 64/400 transitions.
[2024-05-22 13:23:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:23:38] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:23:38] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-22 13:23:38] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:23:38] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:23:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8127570884278041025.gal : 1 ms
[2024-05-22 13:23:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality15128701406302618450.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/CTLCardinality8127570884278041025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15128701406302618450.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,1.56809e+09,0.124014,7940,2,801,5,26455,6,0,224,26964,0


Converting to forward existential form...Done !
original formula: AF((AG(((p31==0)&&(p432==1))) * E((p85!=1) U AF(((((p214==0)||(p154==1))||(p20==0))&&(p352!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((p31==0)&&(p432==1))))) * E((p85!=1) U !(EG(!(((((p214==0)||(p154==1))||(p20==0))&&(...180
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t11, t15, t17, t22, t23, t40, t44, t47, t51, t52, t54, t55, t56, t58, t60, t62, Inte...248
(forward)formula 0,0,2.67401,84684,1,0,448,394465,154,195,1479,628010,519
FORMULA DiscoveryGPU-PT-15b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 342 transition count 400
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 44 place count 306 transition count 362
Iterating global reduction 1 with 36 rules applied. Total rules applied 80 place count 306 transition count 362
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 94 place count 292 transition count 345
Iterating global reduction 1 with 14 rules applied. Total rules applied 108 place count 292 transition count 345
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 122 place count 278 transition count 331
Iterating global reduction 1 with 14 rules applied. Total rules applied 136 place count 278 transition count 331
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 148 place count 266 transition count 317
Iterating global reduction 1 with 12 rules applied. Total rules applied 160 place count 266 transition count 317
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 168 place count 258 transition count 303
Iterating global reduction 1 with 8 rules applied. Total rules applied 176 place count 258 transition count 303
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 184 place count 250 transition count 295
Iterating global reduction 1 with 8 rules applied. Total rules applied 192 place count 250 transition count 295
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 198 place count 244 transition count 289
Iterating global reduction 1 with 6 rules applied. Total rules applied 204 place count 244 transition count 289
Applied a total of 204 rules in 28 ms. Remains 244 /350 variables (removed 106) and now considering 289/400 (removed 111) transitions.
// Phase 1: matrix 289 rows 244 cols
[2024-05-22 13:23:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:23:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 13:23:41] [INFO ] Invariant cache hit.
[2024-05-22 13:23:41] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-22 13:23:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/533 variables, 244/246 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 13:23:46] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:23:47] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-22 13:23:48] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/533 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 270 constraints, problems are : Problem set: 0 solved, 288 unsolved in 14756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/533 variables, 244/270 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 288/558 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/533 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 533/533 variables, and 558 constraints, problems are : Problem set: 0 solved, 288 unsolved in 16753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 24/24 constraints]
After SMT, in 31624ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 31628ms
Starting structural reductions in LTL mode, iteration 1 : 244/350 places, 289/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31867 ms. Remains : 244/350 places, 289/400 transitions.
[2024-05-22 13:24:13] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:24:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:24:13] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-22 13:24:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:24:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:24:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality10605066322876654949.gal : 4 ms
[2024-05-22 13:24:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality5581694779402501423.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/CTLCardinality10605066322876654949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5581694779402501423.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:24:43] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:24:43] [INFO ] Applying decomposition
[2024-05-22 13:24:43] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4134966334000392529.txt' '-o' '/tmp/graph4134966334000392529.bin' '-w' '/tmp/graph4134966334000392529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4134966334000392529.bin' '-l' '-1' '-v' '-w' '/tmp/graph4134966334000392529.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:24:43] [INFO ] Decomposing Gal with order
[2024-05-22 13:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:24:43] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 13:24:43] [INFO ] Flatten gal took : 43 ms
[2024-05-22 13:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 7 ms.
[2024-05-22 13:24:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality18336966174318995954.gal : 5 ms
[2024-05-22 13:24:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality9233941591688692944.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/CTLCardinality18336966174318995954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9233941591688692944.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 342 transition count 400
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 44 place count 306 transition count 362
Iterating global reduction 1 with 36 rules applied. Total rules applied 80 place count 306 transition count 362
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 94 place count 292 transition count 345
Iterating global reduction 1 with 14 rules applied. Total rules applied 108 place count 292 transition count 345
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 122 place count 278 transition count 331
Iterating global reduction 1 with 14 rules applied. Total rules applied 136 place count 278 transition count 331
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 148 place count 266 transition count 317
Iterating global reduction 1 with 12 rules applied. Total rules applied 160 place count 266 transition count 317
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 169 place count 257 transition count 301
Iterating global reduction 1 with 9 rules applied. Total rules applied 178 place count 257 transition count 301
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 187 place count 248 transition count 292
Iterating global reduction 1 with 9 rules applied. Total rules applied 196 place count 248 transition count 292
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 203 place count 241 transition count 285
Iterating global reduction 1 with 7 rules applied. Total rules applied 210 place count 241 transition count 285
Applied a total of 210 rules in 30 ms. Remains 241 /350 variables (removed 109) and now considering 285/400 (removed 115) transitions.
// Phase 1: matrix 285 rows 241 cols
[2024-05-22 13:25:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 13:25:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 13:25:13] [INFO ] Invariant cache hit.
[2024-05-22 13:25:14] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 13:25:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/526 variables, 241/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 5 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:25:19] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:25:20] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:25:21] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:25:21] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:25:21] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 9/272 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 272 constraints, problems are : Problem set: 0 solved, 284 unsolved in 14757 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/526 variables, 241/272 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 284/556 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 556 constraints, problems are : Problem set: 0 solved, 284 unsolved in 16456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 29/29 constraints]
After SMT, in 31323ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31326ms
Starting structural reductions in LTL mode, iteration 1 : 241/350 places, 285/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31575 ms. Remains : 241/350 places, 285/400 transitions.
[2024-05-22 13:25:45] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:25:45] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:25:45] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-22 13:25:45] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:25:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:25:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8230495166023280516.gal : 2 ms
[2024-05-22 13:25:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality2369513889918098912.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/CTLCardinality8230495166023280516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2369513889918098912.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:26:15] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:26:15] [INFO ] Applying decomposition
[2024-05-22 13:26:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1464465373226549118.txt' '-o' '/tmp/graph1464465373226549118.bin' '-w' '/tmp/graph1464465373226549118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1464465373226549118.bin' '-l' '-1' '-v' '-w' '/tmp/graph1464465373226549118.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:26:15] [INFO ] Decomposing Gal with order
[2024-05-22 13:26:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:26:15] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 13:26:15] [INFO ] Flatten gal took : 15 ms
[2024-05-22 13:26:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2024-05-22 13:26:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality12477019362762558831.gal : 3 ms
[2024-05-22 13:26:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality6147874850824533372.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/CTLCardinality12477019362762558831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6147874850824533372.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 342 transition count 400
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 43 place count 307 transition count 363
Iterating global reduction 1 with 35 rules applied. Total rules applied 78 place count 307 transition count 363
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 91 place count 294 transition count 348
Iterating global reduction 1 with 13 rules applied. Total rules applied 104 place count 294 transition count 348
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 117 place count 281 transition count 335
Iterating global reduction 1 with 13 rules applied. Total rules applied 130 place count 281 transition count 335
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 141 place count 270 transition count 322
Iterating global reduction 1 with 11 rules applied. Total rules applied 152 place count 270 transition count 322
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 262 transition count 308
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 262 transition count 308
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 176 place count 254 transition count 300
Iterating global reduction 1 with 8 rules applied. Total rules applied 184 place count 254 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 190 place count 248 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 196 place count 248 transition count 294
Applied a total of 196 rules in 35 ms. Remains 248 /350 variables (removed 102) and now considering 294/400 (removed 106) transitions.
// Phase 1: matrix 294 rows 248 cols
[2024-05-22 13:26:45] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 13:26:45] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 13:26:45] [INFO ] Invariant cache hit.
[2024-05-22 13:26:45] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-22 13:26:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 294/542 variables, 248/250 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:26:51] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:26:52] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 0/542 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 272 constraints, problems are : Problem set: 0 solved, 293 unsolved in 15297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/542 variables, 248/272 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 293/565 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 0/542 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 565 constraints, problems are : Problem set: 0 solved, 293 unsolved in 15613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 22/22 constraints]
After SMT, in 31021ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 31025ms
Starting structural reductions in LTL mode, iteration 1 : 248/350 places, 294/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31290 ms. Remains : 248/350 places, 294/400 transitions.
[2024-05-22 13:27:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:27:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:27:16] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-22 13:27:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:27:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:27:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality10095080298478294923.gal : 1 ms
[2024-05-22 13:27:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality488265988151448133.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/CTLCardinality10095080298478294923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality488265988151448133.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:27:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:27:47] [INFO ] Applying decomposition
[2024-05-22 13:27:47] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3796781792994499647.txt' '-o' '/tmp/graph3796781792994499647.bin' '-w' '/tmp/graph3796781792994499647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3796781792994499647.bin' '-l' '-1' '-v' '-w' '/tmp/graph3796781792994499647.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:27:47] [INFO ] Decomposing Gal with order
[2024-05-22 13:27:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:27:47] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-22 13:27:47] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:27:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 2 ms.
[2024-05-22 13:27:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16456198254725674103.gal : 3 ms
[2024-05-22 13:27:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality5336266551402533476.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/CTLCardinality16456198254725674103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5336266551402533476.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 343 transition count 400
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 41 place count 309 transition count 365
Iterating global reduction 1 with 34 rules applied. Total rules applied 75 place count 309 transition count 365
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 298 transition count 351
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 298 transition count 351
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 108 place count 287 transition count 340
Iterating global reduction 1 with 11 rules applied. Total rules applied 119 place count 287 transition count 340
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 129 place count 277 transition count 328
Iterating global reduction 1 with 10 rules applied. Total rules applied 139 place count 277 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 270 transition count 316
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 270 transition count 316
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 160 place count 263 transition count 309
Iterating global reduction 1 with 7 rules applied. Total rules applied 167 place count 263 transition count 309
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 172 place count 258 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 177 place count 258 transition count 304
Applied a total of 177 rules in 22 ms. Remains 258 /350 variables (removed 92) and now considering 304/400 (removed 96) transitions.
// Phase 1: matrix 304 rows 258 cols
[2024-05-22 13:28:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:28:17] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 13:28:17] [INFO ] Invariant cache hit.
[2024-05-22 13:28:17] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-05-22 13:28:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 304/561 variables, 257/259 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:28:23] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:28:24] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:28:25] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:28:25] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 286 constraints, problems are : Problem set: 0 solved, 303 unsolved in 20380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 304/561 variables, 257/285 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 302/587 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 0/562 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 589 constraints, problems are : Problem set: 0 solved, 303 unsolved in 27138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 26/26 constraints]
After SMT, in 47631ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 47635ms
Starting structural reductions in LTL mode, iteration 1 : 258/350 places, 304/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47879 ms. Remains : 258/350 places, 304/400 transitions.
[2024-05-22 13:29:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 13:29:05] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:29:05] [INFO ] Input system was already deterministic with 304 transitions.
[2024-05-22 13:29:05] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:29:05] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:29:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality3832617583678403150.gal : 2 ms
[2024-05-22 13:29:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1857359327648501245.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/CTLCardinality3832617583678403150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1857359327648501245.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:29:35] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:29:35] [INFO ] Applying decomposition
[2024-05-22 13:29:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph579393922800429130.txt' '-o' '/tmp/graph579393922800429130.bin' '-w' '/tmp/graph579393922800429130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph579393922800429130.bin' '-l' '-1' '-v' '-w' '/tmp/graph579393922800429130.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:29:35] [INFO ] Decomposing Gal with order
[2024-05-22 13:29:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:29:35] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-22 13:29:35] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:29:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-22 13:29:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality1792633118789786717.gal : 3 ms
[2024-05-22 13:29:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality1220096222573585542.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/CTLCardinality1792633118789786717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1220096222573585542.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 : 350/350 places, 400/400 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 342 transition count 400
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 44 place count 306 transition count 362
Iterating global reduction 1 with 36 rules applied. Total rules applied 80 place count 306 transition count 362
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 94 place count 292 transition count 345
Iterating global reduction 1 with 14 rules applied. Total rules applied 108 place count 292 transition count 345
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 122 place count 278 transition count 331
Iterating global reduction 1 with 14 rules applied. Total rules applied 136 place count 278 transition count 331
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 148 place count 266 transition count 317
Iterating global reduction 1 with 12 rules applied. Total rules applied 160 place count 266 transition count 317
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 169 place count 257 transition count 301
Iterating global reduction 1 with 9 rules applied. Total rules applied 178 place count 257 transition count 301
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 187 place count 248 transition count 292
Iterating global reduction 1 with 9 rules applied. Total rules applied 196 place count 248 transition count 292
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 203 place count 241 transition count 285
Iterating global reduction 1 with 7 rules applied. Total rules applied 210 place count 241 transition count 285
Applied a total of 210 rules in 25 ms. Remains 241 /350 variables (removed 109) and now considering 285/400 (removed 115) transitions.
// Phase 1: matrix 285 rows 241 cols
[2024-05-22 13:30:05] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 13:30:05] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 13:30:05] [INFO ] Invariant cache hit.
[2024-05-22 13:30:05] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 13:30:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/526 variables, 241/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 13:30:10] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-22 13:30:10] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:30:10] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:30:10] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:30:10] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:30:10] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:30:10] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-22 13:30:11] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:30:12] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 10/273 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 273 constraints, problems are : Problem set: 0 solved, 284 unsolved in 14611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/526 variables, 241/273 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 284/557 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 557 constraints, problems are : Problem set: 0 solved, 284 unsolved in 16355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 30/30 constraints]
After SMT, in 31074ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31077ms
Starting structural reductions in LTL mode, iteration 1 : 241/350 places, 285/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31321 ms. Remains : 241/350 places, 285/400 transitions.
[2024-05-22 13:30:36] [INFO ] Flatten gal took : 14 ms
[2024-05-22 13:30:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:30:36] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-22 13:30:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:30:36] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:30:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality672516212399059311.gal : 2 ms
[2024-05-22 13:30:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15514626294345507053.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/CTLCardinality672516212399059311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15514626294345507053.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:31:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:31:06] [INFO ] Applying decomposition
[2024-05-22 13:31:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7827914953709090129.txt' '-o' '/tmp/graph7827914953709090129.bin' '-w' '/tmp/graph7827914953709090129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7827914953709090129.bin' '-l' '-1' '-v' '-w' '/tmp/graph7827914953709090129.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:31:06] [INFO ] Decomposing Gal with order
[2024-05-22 13:31:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:31:06] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-22 13:31:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:31:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 2 ms.
[2024-05-22 13:31:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality7246116812078433176.gal : 3 ms
[2024-05-22 13:31:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6825286429871034757.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/CTLCardinality7246116812078433176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6825286429871034757.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 : 350/350 places, 400/400 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 342 transition count 400
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 39 place count 311 transition count 367
Iterating global reduction 1 with 31 rules applied. Total rules applied 70 place count 311 transition count 367
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 83 place count 298 transition count 352
Iterating global reduction 1 with 13 rules applied. Total rules applied 96 place count 298 transition count 352
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 109 place count 285 transition count 339
Iterating global reduction 1 with 13 rules applied. Total rules applied 122 place count 285 transition count 339
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 274 transition count 326
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 274 transition count 326
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 151 place count 267 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 158 place count 267 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 165 place count 260 transition count 307
Iterating global reduction 1 with 7 rules applied. Total rules applied 172 place count 260 transition count 307
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 177 place count 255 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 182 place count 255 transition count 302
Applied a total of 182 rules in 20 ms. Remains 255 /350 variables (removed 95) and now considering 302/400 (removed 98) transitions.
// Phase 1: matrix 302 rows 255 cols
[2024-05-22 13:31:36] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 13:31:36] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 13:31:36] [INFO ] Invariant cache hit.
[2024-05-22 13:31:37] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-22 13:31:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 302/557 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-22 13:31:42] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-22 13:31:42] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-22 13:31:43] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:31:44] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:31:44] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:31:44] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:31:44] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-22 13:31:44] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-22 13:31:44] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:31:44] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 0/557 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 280 constraints, problems are : Problem set: 0 solved, 301 unsolved in 16229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/557 variables, 255/280 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 301/581 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 0/557 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 581 constraints, problems are : Problem set: 0 solved, 301 unsolved in 16888 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 23/23 constraints]
After SMT, in 33218ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 33222ms
Starting structural reductions in LTL mode, iteration 1 : 255/350 places, 302/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33470 ms. Remains : 255/350 places, 302/400 transitions.
[2024-05-22 13:32:10] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:32:10] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:32:10] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-22 13:32:10] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:32:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:32:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality3934352892922855891.gal : 2 ms
[2024-05-22 13:32:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality8424568749969988487.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/CTLCardinality3934352892922855891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8424568749969988487.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:32:40] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:32:40] [INFO ] Applying decomposition
[2024-05-22 13:32:40] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14264024279955726194.txt' '-o' '/tmp/graph14264024279955726194.bin' '-w' '/tmp/graph14264024279955726194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14264024279955726194.bin' '-l' '-1' '-v' '-w' '/tmp/graph14264024279955726194.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:32:40] [INFO ] Decomposing Gal with order
[2024-05-22 13:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:32:40] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-22 13:32:40] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 2 ms.
[2024-05-22 13:32:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality11256331733991755367.gal : 2 ms
[2024-05-22 13:32:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality10824093734879434226.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/CTLCardinality11256331733991755367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10824093734879434226.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 : 350/350 places, 400/400 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 343 transition count 400
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 42 place count 308 transition count 363
Iterating global reduction 1 with 35 rules applied. Total rules applied 77 place count 308 transition count 363
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 89 place count 296 transition count 348
Iterating global reduction 1 with 12 rules applied. Total rules applied 101 place count 296 transition count 348
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 113 place count 284 transition count 336
Iterating global reduction 1 with 12 rules applied. Total rules applied 125 place count 284 transition count 336
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 134 place count 275 transition count 325
Iterating global reduction 1 with 9 rules applied. Total rules applied 143 place count 275 transition count 325
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 150 place count 268 transition count 313
Iterating global reduction 1 with 7 rules applied. Total rules applied 157 place count 268 transition count 313
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 163 place count 262 transition count 307
Iterating global reduction 1 with 6 rules applied. Total rules applied 169 place count 262 transition count 307
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 173 place count 258 transition count 303
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 258 transition count 303
Applied a total of 177 rules in 19 ms. Remains 258 /350 variables (removed 92) and now considering 303/400 (removed 97) transitions.
// Phase 1: matrix 303 rows 258 cols
[2024-05-22 13:33:10] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 13:33:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 13:33:10] [INFO ] Invariant cache hit.
[2024-05-22 13:33:10] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-05-22 13:33:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 303/560 variables, 257/259 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-22 13:33:16] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-22 13:33:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:33:16] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:33:16] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:33:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:33:16] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:33:16] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:33:16] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:33:17] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:33:18] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 11/290 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/561 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/561 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 291 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 303/560 variables, 257/290 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 301/591 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/561 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (OVERLAPS) 0/561 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 593 constraints, problems are : Problem set: 0 solved, 302 unsolved in 27854 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 31/31 constraints]
After SMT, in 48499ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 48502ms
Starting structural reductions in LTL mode, iteration 1 : 258/350 places, 303/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48745 ms. Remains : 258/350 places, 303/400 transitions.
[2024-05-22 13:33:59] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:33:59] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:33:59] [INFO ] Input system was already deterministic with 303 transitions.
[2024-05-22 13:33:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:33:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:33:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality16739931309395856494.gal : 2 ms
[2024-05-22 13:33:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3262591576625896082.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/CTLCardinality16739931309395856494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3262591576625896082.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Graph (complete) has 665 edges and 350 vertex of which 330 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 329 transition count 326
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 269 transition count 326
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 121 place count 269 transition count 284
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 205 place count 227 transition count 284
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 220 place count 212 transition count 267
Iterating global reduction 2 with 15 rules applied. Total rules applied 235 place count 212 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 235 place count 212 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 211 transition count 266
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 248 place count 200 transition count 253
Iterating global reduction 2 with 11 rules applied. Total rules applied 259 place count 200 transition count 253
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 268 place count 191 transition count 239
Iterating global reduction 2 with 9 rules applied. Total rules applied 277 place count 191 transition count 239
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 284 place count 184 transition count 230
Iterating global reduction 2 with 7 rules applied. Total rules applied 291 place count 184 transition count 230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 293 place count 182 transition count 228
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 182 transition count 228
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 349 place count 155 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 153 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 153 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 355 place count 151 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 151 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 358 place count 150 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 150 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 148 transition count 192
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 176 edges and 146 vertex of which 142 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 155 edges and 142 vertex of which 58 / 142 are part of one of the 29 SCC in 0 ms
Free SCC test removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 2 with 51 rules applied. Total rules applied 412 place count 113 transition count 140
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 79 rules applied. Total rules applied 491 place count 66 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 493 place count 64 transition count 108
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 506 place count 51 transition count 82
Iterating global reduction 5 with 13 rules applied. Total rules applied 519 place count 51 transition count 82
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 532 place count 38 transition count 56
Iterating global reduction 5 with 13 rules applied. Total rules applied 545 place count 38 transition count 56
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 557 place count 26 transition count 32
Iterating global reduction 5 with 12 rules applied. Total rules applied 569 place count 26 transition count 32
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 581 place count 14 transition count 20
Iterating global reduction 5 with 12 rules applied. Total rules applied 593 place count 14 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 594 place count 14 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 596 place count 13 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 599 place count 10 transition count 15
Applied a total of 599 rules in 46 ms. Remains 10 /350 variables (removed 340) and now considering 15/400 (removed 385) transitions.
[2024-05-22 13:34:59] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 10 cols
[2024-05-22 13:34:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 13:34:59] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 13:34:59] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2024-05-22 13:34:59] [INFO ] Invariant cache hit.
[2024-05-22 13:34:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-22 13:34:59] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-22 13:34:59] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2024-05-22 13:34:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/21 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 51 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/21 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 48 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/350 places, 15/400 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 182 ms. Remains : 10/350 places, 15/400 transitions.
[2024-05-22 13:34:59] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:34:59] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:34:59] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-22 13:34:59] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:34:59] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:34:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality2786444265148696749.gal : 1 ms
[2024-05-22 13:34:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12739061776593344182.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/CTLCardinality2786444265148696749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12739061776593344182.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,2604,0.004558,3372,2,40,5,513,6,0,47,656,0


Converting to forward existential form...Done !
original formula: AG(AF(EG(A((p336==1) U (p262==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((E(!((p262==0)) U (!((p336==1)) * !((p262==0)))) + EG(!((p262==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.037156,5276,1,0,367,10213,63,256,292,14723,414
FORMULA DiscoveryGPU-PT-15b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 344 transition count 400
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 33 place count 317 transition count 372
Iterating global reduction 1 with 27 rules applied. Total rules applied 60 place count 317 transition count 372
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 71 place count 306 transition count 359
Iterating global reduction 1 with 11 rules applied. Total rules applied 82 place count 306 transition count 359
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 295 transition count 348
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 295 transition count 348
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 285 transition count 337
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 285 transition count 337
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 132 place count 277 transition count 322
Iterating global reduction 1 with 8 rules applied. Total rules applied 140 place count 277 transition count 322
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 148 place count 269 transition count 314
Iterating global reduction 1 with 8 rules applied. Total rules applied 156 place count 269 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 163 place count 262 transition count 307
Iterating global reduction 1 with 7 rules applied. Total rules applied 170 place count 262 transition count 307
Applied a total of 170 rules in 21 ms. Remains 262 /350 variables (removed 88) and now considering 307/400 (removed 93) transitions.
// Phase 1: matrix 307 rows 262 cols
[2024-05-22 13:34:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 13:34:59] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 13:34:59] [INFO ] Invariant cache hit.
[2024-05-22 13:34:59] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-05-22 13:34:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/567 variables, 260/262 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:35:06] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:35:07] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:35:08] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:35:08] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 2/569 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/569 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 292 constraints, problems are : Problem set: 0 solved, 306 unsolved in 21126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/567 variables, 260/290 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 304/594 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 2/569 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/569 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 598 constraints, problems are : Problem set: 0 solved, 306 unsolved in 26806 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 28/28 constraints]
After SMT, in 48048ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 48052ms
Starting structural reductions in LTL mode, iteration 1 : 262/350 places, 307/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48288 ms. Remains : 262/350 places, 307/400 transitions.
[2024-05-22 13:35:48] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:48] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:35:48] [INFO ] Input system was already deterministic with 307 transitions.
[2024-05-22 13:35:48] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:35:48] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality15981460971962573490.gal : 3 ms
[2024-05-22 13:35:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11943543613961603384.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/CTLCardinality15981460971962573490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11943543613961603384.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:36:18] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:36:18] [INFO ] Applying decomposition
[2024-05-22 13:36:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12220447918919587171.txt' '-o' '/tmp/graph12220447918919587171.bin' '-w' '/tmp/graph12220447918919587171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12220447918919587171.bin' '-l' '-1' '-v' '-w' '/tmp/graph12220447918919587171.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:36:18] [INFO ] Decomposing Gal with order
[2024-05-22 13:36:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:36:18] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-22 13:36:18] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:36:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 2 ms.
[2024-05-22 13:36:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17571440547902228550.gal : 3 ms
[2024-05-22 13:36:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality16590996753846838284.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/CTLCardinality17571440547902228550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16590996753846838284.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 : 350/350 places, 400/400 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 343 transition count 400
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 43 place count 307 transition count 362
Iterating global reduction 1 with 36 rules applied. Total rules applied 79 place count 307 transition count 362
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 92 place count 294 transition count 346
Iterating global reduction 1 with 13 rules applied. Total rules applied 105 place count 294 transition count 346
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 118 place count 281 transition count 333
Iterating global reduction 1 with 13 rules applied. Total rules applied 131 place count 281 transition count 333
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 142 place count 270 transition count 320
Iterating global reduction 1 with 11 rules applied. Total rules applied 153 place count 270 transition count 320
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 161 place count 262 transition count 306
Iterating global reduction 1 with 8 rules applied. Total rules applied 169 place count 262 transition count 306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 177 place count 254 transition count 298
Iterating global reduction 1 with 8 rules applied. Total rules applied 185 place count 254 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 191 place count 248 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 197 place count 248 transition count 292
Applied a total of 197 rules in 24 ms. Remains 248 /350 variables (removed 102) and now considering 292/400 (removed 108) transitions.
// Phase 1: matrix 292 rows 248 cols
[2024-05-22 13:36:48] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 13:36:48] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 13:36:48] [INFO ] Invariant cache hit.
[2024-05-22 13:36:48] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-22 13:36:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 292/539 variables, 247/249 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 13:36:53] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-22 13:36:53] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:36:53] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:36:53] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 3 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:36:54] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:36:55] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/540 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/540 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 278 constraints, problems are : Problem set: 0 solved, 291 unsolved in 19353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/539 variables, 247/277 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 290/567 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/540 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (OVERLAPS) 0/540 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 569 constraints, problems are : Problem set: 0 solved, 291 unsolved in 26379 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 28/28 constraints]
After SMT, in 45829ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 45834ms
Starting structural reductions in LTL mode, iteration 1 : 248/350 places, 292/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46079 ms. Remains : 248/350 places, 292/400 transitions.
[2024-05-22 13:37:34] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:37:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:37:34] [INFO ] Input system was already deterministic with 292 transitions.
[2024-05-22 13:37:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 13:37:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:37:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9507641062766963488.gal : 1 ms
[2024-05-22 13:37:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality7325964662627260317.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/CTLCardinality9507641062766963488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7325964662627260317.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 400/400 transitions.
Graph (complete) has 665 edges and 350 vertex of which 328 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 327 transition count 332
Reduce places removed 53 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 274 transition count 329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 271 transition count 329
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 113 place count 271 transition count 287
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 197 place count 229 transition count 287
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 212 place count 214 transition count 270
Iterating global reduction 3 with 15 rules applied. Total rules applied 227 place count 214 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 227 place count 214 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 213 transition count 269
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 238 place count 204 transition count 259
Iterating global reduction 3 with 9 rules applied. Total rules applied 247 place count 204 transition count 259
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 254 place count 197 transition count 248
Iterating global reduction 3 with 7 rules applied. Total rules applied 261 place count 197 transition count 248
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 267 place count 191 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 273 place count 191 transition count 240
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 275 place count 189 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 189 transition count 238
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 323 place count 166 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 325 place count 164 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 164 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 329 place count 162 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 162 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 332 place count 161 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 161 transition count 208
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 335 place count 161 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 337 place count 159 transition count 206
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 15 rules applied. Total rules applied 352 place count 158 transition count 192
Reduce places removed 14 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 4 with 16 rules applied. Total rules applied 368 place count 144 transition count 190
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 370 place count 143 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 371 place count 142 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 371 place count 142 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 373 place count 141 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 375 place count 140 transition count 187
Applied a total of 375 rules in 51 ms. Remains 140 /350 variables (removed 210) and now considering 187/400 (removed 213) transitions.
// Phase 1: matrix 187 rows 140 cols
[2024-05-22 13:38:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 13:38:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 13:38:34] [INFO ] Invariant cache hit.
[2024-05-22 13:38:34] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-22 13:38:34] [INFO ] Redundant transitions in 8 ms returned []
Running 172 sub problems to find dead transitions.
[2024-05-22 13:38:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 187/312 variables, 125/126 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 15/327 variables, 15/141 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 141 constraints, problems are : Problem set: 0 solved, 172 unsolved in 4065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 187/312 variables, 125/126 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 172/298 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 15/327 variables, 15/313 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/327 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 313 constraints, problems are : Problem set: 0 solved, 172 unsolved in 4095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
After SMT, in 8185ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 8187ms
Starting structural reductions in SI_CTL mode, iteration 1 : 140/350 places, 187/400 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8394 ms. Remains : 140/350 places, 187/400 transitions.
[2024-05-22 13:38:42] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:38:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:38:42] [INFO ] Input system was already deterministic with 187 transitions.
[2024-05-22 13:38:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:38:42] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:38:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality4809109392913703693.gal : 1 ms
[2024-05-22 13:38:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12677721040462525674.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/CTLCardinality4809109392913703693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12677721040462525674.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.15946e+15,6.71519,195392,2,49290,5,1.21832e+06,6,0,720,829883,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 13:39:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:39:13] [INFO ] Applying decomposition
[2024-05-22 13:39:13] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1125080251156728902.txt' '-o' '/tmp/graph1125080251156728902.bin' '-w' '/tmp/graph1125080251156728902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1125080251156728902.bin' '-l' '-1' '-v' '-w' '/tmp/graph1125080251156728902.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:39:13] [INFO ] Decomposing Gal with order
[2024-05-22 13:39:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:39:13] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-22 13:39:13] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:39:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 2 ms.
[2024-05-22 13:39:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality1123485549924141833.gal : 2 ms
[2024-05-22 13:39:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality3453008446998083518.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/CTLCardinality1123485549924141833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3453008446998083518.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,5.15946e+15,1.36192,53684,2067,198,104278,1697,380,215690,62,11173,0


Converting to forward existential form...Done !
original formula: AF(((((i0.u2.p39==0)||(i1.u3.p49==1)) + AF((i7.u20.p164==1))) * ((EF((i14.i0.u41.p340==1)) + AF(((EF(((i14.i0.u51.p423==0)||(i6.u18.p176=...334
=> equivalent forward existential formula: [FwdG(Init,!(((((i0.u2.p39==0)||(i1.u3.p49==1)) + !(EG(!((i7.u20.p164==1))))) * ((E(TRUE U (i14.i0.u41.p340==1))...409
Reverse transition relation is NOT exact ! Due to transitions t122, t175, t176, t177, t178, t179, t180, t181, t182, t183, t184, t185, i0.u1.t84, i1.t186, i...485
Detected timeout of ITS tools.
[2024-05-22 13:39:43] [INFO ] Flatten gal took : 10 ms
[2024-05-22 13:39:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:39:43] [INFO ] Applying decomposition
[2024-05-22 13:39:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4092858806856574342.txt' '-o' '/tmp/graph4092858806856574342.bin' '-w' '/tmp/graph4092858806856574342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4092858806856574342.bin' '-l' '-1' '-v' '-w' '/tmp/graph4092858806856574342.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:39:43] [INFO ] Decomposing Gal with order
[2024-05-22 13:39:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:39:43] [INFO ] Removed a total of 135 redundant transitions.
[2024-05-22 13:39:43] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:39:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 13:39:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13930266725759848745.gal : 3 ms
[2024-05-22 13:39:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8827460444429601588.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/CTLCardinality13930266725759848745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8827460444429601588.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 13:53:06] [INFO ] Applying decomposition
[2024-05-22 13:53:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:53:06] [INFO ] Decomposing Gal with order
[2024-05-22 13:53:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:53:06] [INFO ] Removed a total of 142 redundant transitions.
[2024-05-22 13:53:06] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:53:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1084 labels/synchronizations in 18 ms.
[2024-05-22 13:53:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12924407833289631135.gal : 2 ms
[2024-05-22 13:53:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality17719415357422804645.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12924407833289631135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17719415357422804645.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 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 14:06:14] [INFO ] Flatten gal took : 12 ms
[2024-05-22 14:06:14] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-22 14:06:14] [INFO ] Transformed 350 places.
[2024-05-22 14:06:14] [INFO ] Transformed 400 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 14:06:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality17813751747625349680.gal : 1 ms
[2024-05-22 14:06:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13837550305881547098.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/CTLCardinality17813751747625349680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13837550305881547098.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3276216 ms.

BK_STOP 1716387431649

--------------------
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="DiscoveryGPU-PT-15b"
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 DiscoveryGPU-PT-15b, 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 r136-tall-171631132800513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15b.tgz
mv DiscoveryGPU-PT-15b 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 ;