About the Execution of ITS-Tools for StigmergyCommit-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3533845.00 | 0.00 | 0.00 | ???T????TF??T?F? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531900233.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-11a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531900233
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 464M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-11a-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717002320532
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 17:05:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 17:05:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:05:39] [INFO ] Load time of PNML (sax parser for PT used): 16946 ms
[2024-05-29 17:05:39] [INFO ] Transformed 436 places.
[2024-05-29 17:05:41] [INFO ] Transformed 373236 transitions.
[2024-05-29 17:05:41] [INFO ] Found NUPN structural information;
[2024-05-29 17:05:41] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 19198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
Support contains 94 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 377 transition count 8693
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 377 transition count 8693
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 125 place count 377 transition count 8686
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 143 place count 359 transition count 8666
Iterating global reduction 1 with 18 rules applied. Total rules applied 161 place count 359 transition count 8666
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 165 place count 359 transition count 8662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 358 transition count 8661
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 358 transition count 8661
Applied a total of 167 rules in 244 ms. Remains 358 /436 variables (removed 78) and now considering 8661/8758 (removed 97) transitions.
[2024-05-29 17:05:43] [INFO ] Flow matrix only has 8638 transitions (discarded 23 similar events)
// Phase 1: matrix 8638 rows 358 cols
[2024-05-29 17:05:43] [INFO ] Computed 6 invariants in 114 ms
[2024-05-29 17:05:46] [INFO ] Implicit Places using invariants in 2945 ms returned []
[2024-05-29 17:05:46] [INFO ] Flow matrix only has 8638 transitions (discarded 23 similar events)
[2024-05-29 17:05:46] [INFO ] Invariant cache hit.
[2024-05-29 17:05:49] [INFO ] State equation strengthened by 8341 read => feed constraints.
[2024-05-29 17:05:59] [INFO ] Implicit Places using invariants and state equation in 13482 ms returned [357]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 16482 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 357/436 places, 8661/8758 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 343 transition count 8647
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 343 transition count 8647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 343 transition count 8645
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 335 transition count 8637
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 335 transition count 8637
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 329 transition count 8631
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 329 transition count 8631
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 326 transition count 8628
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 326 transition count 8628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 323 transition count 8625
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 323 transition count 8625
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 321 transition count 8623
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 321 transition count 8623
Applied a total of 74 rules in 311 ms. Remains 321 /357 variables (removed 36) and now considering 8623/8661 (removed 38) transitions.
[2024-05-29 17:06:00] [INFO ] Flow matrix only has 8600 transitions (discarded 23 similar events)
// Phase 1: matrix 8600 rows 321 cols
[2024-05-29 17:06:00] [INFO ] Computed 5 invariants in 61 ms
[2024-05-29 17:06:02] [INFO ] Implicit Places using invariants in 2540 ms returned []
[2024-05-29 17:06:02] [INFO ] Flow matrix only has 8600 transitions (discarded 23 similar events)
[2024-05-29 17:06:02] [INFO ] Invariant cache hit.
[2024-05-29 17:06:05] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:06:09] [INFO ] Implicit Places using invariants and state equation in 6800 ms returned []
Implicit Place search using SMT with State Equation took 9357 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 321/436 places, 8623/8758 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26416 ms. Remains : 321/436 places, 8623/8758 transitions.
Support contains 94 out of 321 places after structural reductions.
[2024-05-29 17:06:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 17:06:11] [INFO ] Flatten gal took : 917 ms
FORMULA StigmergyCommit-PT-11a-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 17:06:11] [INFO ] Flatten gal took : 720 ms
[2024-05-29 17:06:13] [INFO ] Input system was already deterministic with 8623 transitions.
Support contains 78 out of 321 places (down from 94) after GAL structural reductions.
FORMULA StigmergyCommit-PT-11a-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9 resets) in 39071 ms. (1 steps per ms) remains 33/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
[2024-05-29 17:06:23] [INFO ] Flow matrix only has 8600 transitions (discarded 23 similar events)
[2024-05-29 17:06:23] [INFO ] Invariant cache hit.
[2024-05-29 17:06:25] [INFO ] State equation strengthened by 8201 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 268/321 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 8599/8920 variables, 321/326 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8920 variables, 8200/8526 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8920/8921 variables, and 8526 constraints, problems are : Problem set: 0 solved, 33 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 321/321 constraints, ReadFeed: 8200/8201 constraints, PredecessorRefiner: 33/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 268/321 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 17:06:34] [INFO ] Deduced a trap composed of 13 places in 3486 ms of which 29 ms to minimize.
[2024-05-29 17:06:37] [INFO ] Deduced a trap composed of 17 places in 3368 ms of which 4 ms to minimize.
SMT process timed out in 14056ms, After SMT, problems are : Problem set: 0 solved, 33 unsolved
Fused 33 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 8623/8623 transitions.
Graph (complete) has 840 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.63 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 153 rules applied. Total rules applied 154 place count 320 transition count 8469
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 1 with 155 rules applied. Total rules applied 309 place count 198 transition count 8436
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 29 rules applied. Total rules applied 338 place count 184 transition count 8421
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 351 place count 171 transition count 8421
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 351 place count 171 transition count 8413
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 367 place count 163 transition count 8413
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 386 place count 144 transition count 8392
Iterating global reduction 4 with 19 rules applied. Total rules applied 405 place count 144 transition count 8392
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 420 place count 144 transition count 8377
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 422 place count 142 transition count 8375
Iterating global reduction 5 with 2 rules applied. Total rules applied 424 place count 142 transition count 8375
Performed 37 Post agglomeration using F-continuation condition with reduction of 7168 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 498 place count 105 transition count 1170
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 867 transitions
Reduce isomorphic transitions removed 880 transitions.
Iterating post reduction 5 with 880 rules applied. Total rules applied 1378 place count 105 transition count 290
Performed 3 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1384 place count 102 transition count 271
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 6 with 75 rules applied. Total rules applied 1459 place count 102 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 7 with 65 rules applied. Total rules applied 1524 place count 102 transition count 131
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 1535 place count 102 transition count 120
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1546 place count 91 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1547 place count 91 transition count 119
Applied a total of 1547 rules in 878 ms. Remains 91 /321 variables (removed 230) and now considering 119/8623 (removed 8504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 879 ms. Remains : 91/321 places, 119/8623 transitions.
RANDOM walk for 40000 steps (407 resets) in 263 ms. (151 steps per ms) remains 2/33 properties
BEST_FIRST walk for 40003 steps (35 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
// Phase 1: matrix 119 rows 91 cols
[2024-05-29 17:06:38] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 17:06:38] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/91 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/210 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 25/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 128 constraints, problems are : Problem set: 0 solved, 2 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 91/91 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 51/210 variables, and 9 constraints, problems are : Problem set: 2 solved, 0 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 6/12 constraints, State Equation: 0/91 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 210ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-29 17:06:39] [INFO ] Flatten gal took : 578 ms
[2024-05-29 17:06:39] [INFO ] Flatten gal took : 610 ms
[2024-05-29 17:06:41] [INFO ] Input system was already deterministic with 8623 transitions.
Computed a total of 43 stabilizing places and 43 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 8623/8623 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 260 transition count 8553
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 260 transition count 8553
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 134 place count 260 transition count 8541
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 176 place count 218 transition count 8494
Iterating global reduction 1 with 42 rules applied. Total rules applied 218 place count 218 transition count 8494
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 229 place count 218 transition count 8483
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 255 place count 192 transition count 8457
Iterating global reduction 2 with 26 rules applied. Total rules applied 281 place count 192 transition count 8457
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 192 transition count 8456
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 299 place count 175 transition count 8439
Iterating global reduction 3 with 17 rules applied. Total rules applied 316 place count 175 transition count 8439
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 318 place count 175 transition count 8437
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 332 place count 161 transition count 8423
Iterating global reduction 4 with 14 rules applied. Total rules applied 346 place count 161 transition count 8423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 348 place count 161 transition count 8421
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 358 place count 151 transition count 8411
Iterating global reduction 5 with 10 rules applied. Total rules applied 368 place count 151 transition count 8411
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 375 place count 151 transition count 8404
Applied a total of 375 rules in 239 ms. Remains 151 /321 variables (removed 170) and now considering 8404/8623 (removed 219) transitions.
[2024-05-29 17:06:41] [INFO ] Flow matrix only has 8390 transitions (discarded 14 similar events)
// Phase 1: matrix 8390 rows 151 cols
[2024-05-29 17:06:41] [INFO ] Computed 1 invariants in 59 ms
[2024-05-29 17:06:44] [INFO ] Implicit Places using invariants in 2740 ms returned []
[2024-05-29 17:06:44] [INFO ] Flow matrix only has 8390 transitions (discarded 14 similar events)
[2024-05-29 17:06:44] [INFO ] Invariant cache hit.
[2024-05-29 17:06:47] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:06:50] [INFO ] Implicit Places using invariants and state equation in 6499 ms returned []
Implicit Place search using SMT with State Equation took 9244 ms to find 0 implicit places.
Running 8403 sub problems to find dead transitions.
[2024-05-29 17:06:51] [INFO ] Flow matrix only has 8390 transitions (discarded 14 similar events)
[2024-05-29 17:06:51] [INFO ] Invariant cache hit.
[2024-05-29 17:06:52] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8403 unsolved in 30199 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8403/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8403 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 204137ms problems are : Problem set: 0 solved, 8403 unsolved
Search for dead transitions found 0 dead transitions in 204297ms
Starting structural reductions in LTL mode, iteration 1 : 151/321 places, 8404/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213829 ms. Remains : 151/321 places, 8404/8623 transitions.
[2024-05-29 17:10:15] [INFO ] Flatten gal took : 541 ms
[2024-05-29 17:10:16] [INFO ] Flatten gal took : 575 ms
[2024-05-29 17:10:17] [INFO ] Input system was already deterministic with 8404 transitions.
[2024-05-29 17:10:18] [INFO ] Flatten gal took : 601 ms
[2024-05-29 17:10:18] [INFO ] Flatten gal took : 566 ms
[2024-05-29 17:10:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality16795573794609341774.gal : 229 ms
[2024-05-29 17:10:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality18020103641492007116.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16795573794609341774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18020103641492007116.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:10:49] [INFO ] Flatten gal took : 572 ms
[2024-05-29 17:10:49] [INFO ] Applying decomposition
[2024-05-29 17:10:50] [INFO ] Flatten gal took : 585 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/graph14121742603806736024.txt' '-o' '/tmp/graph14121742603806736024.bin' '-w' '/tmp/graph14121742603806736024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14121742603806736024.bin' '-l' '-1' '-v' '-w' '/tmp/graph14121742603806736024.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:10:53] [INFO ] Decomposing Gal with order
[2024-05-29 17:10:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:10:55] [INFO ] Removed a total of 98415 redundant transitions.
[2024-05-29 17:10:55] [INFO ] Flatten gal took : 2095 ms
[2024-05-29 17:10:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 730 ms.
[2024-05-29 17:10:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality12702957708890063970.gal : 90 ms
[2024-05-29 17:10:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12894910321198403070.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/CTLCardinality12702957708890063970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12894910321198403070.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 : 321/321 places, 8623/8623 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 262 transition count 8554
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 262 transition count 8554
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 130 place count 262 transition count 8542
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 169 place count 223 transition count 8497
Iterating global reduction 1 with 39 rules applied. Total rules applied 208 place count 223 transition count 8497
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 217 place count 223 transition count 8488
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 242 place count 198 transition count 8463
Iterating global reduction 2 with 25 rules applied. Total rules applied 267 place count 198 transition count 8463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 268 place count 198 transition count 8462
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 283 place count 183 transition count 8447
Iterating global reduction 3 with 15 rules applied. Total rules applied 298 place count 183 transition count 8447
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 300 place count 183 transition count 8445
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 311 place count 172 transition count 8434
Iterating global reduction 4 with 11 rules applied. Total rules applied 322 place count 172 transition count 8434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 324 place count 172 transition count 8432
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 331 place count 165 transition count 8425
Iterating global reduction 5 with 7 rules applied. Total rules applied 338 place count 165 transition count 8425
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 341 place count 165 transition count 8422
Applied a total of 341 rules in 237 ms. Remains 165 /321 variables (removed 156) and now considering 8422/8623 (removed 201) transitions.
[2024-05-29 17:11:27] [INFO ] Flow matrix only has 8409 transitions (discarded 13 similar events)
// Phase 1: matrix 8409 rows 165 cols
[2024-05-29 17:11:27] [INFO ] Computed 1 invariants in 54 ms
[2024-05-29 17:11:29] [INFO ] Implicit Places using invariants in 2777 ms returned []
[2024-05-29 17:11:29] [INFO ] Flow matrix only has 8409 transitions (discarded 13 similar events)
[2024-05-29 17:11:29] [INFO ] Invariant cache hit.
[2024-05-29 17:11:32] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:11:36] [INFO ] Implicit Places using invariants and state equation in 6315 ms returned []
Implicit Place search using SMT with State Equation took 9122 ms to find 0 implicit places.
Running 8421 sub problems to find dead transitions.
[2024-05-29 17:11:36] [INFO ] Flow matrix only has 8409 transitions (discarded 13 similar events)
[2024-05-29 17:11:36] [INFO ] Invariant cache hit.
[2024-05-29 17:11:37] [INFO ] State equation strengthened by 8201 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/8574 variables, and 0 constraints, problems are : Problem set: 0 solved, 8421 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/165 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8421/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 164/8574 variables, and 0 constraints, problems are : Problem set: 0 solved, 8421 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/165 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 207186ms problems are : Problem set: 0 solved, 8421 unsolved
Search for dead transitions found 0 dead transitions in 207281ms
Starting structural reductions in LTL mode, iteration 1 : 165/321 places, 8422/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216697 ms. Remains : 165/321 places, 8422/8623 transitions.
[2024-05-29 17:15:04] [INFO ] Flatten gal took : 547 ms
[2024-05-29 17:15:04] [INFO ] Flatten gal took : 579 ms
[2024-05-29 17:15:05] [INFO ] Input system was already deterministic with 8422 transitions.
[2024-05-29 17:15:06] [INFO ] Flatten gal took : 571 ms
[2024-05-29 17:15:07] [INFO ] Flatten gal took : 574 ms
[2024-05-29 17:15:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality13834781213376660138.gal : 115 ms
[2024-05-29 17:15:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality5951408571318535663.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/CTLCardinality13834781213376660138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5951408571318535663.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:15:37] [INFO ] Flatten gal took : 573 ms
[2024-05-29 17:15:37] [INFO ] Applying decomposition
[2024-05-29 17:15:38] [INFO ] Flatten gal took : 573 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/graph9660039412028954833.txt' '-o' '/tmp/graph9660039412028954833.bin' '-w' '/tmp/graph9660039412028954833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9660039412028954833.bin' '-l' '-1' '-v' '-w' '/tmp/graph9660039412028954833.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:15:40] [INFO ] Decomposing Gal with order
[2024-05-29 17:15:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:15:42] [INFO ] Removed a total of 98416 redundant transitions.
[2024-05-29 17:15:42] [INFO ] Flatten gal took : 1534 ms
[2024-05-29 17:15:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 705 ms.
[2024-05-29 17:15:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality8709808492872975255.gal : 50 ms
[2024-05-29 17:15:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16991569766579787990.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/CTLCardinality8709808492872975255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16991569766579787990.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 : 321/321 places, 8623/8623 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 266 transition count 8558
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 266 transition count 8558
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 120 place count 266 transition count 8548
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 160 place count 226 transition count 8502
Iterating global reduction 1 with 40 rules applied. Total rules applied 200 place count 226 transition count 8502
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 210 place count 226 transition count 8492
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 235 place count 201 transition count 8467
Iterating global reduction 2 with 25 rules applied. Total rules applied 260 place count 201 transition count 8467
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 276 place count 185 transition count 8451
Iterating global reduction 2 with 16 rules applied. Total rules applied 292 place count 185 transition count 8451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 294 place count 185 transition count 8449
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 307 place count 172 transition count 8436
Iterating global reduction 3 with 13 rules applied. Total rules applied 320 place count 172 transition count 8436
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 322 place count 172 transition count 8434
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 330 place count 164 transition count 8426
Iterating global reduction 4 with 8 rules applied. Total rules applied 338 place count 164 transition count 8426
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 344 place count 164 transition count 8420
Applied a total of 344 rules in 227 ms. Remains 164 /321 variables (removed 157) and now considering 8420/8623 (removed 203) transitions.
[2024-05-29 17:16:13] [INFO ] Flow matrix only has 8406 transitions (discarded 14 similar events)
// Phase 1: matrix 8406 rows 164 cols
[2024-05-29 17:16:13] [INFO ] Computed 2 invariants in 41 ms
[2024-05-29 17:16:16] [INFO ] Implicit Places using invariants in 2637 ms returned []
[2024-05-29 17:16:16] [INFO ] Flow matrix only has 8406 transitions (discarded 14 similar events)
[2024-05-29 17:16:16] [INFO ] Invariant cache hit.
[2024-05-29 17:16:18] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:16:22] [INFO ] Implicit Places using invariants and state equation in 6180 ms returned []
Implicit Place search using SMT with State Equation took 8841 ms to find 0 implicit places.
Running 8419 sub problems to find dead transitions.
[2024-05-29 17:16:22] [INFO ] Flow matrix only has 8406 transitions (discarded 14 similar events)
[2024-05-29 17:16:22] [INFO ] Invariant cache hit.
[2024-05-29 17:16:23] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8419 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/164 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8419/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8419 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/164 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 207727ms problems are : Problem set: 0 solved, 8419 unsolved
Search for dead transitions found 0 dead transitions in 207821ms
Starting structural reductions in LTL mode, iteration 1 : 164/321 places, 8420/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216914 ms. Remains : 164/321 places, 8420/8623 transitions.
[2024-05-29 17:19:50] [INFO ] Flatten gal took : 532 ms
[2024-05-29 17:19:51] [INFO ] Flatten gal took : 573 ms
[2024-05-29 17:19:52] [INFO ] Input system was already deterministic with 8420 transitions.
[2024-05-29 17:19:53] [INFO ] Flatten gal took : 564 ms
[2024-05-29 17:19:53] [INFO ] Flatten gal took : 574 ms
[2024-05-29 17:19:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality4416939879967501834.gal : 118 ms
[2024-05-29 17:19:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5578219104370615895.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/CTLCardinality4416939879967501834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5578219104370615895.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:20:24] [INFO ] Flatten gal took : 577 ms
[2024-05-29 17:20:24] [INFO ] Applying decomposition
[2024-05-29 17:20:25] [INFO ] Flatten gal took : 573 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/graph1531091513155510613.txt' '-o' '/tmp/graph1531091513155510613.bin' '-w' '/tmp/graph1531091513155510613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1531091513155510613.bin' '-l' '-1' '-v' '-w' '/tmp/graph1531091513155510613.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:20:27] [INFO ] Decomposing Gal with order
[2024-05-29 17:20:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:20:28] [INFO ] Removed a total of 98420 redundant transitions.
[2024-05-29 17:20:29] [INFO ] Flatten gal took : 1632 ms
[2024-05-29 17:20:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 562 ms.
[2024-05-29 17:20:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality3358569693002164876.gal : 71 ms
[2024-05-29 17:20:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1684938020714504248.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/CTLCardinality3358569693002164876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1684938020714504248.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 : 321/321 places, 8623/8623 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 320 transition count 8438
Reduce places removed 184 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 217 rules applied. Total rules applied 401 place count 136 transition count 8405
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 411 place count 132 transition count 8399
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 416 place count 130 transition count 8396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 417 place count 129 transition count 8396
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 417 place count 129 transition count 8375
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 459 place count 108 transition count 8375
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 473 place count 94 transition count 8352
Iterating global reduction 5 with 14 rules applied. Total rules applied 487 place count 94 transition count 8352
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 518 place count 94 transition count 8321
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 518 place count 94 transition count 8320
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 520 place count 93 transition count 8320
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 525 place count 88 transition count 8310
Iterating global reduction 6 with 5 rules applied. Total rules applied 530 place count 88 transition count 8310
Ensure Unique test removed 992 transitions
Reduce isomorphic transitions removed 992 transitions.
Iterating post reduction 6 with 992 rules applied. Total rules applied 1522 place count 88 transition count 7318
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 1568 place count 65 transition count 7295
Ensure Unique test removed 1045 transitions
Reduce isomorphic transitions removed 1045 transitions.
Iterating post reduction 7 with 1045 rules applied. Total rules applied 2613 place count 65 transition count 6250
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2617 place count 63 transition count 6248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2619 place count 63 transition count 6246
Drop transitions (Redundant composition of simpler transitions.) removed 6092 transitions
Redundant transition composition rules discarded 6092 transitions
Iterating global reduction 9 with 6092 rules applied. Total rules applied 8711 place count 63 transition count 154
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 8735 place count 51 transition count 142
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 8745 place count 41 transition count 132
Applied a total of 8745 rules in 3489 ms. Remains 41 /321 variables (removed 280) and now considering 132/8623 (removed 8491) transitions.
[2024-05-29 17:21:03] [INFO ] Flow matrix only has 119 transitions (discarded 13 similar events)
// Phase 1: matrix 119 rows 41 cols
[2024-05-29 17:21:03] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 17:21:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 17:21:03] [INFO ] Flow matrix only has 119 transitions (discarded 13 similar events)
[2024-05-29 17:21:03] [INFO ] Invariant cache hit.
[2024-05-29 17:21:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 17:21:03] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-29 17:21:03] [INFO ] Redundant transitions in 3 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-29 17:21:03] [INFO ] Flow matrix only has 119 transitions (discarded 13 similar events)
[2024-05-29 17:21:03] [INFO ] Invariant cache hit.
[2024-05-29 17:21:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 12/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:03] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:21:03] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-29 17:21:03] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:21:04] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 10 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:21:05] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:21:06] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:21:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:08] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 118/159 variables, 41/154 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:21:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:21:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:21:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/159 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 15 (OVERLAPS) 1/160 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/160 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 17 (OVERLAPS) 0/160 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 185 constraints, problems are : Problem set: 0 solved, 56 unsolved in 9733 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 142/142 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 12/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 142/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 118/159 variables, 41/184 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 56/240 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 1/160 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 241 constraints, problems are : Problem set: 0 solved, 56 unsolved in 3537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 142/142 constraints]
After SMT, in 13297ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 13298ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/321 places, 132/8623 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16995 ms. Remains : 41/321 places, 132/8623 transitions.
[2024-05-29 17:21:16] [INFO ] Flatten gal took : 17 ms
[2024-05-29 17:21:16] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:21:16] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-29 17:21:17] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:21:17] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:21:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality9965764735230019930.gal : 2 ms
[2024-05-29 17:21:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality17632818767011525227.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/CTLCardinality9965764735230019930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17632818767011525227.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,8218,0.078653,6620,2,325,5,4994,6,0,283,2940,0
Converting to forward existential form...Done !
original formula: EG(((p109==0)||(p199==1)))
=> equivalent forward existential formula: [FwdG(Init,((p109==0)||(p199==1)))] != FALSE
Hit Full ! (commute/partial/dont) 127/0/5
(forward)formula 0,1,0.17421,6928,1,0,7,10450,19,2,4549,6166,8
FORMULA StigmergyCommit-PT-11a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 8623/8623 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 263 transition count 8555
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 263 transition count 8555
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 128 place count 263 transition count 8543
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 168 place count 223 transition count 8497
Iterating global reduction 1 with 40 rules applied. Total rules applied 208 place count 223 transition count 8497
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 218 place count 223 transition count 8487
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 242 place count 199 transition count 8463
Iterating global reduction 2 with 24 rules applied. Total rules applied 266 place count 199 transition count 8463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 199 transition count 8462
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 282 place count 184 transition count 8447
Iterating global reduction 3 with 15 rules applied. Total rules applied 297 place count 184 transition count 8447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 298 place count 184 transition count 8446
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 311 place count 171 transition count 8433
Iterating global reduction 4 with 13 rules applied. Total rules applied 324 place count 171 transition count 8433
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 326 place count 171 transition count 8431
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 335 place count 162 transition count 8422
Iterating global reduction 5 with 9 rules applied. Total rules applied 344 place count 162 transition count 8422
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 350 place count 162 transition count 8416
Applied a total of 350 rules in 280 ms. Remains 162 /321 variables (removed 159) and now considering 8416/8623 (removed 207) transitions.
[2024-05-29 17:21:17] [INFO ] Flow matrix only has 8402 transitions (discarded 14 similar events)
// Phase 1: matrix 8402 rows 162 cols
[2024-05-29 17:21:17] [INFO ] Computed 2 invariants in 34 ms
[2024-05-29 17:21:20] [INFO ] Implicit Places using invariants in 2713 ms returned []
[2024-05-29 17:21:20] [INFO ] Flow matrix only has 8402 transitions (discarded 14 similar events)
[2024-05-29 17:21:20] [INFO ] Invariant cache hit.
[2024-05-29 17:21:22] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:21:26] [INFO ] Implicit Places using invariants and state equation in 6508 ms returned []
Implicit Place search using SMT with State Equation took 9229 ms to find 0 implicit places.
Running 8415 sub problems to find dead transitions.
[2024-05-29 17:21:26] [INFO ] Flow matrix only has 8402 transitions (discarded 14 similar events)
[2024-05-29 17:21:26] [INFO ] Invariant cache hit.
[2024-05-29 17:21:27] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/8564 variables, and 0 constraints, problems are : Problem set: 0 solved, 8415 unsolved in 30104 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/162 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8415/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/8564 variables, and 0 constraints, problems are : Problem set: 0 solved, 8415 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/162 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 214171ms problems are : Problem set: 0 solved, 8415 unsolved
Search for dead transitions found 0 dead transitions in 214396ms
Starting structural reductions in LTL mode, iteration 1 : 162/321 places, 8416/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223942 ms. Remains : 162/321 places, 8416/8623 transitions.
[2024-05-29 17:25:01] [INFO ] Flatten gal took : 536 ms
[2024-05-29 17:25:02] [INFO ] Flatten gal took : 570 ms
[2024-05-29 17:25:03] [INFO ] Input system was already deterministic with 8416 transitions.
[2024-05-29 17:25:04] [INFO ] Flatten gal took : 570 ms
[2024-05-29 17:25:04] [INFO ] Flatten gal took : 569 ms
[2024-05-29 17:25:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality2332447209710354502.gal : 117 ms
[2024-05-29 17:25:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11898807921102995810.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/CTLCardinality2332447209710354502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11898807921102995810.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:25:35] [INFO ] Flatten gal took : 571 ms
[2024-05-29 17:25:35] [INFO ] Applying decomposition
[2024-05-29 17:25:36] [INFO ] Flatten gal took : 574 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/graph17433909465467467586.txt' '-o' '/tmp/graph17433909465467467586.bin' '-w' '/tmp/graph17433909465467467586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17433909465467467586.bin' '-l' '-1' '-v' '-w' '/tmp/graph17433909465467467586.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:25:37] [INFO ] Decomposing Gal with order
[2024-05-29 17:25:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:25:39] [INFO ] Removed a total of 98415 redundant transitions.
[2024-05-29 17:25:40] [INFO ] Flatten gal took : 1643 ms
[2024-05-29 17:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 742 ms.
[2024-05-29 17:25:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality77614224989928614.gal : 69 ms
[2024-05-29 17:25:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality11366737097284061397.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/CTLCardinality77614224989928614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11366737097284061397.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 8623/8623 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 272 transition count 8565
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 272 transition count 8565
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 106 place count 272 transition count 8557
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 141 place count 237 transition count 8516
Iterating global reduction 1 with 35 rules applied. Total rules applied 176 place count 237 transition count 8516
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 187 place count 237 transition count 8505
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 207 place count 217 transition count 8485
Iterating global reduction 2 with 20 rules applied. Total rules applied 227 place count 217 transition count 8485
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 239 place count 205 transition count 8473
Iterating global reduction 2 with 12 rules applied. Total rules applied 251 place count 205 transition count 8473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 253 place count 205 transition count 8471
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 262 place count 196 transition count 8462
Iterating global reduction 3 with 9 rules applied. Total rules applied 271 place count 196 transition count 8462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 196 transition count 8461
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 280 place count 188 transition count 8453
Iterating global reduction 4 with 8 rules applied. Total rules applied 288 place count 188 transition count 8453
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 294 place count 188 transition count 8447
Applied a total of 294 rules in 232 ms. Remains 188 /321 variables (removed 133) and now considering 8447/8623 (removed 176) transitions.
[2024-05-29 17:26:11] [INFO ] Flow matrix only has 8434 transitions (discarded 13 similar events)
// Phase 1: matrix 8434 rows 188 cols
[2024-05-29 17:26:11] [INFO ] Computed 1 invariants in 43 ms
[2024-05-29 17:26:13] [INFO ] Implicit Places using invariants in 2406 ms returned []
[2024-05-29 17:26:13] [INFO ] Flow matrix only has 8434 transitions (discarded 13 similar events)
[2024-05-29 17:26:13] [INFO ] Invariant cache hit.
[2024-05-29 17:26:16] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:26:19] [INFO ] Implicit Places using invariants and state equation in 6218 ms returned []
Implicit Place search using SMT with State Equation took 8632 ms to find 0 implicit places.
Running 8446 sub problems to find dead transitions.
[2024-05-29 17:26:20] [INFO ] Flow matrix only has 8434 transitions (discarded 13 similar events)
[2024-05-29 17:26:20] [INFO ] Invariant cache hit.
[2024-05-29 17:26:20] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 187/8622 variables, and 0 constraints, problems are : Problem set: 0 solved, 8446 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/188 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8446/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8446 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/8622 variables, and 0 constraints, problems are : Problem set: 0 solved, 8446 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/188 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 222792ms problems are : Problem set: 0 solved, 8446 unsolved
Search for dead transitions found 0 dead transitions in 222906ms
Starting structural reductions in LTL mode, iteration 1 : 188/321 places, 8447/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231802 ms. Remains : 188/321 places, 8447/8623 transitions.
[2024-05-29 17:30:03] [INFO ] Flatten gal took : 633 ms
[2024-05-29 17:30:04] [INFO ] Flatten gal took : 641 ms
[2024-05-29 17:30:05] [INFO ] Input system was already deterministic with 8447 transitions.
[2024-05-29 17:30:06] [INFO ] Flatten gal took : 604 ms
[2024-05-29 17:30:06] [INFO ] Flatten gal took : 621 ms
[2024-05-29 17:30:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality1175838098896527971.gal : 126 ms
[2024-05-29 17:30:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality5874062835681572674.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/CTLCardinality1175838098896527971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5874062835681572674.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:30:37] [INFO ] Flatten gal took : 640 ms
[2024-05-29 17:30:37] [INFO ] Applying decomposition
[2024-05-29 17:30:38] [INFO ] Flatten gal took : 634 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/graph17054327918806141519.txt' '-o' '/tmp/graph17054327918806141519.bin' '-w' '/tmp/graph17054327918806141519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17054327918806141519.bin' '-l' '-1' '-v' '-w' '/tmp/graph17054327918806141519.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:30:40] [INFO ] Decomposing Gal with order
[2024-05-29 17:30:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:30:42] [INFO ] Removed a total of 98422 redundant transitions.
[2024-05-29 17:30:42] [INFO ] Flatten gal took : 1813 ms
[2024-05-29 17:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 1042 ms.
[2024-05-29 17:30:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality14515323138012258825.gal : 64 ms
[2024-05-29 17:30:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15106799498364690695.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/CTLCardinality14515323138012258825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15106799498364690695.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 : 321/321 places, 8623/8623 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 264 transition count 8557
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 264 transition count 8557
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 126 place count 264 transition count 8545
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 164 place count 226 transition count 8502
Iterating global reduction 1 with 38 rules applied. Total rules applied 202 place count 226 transition count 8502
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 211 place count 226 transition count 8493
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 235 place count 202 transition count 8469
Iterating global reduction 2 with 24 rules applied. Total rules applied 259 place count 202 transition count 8469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 202 transition count 8468
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 276 place count 186 transition count 8452
Iterating global reduction 3 with 16 rules applied. Total rules applied 292 place count 186 transition count 8452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 294 place count 186 transition count 8450
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 307 place count 173 transition count 8437
Iterating global reduction 4 with 13 rules applied. Total rules applied 320 place count 173 transition count 8437
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 322 place count 173 transition count 8435
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 331 place count 164 transition count 8426
Iterating global reduction 5 with 9 rules applied. Total rules applied 340 place count 164 transition count 8426
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 346 place count 164 transition count 8420
Applied a total of 346 rules in 264 ms. Remains 164 /321 variables (removed 157) and now considering 8420/8623 (removed 203) transitions.
[2024-05-29 17:31:14] [INFO ] Flow matrix only has 8406 transitions (discarded 14 similar events)
// Phase 1: matrix 8406 rows 164 cols
[2024-05-29 17:31:14] [INFO ] Computed 1 invariants in 31 ms
[2024-05-29 17:31:17] [INFO ] Implicit Places using invariants in 2688 ms returned []
[2024-05-29 17:31:17] [INFO ] Flow matrix only has 8406 transitions (discarded 14 similar events)
[2024-05-29 17:31:17] [INFO ] Invariant cache hit.
[2024-05-29 17:31:19] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:31:23] [INFO ] Implicit Places using invariants and state equation in 6657 ms returned []
Implicit Place search using SMT with State Equation took 9350 ms to find 0 implicit places.
Running 8419 sub problems to find dead transitions.
[2024-05-29 17:31:23] [INFO ] Flow matrix only has 8406 transitions (discarded 14 similar events)
[2024-05-29 17:31:23] [INFO ] Invariant cache hit.
[2024-05-29 17:31:24] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8419 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/164 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8419/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/8570 variables, and 0 constraints, problems are : Problem set: 0 solved, 8419 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/164 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 212556ms problems are : Problem set: 0 solved, 8419 unsolved
Search for dead transitions found 0 dead transitions in 212648ms
Starting structural reductions in LTL mode, iteration 1 : 164/321 places, 8420/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222291 ms. Remains : 164/321 places, 8420/8623 transitions.
[2024-05-29 17:34:57] [INFO ] Flatten gal took : 586 ms
[2024-05-29 17:34:57] [INFO ] Flatten gal took : 622 ms
[2024-05-29 17:34:59] [INFO ] Input system was already deterministic with 8420 transitions.
[2024-05-29 17:34:59] [INFO ] Flatten gal took : 622 ms
[2024-05-29 17:35:00] [INFO ] Flatten gal took : 619 ms
[2024-05-29 17:35:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality6196914627693367431.gal : 125 ms
[2024-05-29 17:35:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality821018368685384345.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/CTLCardinality6196914627693367431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality821018368685384345.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:35:31] [INFO ] Flatten gal took : 623 ms
[2024-05-29 17:35:31] [INFO ] Applying decomposition
[2024-05-29 17:35:31] [INFO ] Flatten gal took : 637 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/graph5205063158220386243.txt' '-o' '/tmp/graph5205063158220386243.bin' '-w' '/tmp/graph5205063158220386243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5205063158220386243.bin' '-l' '-1' '-v' '-w' '/tmp/graph5205063158220386243.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:35:33] [INFO ] Decomposing Gal with order
[2024-05-29 17:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:35:35] [INFO ] Removed a total of 98423 redundant transitions.
[2024-05-29 17:35:35] [INFO ] Flatten gal took : 1538 ms
[2024-05-29 17:35:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 579 ms.
[2024-05-29 17:35:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality494613757181271730.gal : 46 ms
[2024-05-29 17:35:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4089388599636237273.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/CTLCardinality494613757181271730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4089388599636237273.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 8623/8623 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 260 transition count 8552
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 260 transition count 8552
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 134 place count 260 transition count 8540
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 176 place count 218 transition count 8492
Iterating global reduction 1 with 42 rules applied. Total rules applied 218 place count 218 transition count 8492
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 229 place count 218 transition count 8481
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 255 place count 192 transition count 8455
Iterating global reduction 2 with 26 rules applied. Total rules applied 281 place count 192 transition count 8455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 192 transition count 8454
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 298 place count 176 transition count 8438
Iterating global reduction 3 with 16 rules applied. Total rules applied 314 place count 176 transition count 8438
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 316 place count 176 transition count 8436
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 329 place count 163 transition count 8423
Iterating global reduction 4 with 13 rules applied. Total rules applied 342 place count 163 transition count 8423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 344 place count 163 transition count 8421
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 353 place count 154 transition count 8412
Iterating global reduction 5 with 9 rules applied. Total rules applied 362 place count 154 transition count 8412
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 368 place count 154 transition count 8406
Applied a total of 368 rules in 232 ms. Remains 154 /321 variables (removed 167) and now considering 8406/8623 (removed 217) transitions.
[2024-05-29 17:36:06] [INFO ] Flow matrix only has 8393 transitions (discarded 13 similar events)
// Phase 1: matrix 8393 rows 154 cols
[2024-05-29 17:36:06] [INFO ] Computed 1 invariants in 33 ms
[2024-05-29 17:36:09] [INFO ] Implicit Places using invariants in 2585 ms returned []
[2024-05-29 17:36:09] [INFO ] Flow matrix only has 8393 transitions (discarded 13 similar events)
[2024-05-29 17:36:09] [INFO ] Invariant cache hit.
[2024-05-29 17:36:12] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:36:15] [INFO ] Implicit Places using invariants and state equation in 6415 ms returned []
Implicit Place search using SMT with State Equation took 9002 ms to find 0 implicit places.
Running 8405 sub problems to find dead transitions.
[2024-05-29 17:36:15] [INFO ] Flow matrix only has 8393 transitions (discarded 13 similar events)
[2024-05-29 17:36:15] [INFO ] Invariant cache hit.
[2024-05-29 17:36:16] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 153/8547 variables, and 0 constraints, problems are : Problem set: 0 solved, 8405 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/154 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8405/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 153/8547 variables, and 0 constraints, problems are : Problem set: 0 solved, 8405 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/154 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 218237ms problems are : Problem set: 0 solved, 8405 unsolved
Search for dead transitions found 0 dead transitions in 218329ms
Starting structural reductions in LTL mode, iteration 1 : 154/321 places, 8406/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227596 ms. Remains : 154/321 places, 8406/8623 transitions.
[2024-05-29 17:39:54] [INFO ] Flatten gal took : 569 ms
[2024-05-29 17:39:55] [INFO ] Flatten gal took : 599 ms
[2024-05-29 17:39:56] [INFO ] Input system was already deterministic with 8406 transitions.
[2024-05-29 17:39:57] [INFO ] Flatten gal took : 566 ms
[2024-05-29 17:39:57] [INFO ] Flatten gal took : 574 ms
[2024-05-29 17:39:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13690567685361071999.gal : 115 ms
[2024-05-29 17:39:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2233461828427247083.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/CTLCardinality13690567685361071999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2233461828427247083.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:40:28] [INFO ] Flatten gal took : 572 ms
[2024-05-29 17:40:28] [INFO ] Applying decomposition
[2024-05-29 17:40:29] [INFO ] Flatten gal took : 572 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/graph17110305679494355880.txt' '-o' '/tmp/graph17110305679494355880.bin' '-w' '/tmp/graph17110305679494355880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17110305679494355880.bin' '-l' '-1' '-v' '-w' '/tmp/graph17110305679494355880.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:40:30] [INFO ] Decomposing Gal with order
[2024-05-29 17:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:40:32] [INFO ] Removed a total of 98417 redundant transitions.
[2024-05-29 17:40:33] [INFO ] Flatten gal took : 1686 ms
[2024-05-29 17:40:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 477 ms.
[2024-05-29 17:40:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality15516381087458508646.gal : 47 ms
[2024-05-29 17:40:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality3267426743818755892.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/CTLCardinality15516381087458508646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3267426743818755892.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 321/321 places, 8623/8623 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 320 transition count 8439
Reduce places removed 183 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 215 rules applied. Total rules applied 398 place count 137 transition count 8407
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 407 place count 133 transition count 8402
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 409 place count 132 transition count 8401
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 409 place count 132 transition count 8379
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 453 place count 110 transition count 8379
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 468 place count 95 transition count 8354
Iterating global reduction 4 with 15 rules applied. Total rules applied 483 place count 95 transition count 8354
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 514 place count 95 transition count 8323
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 514 place count 95 transition count 8322
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 516 place count 94 transition count 8322
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 522 place count 88 transition count 8310
Iterating global reduction 5 with 6 rules applied. Total rules applied 528 place count 88 transition count 8310
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2016 transitions.
Iterating post reduction 5 with 2016 rules applied. Total rules applied 2544 place count 88 transition count 6294
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2592 place count 64 transition count 6270
Ensure Unique test removed 2071 transitions
Reduce isomorphic transitions removed 2071 transitions.
Iterating post reduction 6 with 2071 rules applied. Total rules applied 4663 place count 64 transition count 4199
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 4667 place count 62 transition count 4197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 4669 place count 62 transition count 4195
Drop transitions (Redundant composition of simpler transitions.) removed 4076 transitions
Redundant transition composition rules discarded 4076 transitions
Iterating global reduction 8 with 4076 rules applied. Total rules applied 8745 place count 62 transition count 119
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 8769 place count 50 transition count 107
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 8 with 9 rules applied. Total rules applied 8778 place count 41 transition count 98
Applied a total of 8778 rules in 1908 ms. Remains 41 /321 variables (removed 280) and now considering 98/8623 (removed 8525) transitions.
[2024-05-29 17:41:05] [INFO ] Flow matrix only has 86 transitions (discarded 12 similar events)
// Phase 1: matrix 86 rows 41 cols
[2024-05-29 17:41:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 17:41:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 17:41:05] [INFO ] Flow matrix only has 86 transitions (discarded 12 similar events)
[2024-05-29 17:41:05] [INFO ] Invariant cache hit.
[2024-05-29 17:41:05] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-29 17:41:05] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-29 17:41:05] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-29 17:41:05] [INFO ] Flow matrix only has 86 transitions (discarded 12 similar events)
[2024-05-29 17:41:05] [INFO ] Invariant cache hit.
[2024-05-29 17:41:05] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 5 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:41:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:41:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:41:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 8 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:41:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:41:11] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 85/126 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 27/206 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 1/127 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/127 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 207 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8239 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 137/137 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 17:41:15] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:41:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:41:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 85/126 variables, 41/182 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 27/209 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 97/306 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/127 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 307 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5411 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 140/140 constraints]
After SMT, in 13744ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 13745ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/321 places, 98/8623 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15787 ms. Remains : 41/321 places, 98/8623 transitions.
[2024-05-29 17:41:19] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:41:19] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:41:19] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-29 17:41:19] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:41:19] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:41:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality11063708410649645422.gal : 1 ms
[2024-05-29 17:41:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1187083283642501951.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/CTLCardinality11063708410649645422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1187083283642501951.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,4124,0.049594,5328,2,275,5,3726,6,0,249,2004,0
Converting to forward existential form...Done !
original formula: AF(AG(((p427==0)||(p412==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p427==0)||(p412==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...340
(forward)formula 0,1,0.176272,6176,1,0,173,11072,211,63,4025,8957,202
FORMULA StigmergyCommit-PT-11a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 321/321 places, 8623/8623 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 320 transition count 8436
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 219 rules applied. Total rules applied 405 place count 134 transition count 8403
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 415 place count 130 transition count 8397
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 419 place count 128 transition count 8395
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 419 place count 128 transition count 8374
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 461 place count 107 transition count 8374
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 475 place count 93 transition count 8351
Iterating global reduction 4 with 14 rules applied. Total rules applied 489 place count 93 transition count 8351
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 504 place count 93 transition count 8336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 504 place count 93 transition count 8335
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 506 place count 92 transition count 8335
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 512 place count 86 transition count 8323
Iterating global reduction 5 with 6 rules applied. Total rules applied 518 place count 86 transition count 8323
Ensure Unique test removed 1008 transitions
Reduce isomorphic transitions removed 1008 transitions.
Iterating post reduction 5 with 1008 rules applied. Total rules applied 1526 place count 86 transition count 7315
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1572 place count 63 transition count 7292
Ensure Unique test removed 1046 transitions
Reduce isomorphic transitions removed 1046 transitions.
Iterating post reduction 6 with 1046 rules applied. Total rules applied 2618 place count 63 transition count 6246
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2622 place count 61 transition count 6244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2624 place count 61 transition count 6242
Drop transitions (Redundant composition of simpler transitions.) removed 5997 transitions
Redundant transition composition rules discarded 5997 transitions
Iterating global reduction 8 with 5997 rules applied. Total rules applied 8621 place count 61 transition count 245
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 8645 place count 49 transition count 233
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 8655 place count 39 transition count 223
Applied a total of 8655 rules in 3461 ms. Remains 39 /321 variables (removed 282) and now considering 223/8623 (removed 8400) transitions.
[2024-05-29 17:41:23] [INFO ] Flow matrix only has 211 transitions (discarded 12 similar events)
// Phase 1: matrix 211 rows 39 cols
[2024-05-29 17:41:23] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 17:41:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 17:41:23] [INFO ] Flow matrix only has 211 transitions (discarded 12 similar events)
[2024-05-29 17:41:23] [INFO ] Invariant cache hit.
[2024-05-29 17:41:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 17:41:23] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-29 17:41:23] [INFO ] Redundant transitions in 10 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-29 17:41:23] [INFO ] Flow matrix only has 211 transitions (discarded 12 similar events)
[2024-05-29 17:41:23] [INFO ] Invariant cache hit.
[2024-05-29 17:41:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 12/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:41:23] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2024-05-29 17:41:23] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:41:26] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 210/249 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 11/178 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (OVERLAPS) 1/250 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (OVERLAPS) 0/250 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 179 constraints, problems are : Problem set: 0 solved, 51 unsolved in 11176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 138/138 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 12/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 138/139 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 210/249 variables, 39/178 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 51/229 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/250 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 230 constraints, problems are : Problem set: 0 solved, 51 unsolved in 6706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 138/138 constraints]
After SMT, in 17936ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 17937ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/321 places, 223/8623 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21654 ms. Remains : 39/321 places, 223/8623 transitions.
[2024-05-29 17:41:41] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:41:41] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:41:41] [INFO ] Input system was already deterministic with 223 transitions.
[2024-05-29 17:41:41] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:41:41] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:41:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2612202258854390419.gal : 3 ms
[2024-05-29 17:41:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16655264772939361488.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/CTLCardinality2612202258854390419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16655264772939361488.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,8216,0.142042,10448,2,343,5,5653,6,0,367,3253,0
Converting to forward existential form...Done !
original formula: AG(EF((p362==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p362==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...333
(forward)formula 0,0,0.652964,14464,1,0,327,24859,454,79,11115,19360,501
FORMULA StigmergyCommit-PT-11a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 8623/8623 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 267 transition count 8561
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 267 transition count 8561
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 117 place count 267 transition count 8552
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 156 place count 228 transition count 8507
Iterating global reduction 1 with 39 rules applied. Total rules applied 195 place count 228 transition count 8507
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 205 place count 228 transition count 8497
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 231 place count 202 transition count 8471
Iterating global reduction 2 with 26 rules applied. Total rules applied 257 place count 202 transition count 8471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 202 transition count 8470
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 274 place count 186 transition count 8454
Iterating global reduction 3 with 16 rules applied. Total rules applied 290 place count 186 transition count 8454
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 292 place count 186 transition count 8452
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 305 place count 173 transition count 8439
Iterating global reduction 4 with 13 rules applied. Total rules applied 318 place count 173 transition count 8439
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 320 place count 173 transition count 8437
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 329 place count 164 transition count 8428
Iterating global reduction 5 with 9 rules applied. Total rules applied 338 place count 164 transition count 8428
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 344 place count 164 transition count 8422
Applied a total of 344 rules in 274 ms. Remains 164 /321 variables (removed 157) and now considering 8422/8623 (removed 201) transitions.
[2024-05-29 17:41:42] [INFO ] Flow matrix only has 8408 transitions (discarded 14 similar events)
// Phase 1: matrix 8408 rows 164 cols
[2024-05-29 17:41:42] [INFO ] Computed 2 invariants in 31 ms
[2024-05-29 17:41:45] [INFO ] Implicit Places using invariants in 2761 ms returned []
[2024-05-29 17:41:45] [INFO ] Flow matrix only has 8408 transitions (discarded 14 similar events)
[2024-05-29 17:41:45] [INFO ] Invariant cache hit.
[2024-05-29 17:41:47] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:41:51] [INFO ] Implicit Places using invariants and state equation in 6541 ms returned []
Implicit Place search using SMT with State Equation took 9309 ms to find 0 implicit places.
Running 8421 sub problems to find dead transitions.
[2024-05-29 17:41:51] [INFO ] Flow matrix only has 8408 transitions (discarded 14 similar events)
[2024-05-29 17:41:51] [INFO ] Invariant cache hit.
[2024-05-29 17:41:52] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/8572 variables, and 0 constraints, problems are : Problem set: 0 solved, 8421 unsolved in 30104 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/164 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8421/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/8572 variables, and 0 constraints, problems are : Problem set: 0 solved, 8421 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/164 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 235521ms problems are : Problem set: 0 solved, 8421 unsolved
Search for dead transitions found 0 dead transitions in 235610ms
Starting structural reductions in LTL mode, iteration 1 : 164/321 places, 8422/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245224 ms. Remains : 164/321 places, 8422/8623 transitions.
[2024-05-29 17:45:48] [INFO ] Flatten gal took : 538 ms
[2024-05-29 17:45:48] [INFO ] Flatten gal took : 576 ms
[2024-05-29 17:45:49] [INFO ] Input system was already deterministic with 8422 transitions.
[2024-05-29 17:45:50] [INFO ] Flatten gal took : 583 ms
[2024-05-29 17:45:51] [INFO ] Flatten gal took : 609 ms
[2024-05-29 17:45:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality12987278648167026423.gal : 119 ms
[2024-05-29 17:45:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality15233371675080067637.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/CTLCardinality12987278648167026423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15233371675080067637.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:46:21] [INFO ] Flatten gal took : 607 ms
[2024-05-29 17:46:21] [INFO ] Applying decomposition
[2024-05-29 17:46:22] [INFO ] Flatten gal took : 689 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/graph16118304305680339574.txt' '-o' '/tmp/graph16118304305680339574.bin' '-w' '/tmp/graph16118304305680339574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16118304305680339574.bin' '-l' '-1' '-v' '-w' '/tmp/graph16118304305680339574.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:46:24] [INFO ] Decomposing Gal with order
[2024-05-29 17:46:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:46:26] [INFO ] Removed a total of 98421 redundant transitions.
[2024-05-29 17:46:26] [INFO ] Flatten gal took : 1524 ms
[2024-05-29 17:46:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 763 ms.
[2024-05-29 17:46:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12553755150732343531.gal : 62 ms
[2024-05-29 17:46:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality5506530124117676594.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/CTLCardinality12553755150732343531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5506530124117676594.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 : 321/321 places, 8623/8623 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 261 transition count 8554
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 261 transition count 8554
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 132 place count 261 transition count 8542
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 172 place count 221 transition count 8496
Iterating global reduction 1 with 40 rules applied. Total rules applied 212 place count 221 transition count 8496
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 223 place count 221 transition count 8485
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 248 place count 196 transition count 8460
Iterating global reduction 2 with 25 rules applied. Total rules applied 273 place count 196 transition count 8460
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 196 transition count 8459
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 290 place count 180 transition count 8443
Iterating global reduction 3 with 16 rules applied. Total rules applied 306 place count 180 transition count 8443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 180 transition count 8442
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 321 place count 166 transition count 8428
Iterating global reduction 4 with 14 rules applied. Total rules applied 335 place count 166 transition count 8428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 337 place count 166 transition count 8426
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 347 place count 156 transition count 8416
Iterating global reduction 5 with 10 rules applied. Total rules applied 357 place count 156 transition count 8416
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 364 place count 156 transition count 8409
Applied a total of 364 rules in 238 ms. Remains 156 /321 variables (removed 165) and now considering 8409/8623 (removed 214) transitions.
[2024-05-29 17:46:57] [INFO ] Flow matrix only has 8396 transitions (discarded 13 similar events)
// Phase 1: matrix 8396 rows 156 cols
[2024-05-29 17:46:57] [INFO ] Computed 1 invariants in 39 ms
[2024-05-29 17:47:00] [INFO ] Implicit Places using invariants in 2671 ms returned []
[2024-05-29 17:47:00] [INFO ] Flow matrix only has 8396 transitions (discarded 13 similar events)
[2024-05-29 17:47:00] [INFO ] Invariant cache hit.
[2024-05-29 17:47:02] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:47:06] [INFO ] Implicit Places using invariants and state equation in 6424 ms returned []
Implicit Place search using SMT with State Equation took 9126 ms to find 0 implicit places.
Running 8408 sub problems to find dead transitions.
[2024-05-29 17:47:06] [INFO ] Flow matrix only has 8396 transitions (discarded 13 similar events)
[2024-05-29 17:47:06] [INFO ] Invariant cache hit.
[2024-05-29 17:47:07] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 155/8552 variables, and 0 constraints, problems are : Problem set: 0 solved, 8408 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/156 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8408/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 155/8552 variables, and 0 constraints, problems are : Problem set: 0 solved, 8408 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/156 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 212863ms problems are : Problem set: 0 solved, 8408 unsolved
Search for dead transitions found 0 dead transitions in 212951ms
Starting structural reductions in LTL mode, iteration 1 : 156/321 places, 8409/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222336 ms. Remains : 156/321 places, 8409/8623 transitions.
[2024-05-29 17:50:40] [INFO ] Flatten gal took : 528 ms
[2024-05-29 17:50:40] [INFO ] Flatten gal took : 565 ms
[2024-05-29 17:50:41] [INFO ] Input system was already deterministic with 8409 transitions.
[2024-05-29 17:50:42] [INFO ] Flatten gal took : 568 ms
[2024-05-29 17:50:43] [INFO ] Flatten gal took : 566 ms
[2024-05-29 17:50:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5273244269292886010.gal : 114 ms
[2024-05-29 17:50:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality13221434433809730864.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/CTLCardinality5273244269292886010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13221434433809730864.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:51:13] [INFO ] Flatten gal took : 563 ms
[2024-05-29 17:51:13] [INFO ] Applying decomposition
[2024-05-29 17:51:14] [INFO ] Flatten gal took : 565 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/graph3103142630056479100.txt' '-o' '/tmp/graph3103142630056479100.bin' '-w' '/tmp/graph3103142630056479100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3103142630056479100.bin' '-l' '-1' '-v' '-w' '/tmp/graph3103142630056479100.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:51:16] [INFO ] Decomposing Gal with order
[2024-05-29 17:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:51:17] [INFO ] Removed a total of 98422 redundant transitions.
[2024-05-29 17:51:18] [INFO ] Flatten gal took : 1397 ms
[2024-05-29 17:51:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 464 ms.
[2024-05-29 17:51:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12695549073311129591.gal : 73 ms
[2024-05-29 17:51:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3991049793180694101.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/CTLCardinality12695549073311129591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3991049793180694101.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 : 321/321 places, 8623/8623 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 262 transition count 8554
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 262 transition count 8554
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 130 place count 262 transition count 8542
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 170 place count 222 transition count 8496
Iterating global reduction 1 with 40 rules applied. Total rules applied 210 place count 222 transition count 8496
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 220 place count 222 transition count 8486
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 246 place count 196 transition count 8460
Iterating global reduction 2 with 26 rules applied. Total rules applied 272 place count 196 transition count 8460
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 273 place count 196 transition count 8459
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 289 place count 180 transition count 8443
Iterating global reduction 3 with 16 rules applied. Total rules applied 305 place count 180 transition count 8443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 307 place count 180 transition count 8441
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 320 place count 167 transition count 8428
Iterating global reduction 4 with 13 rules applied. Total rules applied 333 place count 167 transition count 8428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 335 place count 167 transition count 8426
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 344 place count 158 transition count 8417
Iterating global reduction 5 with 9 rules applied. Total rules applied 353 place count 158 transition count 8417
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 359 place count 158 transition count 8411
Applied a total of 359 rules in 231 ms. Remains 158 /321 variables (removed 163) and now considering 8411/8623 (removed 212) transitions.
[2024-05-29 17:51:48] [INFO ] Flow matrix only has 8397 transitions (discarded 14 similar events)
// Phase 1: matrix 8397 rows 158 cols
[2024-05-29 17:51:49] [INFO ] Computed 2 invariants in 36 ms
[2024-05-29 17:51:51] [INFO ] Implicit Places using invariants in 2599 ms returned []
[2024-05-29 17:51:51] [INFO ] Flow matrix only has 8397 transitions (discarded 14 similar events)
[2024-05-29 17:51:51] [INFO ] Invariant cache hit.
[2024-05-29 17:51:54] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:51:57] [INFO ] Implicit Places using invariants and state equation in 6359 ms returned []
Implicit Place search using SMT with State Equation took 8960 ms to find 0 implicit places.
Running 8410 sub problems to find dead transitions.
[2024-05-29 17:51:58] [INFO ] Flow matrix only has 8397 transitions (discarded 14 similar events)
[2024-05-29 17:51:58] [INFO ] Invariant cache hit.
[2024-05-29 17:51:58] [INFO ] State equation strengthened by 8201 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/8555 variables, and 0 constraints, problems are : Problem set: 0 solved, 8410 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/158 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8410/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8410 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/8555 variables, and 0 constraints, problems are : Problem set: 0 solved, 8410 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/158 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/183 constraints, Known Traps: 0/0 constraints]
After SMT, in 205490ms problems are : Problem set: 0 solved, 8410 unsolved
Search for dead transitions found 0 dead transitions in 205576ms
Starting structural reductions in LTL mode, iteration 1 : 158/321 places, 8411/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214790 ms. Remains : 158/321 places, 8411/8623 transitions.
[2024-05-29 17:55:24] [INFO ] Flatten gal took : 534 ms
[2024-05-29 17:55:24] [INFO ] Flatten gal took : 568 ms
[2024-05-29 17:55:25] [INFO ] Input system was already deterministic with 8411 transitions.
[2024-05-29 17:55:26] [INFO ] Flatten gal took : 566 ms
[2024-05-29 17:55:27] [INFO ] Flatten gal took : 567 ms
[2024-05-29 17:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality7364662109328133748.gal : 122 ms
[2024-05-29 17:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality6693911020419202298.ctl : 4 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/CTLCardinality7364662109328133748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6693911020419202298.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:55:57] [INFO ] Flatten gal took : 565 ms
[2024-05-29 17:55:57] [INFO ] Applying decomposition
[2024-05-29 17:55:58] [INFO ] Flatten gal took : 567 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/graph10623415789154766545.txt' '-o' '/tmp/graph10623415789154766545.bin' '-w' '/tmp/graph10623415789154766545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10623415789154766545.bin' '-l' '-1' '-v' '-w' '/tmp/graph10623415789154766545.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:55:59] [INFO ] Decomposing Gal with order
[2024-05-29 17:55:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:56:01] [INFO ] Removed a total of 98413 redundant transitions.
[2024-05-29 17:56:02] [INFO ] Flatten gal took : 1588 ms
[2024-05-29 17:56:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 489 ms.
[2024-05-29 17:56:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5550381976644047376.gal : 52 ms
[2024-05-29 17:56:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality15509921032171809019.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/CTLCardinality5550381976644047376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15509921032171809019.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 : 321/321 places, 8623/8623 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 265 transition count 8558
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 265 transition count 8558
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 122 place count 265 transition count 8548
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 160 place count 227 transition count 8505
Iterating global reduction 1 with 38 rules applied. Total rules applied 198 place count 227 transition count 8505
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 209 place count 227 transition count 8494
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 231 place count 205 transition count 8472
Iterating global reduction 2 with 22 rules applied. Total rules applied 253 place count 205 transition count 8472
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 266 place count 192 transition count 8459
Iterating global reduction 2 with 13 rules applied. Total rules applied 279 place count 192 transition count 8459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 192 transition count 8458
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 290 place count 182 transition count 8448
Iterating global reduction 3 with 10 rules applied. Total rules applied 300 place count 182 transition count 8448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 182 transition count 8447
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 309 place count 174 transition count 8439
Iterating global reduction 4 with 8 rules applied. Total rules applied 317 place count 174 transition count 8439
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 322 place count 174 transition count 8434
Applied a total of 322 rules in 225 ms. Remains 174 /321 variables (removed 147) and now considering 8434/8623 (removed 189) transitions.
[2024-05-29 17:56:32] [INFO ] Flow matrix only has 8420 transitions (discarded 14 similar events)
// Phase 1: matrix 8420 rows 174 cols
[2024-05-29 17:56:33] [INFO ] Computed 1 invariants in 40 ms
[2024-05-29 17:56:35] [INFO ] Implicit Places using invariants in 2600 ms returned []
[2024-05-29 17:56:35] [INFO ] Flow matrix only has 8420 transitions (discarded 14 similar events)
[2024-05-29 17:56:35] [INFO ] Invariant cache hit.
[2024-05-29 17:56:37] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:56:41] [INFO ] Implicit Places using invariants and state equation in 6019 ms returned []
Implicit Place search using SMT with State Equation took 8655 ms to find 0 implicit places.
Running 8433 sub problems to find dead transitions.
[2024-05-29 17:56:41] [INFO ] Flow matrix only has 8420 transitions (discarded 14 similar events)
[2024-05-29 17:56:41] [INFO ] Invariant cache hit.
[2024-05-29 17:56:42] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/8594 variables, and 0 constraints, problems are : Problem set: 0 solved, 8433 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/174 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8433/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/8594 variables, and 0 constraints, problems are : Problem set: 0 solved, 8433 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/174 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 205325ms problems are : Problem set: 0 solved, 8433 unsolved
Search for dead transitions found 0 dead transitions in 205412ms
Starting structural reductions in LTL mode, iteration 1 : 174/321 places, 8434/8623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214310 ms. Remains : 174/321 places, 8434/8623 transitions.
[2024-05-29 18:00:07] [INFO ] Flatten gal took : 535 ms
[2024-05-29 18:00:08] [INFO ] Flatten gal took : 572 ms
[2024-05-29 18:00:09] [INFO ] Input system was already deterministic with 8434 transitions.
[2024-05-29 18:00:09] [INFO ] Flatten gal took : 578 ms
[2024-05-29 18:00:10] [INFO ] Flatten gal took : 572 ms
[2024-05-29 18:00:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality18069164491165852817.gal : 112 ms
[2024-05-29 18:00:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality6293432772153924958.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/CTLCardinality18069164491165852817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6293432772153924958.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:00:41] [INFO ] Flatten gal took : 581 ms
[2024-05-29 18:00:41] [INFO ] Applying decomposition
[2024-05-29 18:00:41] [INFO ] Flatten gal took : 572 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/graph14662304045930200279.txt' '-o' '/tmp/graph14662304045930200279.bin' '-w' '/tmp/graph14662304045930200279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14662304045930200279.bin' '-l' '-1' '-v' '-w' '/tmp/graph14662304045930200279.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:00:43] [INFO ] Decomposing Gal with order
[2024-05-29 18:00:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:00:45] [INFO ] Removed a total of 98421 redundant transitions.
[2024-05-29 18:00:45] [INFO ] Flatten gal took : 1368 ms
[2024-05-29 18:00:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 785 ms.
[2024-05-29 18:00:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality8094569790583153511.gal : 62 ms
[2024-05-29 18:00:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1438715848466035535.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/CTLCardinality8094569790583153511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1438715848466035535.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:01:17] [INFO ] Flatten gal took : 583 ms
[2024-05-29 18:01:17] [INFO ] Flatten gal took : 589 ms
[2024-05-29 18:01:18] [INFO ] Applying decomposition
[2024-05-29 18:01:18] [INFO ] Flatten gal took : 562 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/graph6074770296575002728.txt' '-o' '/tmp/graph6074770296575002728.bin' '-w' '/tmp/graph6074770296575002728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6074770296575002728.bin' '-l' '-1' '-v' '-w' '/tmp/graph6074770296575002728.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:01:21] [INFO ] Decomposing Gal with order
[2024-05-29 18:01:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:01:23] [INFO ] Removed a total of 98473 redundant transitions.
[2024-05-29 18:01:23] [INFO ] Flatten gal took : 1396 ms
[2024-05-29 18:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 754 ms.
[2024-05-29 18:01:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8201815045769292501.gal : 43 ms
[2024-05-29 18:01:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality13033093525995672945.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/CTLCardinality8201815045769292501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13033093525995672945.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 11 CTL formulae.
BK_STOP 1717005854377
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-11a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-11a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531900233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-11a.tgz
mv StigmergyCommit-PT-11a 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 '
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 ;