Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 417K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716221355110

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-20 16:09:16] [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-20 16:09:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:09:17] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2024-05-20 16:09:17] [INFO ] Transformed 1242 places.
[2024-05-20 16:09:17] [INFO ] Transformed 1621 transitions.
[2024-05-20 16:09:17] [INFO ] Found NUPN structural information;
[2024-05-20 16:09:17] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Support contains 132 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 1179 transition count 1558
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 1179 transition count 1558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 1179 transition count 1557
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 146 place count 1160 transition count 1525
Iterating global reduction 1 with 19 rules applied. Total rules applied 165 place count 1160 transition count 1525
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 170 place count 1160 transition count 1520
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 1158 transition count 1518
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 1158 transition count 1518
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 1157 transition count 1517
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 1157 transition count 1517
Applied a total of 176 rules in 629 ms. Remains 1157 /1242 variables (removed 85) and now considering 1517/1621 (removed 104) transitions.
// Phase 1: matrix 1517 rows 1157 cols
[2024-05-20 16:09:18] [INFO ] Computed 121 invariants in 104 ms
[2024-05-20 16:09:19] [INFO ] Implicit Places using invariants in 1394 ms returned [989, 1000, 1011, 1019, 1027, 1035, 1043, 1054, 1062, 1070, 1081]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1444 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1146/1242 places, 1517/1621 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1139 transition count 1510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1139 transition count 1510
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 1134 transition count 1505
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 1134 transition count 1505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 1131 transition count 1502
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 1131 transition count 1502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1130 transition count 1501
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1130 transition count 1501
Applied a total of 32 rules in 407 ms. Remains 1130 /1146 variables (removed 16) and now considering 1501/1517 (removed 16) transitions.
// Phase 1: matrix 1501 rows 1130 cols
[2024-05-20 16:09:20] [INFO ] Computed 110 invariants in 52 ms
[2024-05-20 16:09:20] [INFO ] Implicit Places using invariants in 914 ms returned []
[2024-05-20 16:09:20] [INFO ] Invariant cache hit.
[2024-05-20 16:09:25] [INFO ] Implicit Places using invariants and state equation in 4231 ms returned []
Implicit Place search using SMT with State Equation took 5154 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1130/1242 places, 1501/1621 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7663 ms. Remains : 1130/1242 places, 1501/1621 transitions.
Support contains 132 out of 1130 places after structural reductions.
[2024-05-20 16:09:25] [INFO ] Flatten gal took : 219 ms
[2024-05-20 16:09:25] [INFO ] Flatten gal took : 121 ms
[2024-05-20 16:09:26] [INFO ] Input system was already deterministic with 1501 transitions.
Support contains 126 out of 1130 places (down from 132) after GAL structural reductions.
RANDOM walk for 40000 steps (164 resets) in 3121 ms. (12 steps per ms) remains 16/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
[2024-05-20 16:09:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 301/345 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 100/445 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 5 (OVERLAPS) 685/1130 variables, 81/110 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1130 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1501/2631 variables, 1130/1240 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2631 variables, 0/1240 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/2631 variables, 0/1240 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2631/2631 variables, and 1240 constraints, problems are : Problem set: 1 solved, 15 unsolved in 4192 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 81/81 constraints, State Equation: 1130/1130 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 301/340 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-20 16:09:32] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 28 ms to minimize.
[2024-05-20 16:09:32] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 3 ms to minimize.
[2024-05-20 16:09:32] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 3/21 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 100/440 variables, 11/32 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 6 (OVERLAPS) 674/1114 variables, 80/112 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-20 16:09:33] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 7 ms to minimize.
[2024-05-20 16:09:33] [INFO ] Deduced a trap composed of 41 places in 261 ms of which 5 ms to minimize.
[2024-05-20 16:09:34] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 4 ms to minimize.
[2024-05-20 16:09:34] [INFO ] Deduced a trap composed of 84 places in 313 ms of which 5 ms to minimize.
[2024-05-20 16:09:35] [INFO ] Deduced a trap composed of 130 places in 725 ms of which 8 ms to minimize.
[2024-05-20 16:09:36] [INFO ] Deduced a trap composed of 118 places in 659 ms of which 9 ms to minimize.
[2024-05-20 16:09:36] [INFO ] Deduced a trap composed of 127 places in 677 ms of which 9 ms to minimize.
SMT process timed out in 9358ms, After SMT, problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 1130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1130/1130 places, 1501/1501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1130 transition count 1313
Reduce places removed 188 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 191 rules applied. Total rules applied 379 place count 942 transition count 1310
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 rules applied. Total rules applied 383 place count 941 transition count 1307
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 3 with 7 rules applied. Total rules applied 390 place count 939 transition count 1302
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 395 place count 934 transition count 1302
Performed 274 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 274 Pre rules applied. Total rules applied 395 place count 934 transition count 1028
Deduced a syphon composed of 274 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 291 places and 0 transitions.
Iterating global reduction 5 with 565 rules applied. Total rules applied 960 place count 643 transition count 1028
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 14 rules applied. Total rules applied 974 place count 639 transition count 1018
Reduce places removed 10 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 14 rules applied. Total rules applied 988 place count 629 transition count 1014
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 992 place count 625 transition count 1014
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 992 place count 625 transition count 1008
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1010 place count 613 transition count 1008
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 1010 place count 613 transition count 1003
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1020 place count 608 transition count 1003
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1031 place count 597 transition count 992
Iterating global reduction 8 with 11 rules applied. Total rules applied 1042 place count 597 transition count 992
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 1042 place count 597 transition count 986
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1054 place count 591 transition count 986
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1058 place count 587 transition count 970
Iterating global reduction 8 with 4 rules applied. Total rules applied 1062 place count 587 transition count 970
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 8 with 176 rules applied. Total rules applied 1238 place count 498 transition count 883
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1242 place count 494 transition count 879
Ensure Unique test removed 1 places
Iterating global reduction 8 with 5 rules applied. Total rules applied 1247 place count 493 transition count 879
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1247 place count 493 transition count 878
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1249 place count 492 transition count 878
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1251 place count 490 transition count 876
Iterating global reduction 8 with 2 rules applied. Total rules applied 1253 place count 490 transition count 876
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 1255 place count 490 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1256 place count 489 transition count 874
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1258 place count 488 transition count 881
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1261 place count 488 transition count 878
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1264 place count 485 transition count 878
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1267 place count 485 transition count 878
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1268 place count 484 transition count 877
Applied a total of 1268 rules in 514 ms. Remains 484 /1130 variables (removed 646) and now considering 877/1501 (removed 624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 484/1130 places, 877/1501 transitions.
RANDOM walk for 40000 steps (521 resets) in 703 ms. (56 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40002 steps (168 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (180 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (174 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (151 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (172 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (175 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (155 resets) in 150 ms. (264 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (166 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (142 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (165 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
// Phase 1: matrix 877 rows 484 cols
[2024-05-20 16:09:38] [INFO ] Computed 80 invariants in 15 ms
[2024-05-20 16:09:38] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 115/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/136 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 244/380 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 37/417 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/418 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 61/479 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/481 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/481 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 3/484 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 877/1361 variables, 484/564 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1361 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1361 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/1361 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1361/1361 variables, and 569 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 484/484 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 115/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 16:09:40] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 4 ms to minimize.
[2024-05-20 16:09:40] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/136 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 244/380 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 16:09:40] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-05-20 16:09:40] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 37/417 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 16:09:40] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/418 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 61/479 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/481 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/481 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 3/484 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/484 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 877/1361 variables, 484/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1361 variables, 5/574 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1361 variables, 9/583 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1361 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 0/1361 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1361/1361 variables, and 583 constraints, problems are : Problem set: 0 solved, 9 unsolved in 6400 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 484/484 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 8014ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 18429 ms.
Support contains 17 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 877/877 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 484 transition count 870
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 477 transition count 870
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 477 transition count 864
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 27 place count 470 transition count 864
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 27 place count 470 transition count 863
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 468 transition count 863
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 466 transition count 861
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 466 transition count 861
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 465 transition count 860
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 465 transition count 860
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 52 place count 456 transition count 853
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 456 transition count 849
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 453 transition count 849
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 59 place count 453 transition count 848
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 452 transition count 848
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 62 place count 451 transition count 848
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 64 place count 449 transition count 846
Iterating global reduction 5 with 2 rules applied. Total rules applied 66 place count 449 transition count 846
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 448 transition count 844
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 448 transition count 844
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 446 transition count 842
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 73 place count 445 transition count 841
Iterating global reduction 5 with 1 rules applied. Total rules applied 74 place count 445 transition count 841
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 76 place count 445 transition count 839
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 78 place count 443 transition count 839
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 79 place count 442 transition count 838
Applied a total of 79 rules in 192 ms. Remains 442 /484 variables (removed 42) and now considering 838/877 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 442/484 places, 838/877 transitions.
RANDOM walk for 40000 steps (625 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (199 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (186 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (207 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (180 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (222 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (214 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (223 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (170 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (190 resets) in 75 ms. (526 steps per ms) remains 8/9 properties
// Phase 1: matrix 838 rows 442 cols
[2024-05-20 16:10:05] [INFO ] Computed 74 invariants in 8 ms
[2024-05-20 16:10:05] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 101/115 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8/123 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 229/352 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 16:10:05] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-20 16:10:05] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-05-20 16:10:05] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 35/387 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/388 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 51/439 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 1/440 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/442 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 838/1280 variables, 442/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1280 variables, 5/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1280 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/1280 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 524 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1638 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 442/442 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 101/115 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8/123 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 229/352 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 35/387 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/388 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 51/439 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 1/440 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/442 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 838/1280 variables, 442/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1280 variables, 5/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1280 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1280 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/1280 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 532 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3254 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 442/442 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 4919ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 12688 ms.
Support contains 14 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 838/838 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 442 transition count 834
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 437 transition count 834
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 436 transition count 833
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 435 transition count 833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 434 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 434 transition count 832
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 434 transition count 831
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 433 transition count 831
Applied a total of 16 rules in 59 ms. Remains 433 /442 variables (removed 9) and now considering 831/838 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 433/442 places, 831/838 transitions.
RANDOM walk for 40000 steps (606 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (228 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (211 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (218 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (183 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (208 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (214 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (220 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (177 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 225988 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :4 out of 8
Probabilistic random walk after 225988 steps, saw 77655 distinct states, run finished after 3008 ms. (steps per millisecond=75 ) properties seen :4
// Phase 1: matrix 831 rows 433 cols
[2024-05-20 16:10:26] [INFO ] Computed 72 invariants in 9 ms
[2024-05-20 16:10:26] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/120 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 226/346 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 15/361 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 62/424 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/425 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/433 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 831/1264 variables, 433/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1264 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1264 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1264 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1264/1264 variables, and 510 constraints, problems are : Problem set: 0 solved, 4 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 433/433 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/120 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 226/346 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 16:10:27] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 15/361 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/362 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 62/424 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/425 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/433 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 831/1264 variables, 433/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1264 variables, 5/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1264 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1264 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1264 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1264/1264 variables, and 515 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4212 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 433/433 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 5165ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2875 ms.
Support contains 8 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 831/831 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 0 with 2 rules applied. Total rules applied 2 place count 433 transition count 829
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 431 transition count 829
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 431 transition count 824
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 424 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 423 transition count 823
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 422 transition count 822
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 421 transition count 822
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 421 transition count 821
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 420 transition count 821
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 419 transition count 821
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 4 with 4 rules applied. Total rules applied 27 place count 417 transition count 819
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 28 place count 416 transition count 818
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 416 transition count 818
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 416 transition count 817
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 31 place count 415 transition count 817
Applied a total of 31 rules in 87 ms. Remains 415 /433 variables (removed 18) and now considering 817/831 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 415/433 places, 817/831 transitions.
RANDOM walk for 40000 steps (584 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (179 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (203 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (197 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (145 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 258927 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 4
Probabilistic random walk after 258927 steps, saw 87194 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 817 rows 415 cols
[2024-05-20 16:10:37] [INFO ] Computed 68 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 83/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/96 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 219/315 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 16:10:38] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-20 16:10:38] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 17/332 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/333 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 73/406 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/407 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/415 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 817/1232 variables, 415/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1232 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1232 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 485 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 83/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/96 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 219/315 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 17/332 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/333 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 73/406 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/407 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/415 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 817/1232 variables, 415/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1232 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1232 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1232 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 489 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1991 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 3021ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2232 ms.
Support contains 8 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 817/817 transitions.
Applied a total of 0 rules in 13 ms. Remains 415 /415 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 415/415 places, 817/817 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 817/817 transitions.
Applied a total of 0 rules in 13 ms. Remains 415 /415 variables (removed 0) and now considering 817/817 (removed 0) transitions.
[2024-05-20 16:10:43] [INFO ] Invariant cache hit.
[2024-05-20 16:10:43] [INFO ] Implicit Places using invariants in 668 ms returned [1, 18, 19, 22, 32, 49, 67, 144, 161, 162, 164, 182, 200, 275, 280, 293, 294, 295, 329, 350, 351, 352, 353]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 671 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 392/415 places, 817/817 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 392 transition count 777
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 352 transition count 776
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 351 transition count 776
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 82 place count 351 transition count 761
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 113 place count 335 transition count 761
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 125 place count 331 transition count 753
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 133 place count 323 transition count 753
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 136 place count 320 transition count 750
Iterating global reduction 5 with 3 rules applied. Total rules applied 139 place count 320 transition count 750
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 142 place count 320 transition count 747
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 188 place count 297 transition count 724
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 190 place count 296 transition count 726
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 200 place count 296 transition count 716
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 211 place count 285 transition count 716
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 212 place count 285 transition count 715
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 217 place count 285 transition count 715
Applied a total of 217 rules in 154 ms. Remains 285 /392 variables (removed 107) and now considering 715/817 (removed 102) transitions.
// Phase 1: matrix 715 rows 285 cols
[2024-05-20 16:10:43] [INFO ] Computed 39 invariants in 15 ms
[2024-05-20 16:10:44] [INFO ] Implicit Places using invariants in 437 ms returned [91, 97, 100, 102, 105, 113, 114, 185, 191, 193, 196, 199]
[2024-05-20 16:10:44] [INFO ] Actually due to overlaps returned [113, 114, 91, 97, 102, 185, 191, 196, 105, 199]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 444 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 275/415 places, 715/817 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 266 transition count 706
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 266 transition count 706
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 264 transition count 704
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 264 transition count 704
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 261 transition count 701
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 261 transition count 700
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 261 transition count 694
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 255 transition count 694
Applied a total of 41 rules in 60 ms. Remains 255 /275 variables (removed 20) and now considering 694/715 (removed 21) transitions.
// Phase 1: matrix 694 rows 255 cols
[2024-05-20 16:10:44] [INFO ] Computed 29 invariants in 5 ms
[2024-05-20 16:10:44] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-20 16:10:44] [INFO ] Invariant cache hit.
[2024-05-20 16:10:45] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 255/415 places, 694/817 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2335 ms. Remains : 255/415 places, 694/817 transitions.
RANDOM walk for 40000 steps (862 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (305 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (302 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (282 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (252 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 348952 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :1 out of 4
Probabilistic random walk after 348952 steps, saw 116836 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :1
[2024-05-20 16:10:48] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/207 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 19/226 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/255 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 694/949 variables, 255/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/949 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/949 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 949/949 variables, and 284 constraints, problems are : Problem set: 0 solved, 3 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/207 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 19/226 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/255 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 694/949 variables, 255/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/949 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 16:10:52] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/949 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/949 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/949 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 949/949 variables, and 288 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4085 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 4630ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1543 ms.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 694/694 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 254 transition count 692
Applied a total of 3 rules in 26 ms. Remains 254 /255 variables (removed 1) and now considering 692/694 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 254/255 places, 692/694 transitions.
RANDOM walk for 40000 steps (832 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (321 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (276 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (236 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 359241 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 3
Probabilistic random walk after 359241 steps, saw 119546 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 692 rows 254 cols
[2024-05-20 16:10:57] [INFO ] Computed 29 invariants in 7 ms
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 117/172 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/192 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/254 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 692/946 variables, 254/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/946 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 946/946 variables, and 283 constraints, problems are : Problem set: 0 solved, 3 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 16:10:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 117/172 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 20/192 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 16:10:58] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 62/254 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 692/946 variables, 254/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/946 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/946 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/946 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 946/946 variables, and 288 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1783ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 939 ms.
Support contains 7 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 692/692 transitions.
Applied a total of 0 rules in 9 ms. Remains 254 /254 variables (removed 0) and now considering 692/692 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 254/254 places, 692/692 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 692/692 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 692/692 (removed 0) transitions.
[2024-05-20 16:11:00] [INFO ] Invariant cache hit.
[2024-05-20 16:11:01] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-20 16:11:01] [INFO ] Invariant cache hit.
[2024-05-20 16:11:01] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2024-05-20 16:11:01] [INFO ] Redundant transitions in 53 ms returned []
Running 675 sub problems to find dead transitions.
[2024-05-20 16:11:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 1/254 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-05-20 16:11:17] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2024-05-20 16:11:18] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 2 ms to minimize.
[2024-05-20 16:11:20] [INFO ] Deduced a trap composed of 72 places in 241 ms of which 3 ms to minimize.
[2024-05-20 16:11:23] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 3 ms to minimize.
[2024-05-20 16:11:23] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 2 ms to minimize.
[2024-05-20 16:11:23] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-05-20 16:11:28] [INFO ] Deduced a trap composed of 89 places in 229 ms of which 3 ms to minimize.
[2024-05-20 16:11:29] [INFO ] Deduced a trap composed of 71 places in 221 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/946 variables, and 37 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/254 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 1/254 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-05-20 16:11:43] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 8 (OVERLAPS) 692/946 variables, 254/292 constraints. Problems are: Problem set: 85 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 882 constraints, problems are : Problem set: 85 solved, 590 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 590/675 constraints, Known Traps: 9/9 constraints]
After SMT, in 60838ms problems are : Problem set: 85 solved, 590 unsolved
Search for dead transitions found 85 dead transitions in 60854ms
Found 85 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 85 transitions
Dead transitions reduction (with SMT) removed 85 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 254/254 places, 607/692 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 607/607 (removed 0) transitions.
[2024-05-20 16:12:02] [INFO ] Redundant transitions in 20 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62094 ms. Remains : 254/254 places, 607/692 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-20 16:12:02] [INFO ] Flatten gal took : 80 ms
[2024-05-20 16:12:02] [INFO ] Flatten gal took : 79 ms
[2024-05-20 16:12:03] [INFO ] Input system was already deterministic with 1501 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1130/1130 places, 1501/1501 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1113 transition count 1484
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1113 transition count 1484
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 1099 transition count 1458
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 1099 transition count 1458
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 1099 transition count 1454
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 1093 transition count 1448
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 1088 transition count 1436
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 1088 transition count 1436
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 1083 transition count 1424
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 1083 transition count 1424
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 1079 transition count 1420
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 1079 transition count 1420
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 1076 transition count 1410
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 1076 transition count 1410
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 1073 transition count 1400
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 1073 transition count 1400
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 1071 transition count 1398
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 1071 transition count 1398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 1069 transition count 1389
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 1069 transition count 1389
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 1067 transition count 1380
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 1067 transition count 1380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 1065 transition count 1378
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 1065 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 1064 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 1064 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 1063 transition count 1362
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 1063 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 1062 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 1062 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 1061 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 1061 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 1060 transition count 1345
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 1060 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 1059 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 1059 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 1058 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 1058 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 1057 transition count 1328
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 1057 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 1056 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 1056 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 1055 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 1055 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 1054 transition count 1311
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 1054 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 1053 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 1053 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 1052 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 1052 transition count 1302
Applied a total of 160 rules in 933 ms. Remains 1052 /1130 variables (removed 78) and now considering 1302/1501 (removed 199) transitions.
// Phase 1: matrix 1302 rows 1052 cols
[2024-05-20 16:12:04] [INFO ] Computed 110 invariants in 13 ms
[2024-05-20 16:12:04] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-20 16:12:04] [INFO ] Invariant cache hit.
[2024-05-20 16:12:08] [INFO ] Implicit Places using invariants and state equation in 3260 ms returned []
Implicit Place search using SMT with State Equation took 4038 ms to find 0 implicit places.
Running 1301 sub problems to find dead transitions.
[2024-05-20 16:12:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1051 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1051/2354 variables, and 67 constraints, problems are : Problem set: 0 solved, 1301 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/28 constraints, Generalized P Invariants (flows): 67/82 constraints, State Equation: 0/1052 constraints, PredecessorRefiner: 1301/1301 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1051 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1051 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1301 unsolved
At refinement iteration 2 (OVERLAPS) 1/1052 variables, 28/95 constraints. Problems are: Problem set: 0 solved, 1301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1052 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1301 unsolved
[2024-05-20 16:13:08] [INFO ] Deduced a trap composed of 44 places in 395 ms of which 6 ms to minimize.
[2024-05-20 16:13:08] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1052/2354 variables, and 112 constraints, problems are : Problem set: 0 solved, 1301 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 0/1052 constraints, PredecessorRefiner: 0/1301 constraints, Known Traps: 2/2 constraints]
After SMT, in 60521ms problems are : Problem set: 0 solved, 1301 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Starting structural reductions in LTL mode, iteration 1 : 1052/1130 places, 1302/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65517 ms. Remains : 1052/1130 places, 1302/1501 transitions.
[2024-05-20 16:13:08] [INFO ] Flatten gal took : 47 ms
[2024-05-20 16:13:08] [INFO ] Flatten gal took : 48 ms
[2024-05-20 16:13:08] [INFO ] Input system was already deterministic with 1302 transitions.
[2024-05-20 16:13:08] [INFO ] Flatten gal took : 53 ms
[2024-05-20 16:13:08] [INFO ] Flatten gal took : 44 ms
[2024-05-20 16:13:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality16711459370048293949.gal : 39 ms
[2024-05-20 16:13:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality6406505525208827018.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/CTLCardinality16711459370048293949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6406505525208827018.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-20 16:13:39] [INFO ] Flatten gal took : 44 ms
[2024-05-20 16:13:39] [INFO ] Applying decomposition
[2024-05-20 16:13:39] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13416795202326976718.txt' '-o' '/tmp/graph13416795202326976718.bin' '-w' '/tmp/graph13416795202326976718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13416795202326976718.bin' '-l' '-1' '-v' '-w' '/tmp/graph13416795202326976718.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:13:39] [INFO ] Decomposing Gal with order
[2024-05-20 16:13:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:13:39] [INFO ] Removed a total of 1012 redundant transitions.
[2024-05-20 16:13:39] [INFO ] Flatten gal took : 179 ms
[2024-05-20 16:13:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 40 ms.
[2024-05-20 16:13:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality15104792365614976564.gal : 31 ms
[2024-05-20 16:13:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality7982417357858409625.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/CTLCardinality15104792365614976564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7982417357858409625.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 : 1130/1130 places, 1501/1501 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1110 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1110 transition count 1481
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1093 transition count 1452
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1093 transition count 1452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 1084 transition count 1439
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 1084 transition count 1439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 1079 transition count 1427
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 1079 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 1074 transition count 1415
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 1074 transition count 1415
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 1070 transition count 1411
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 1070 transition count 1411
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 1067 transition count 1401
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 1067 transition count 1401
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 1064 transition count 1391
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 1064 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 1062 transition count 1389
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 1062 transition count 1389
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 1060 transition count 1380
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 1060 transition count 1380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 1058 transition count 1371
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 1058 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 1056 transition count 1369
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 1056 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 1054 transition count 1360
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 1054 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 1052 transition count 1351
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 1041 transition count 1291
Applied a total of 182 rules in 973 ms. Remains 1041 /1130 variables (removed 89) and now considering 1291/1501 (removed 210) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2024-05-20 16:14:11] [INFO ] Computed 110 invariants in 13 ms
[2024-05-20 16:14:11] [INFO ] Implicit Places using invariants in 858 ms returned []
[2024-05-20 16:14:11] [INFO ] Invariant cache hit.
[2024-05-20 16:14:15] [INFO ] Implicit Places using invariants and state equation in 3340 ms returned []
Implicit Place search using SMT with State Equation took 4206 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2024-05-20 16:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1040 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (OVERLAPS) 1/1041 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-20 16:15:14] [INFO ] Deduced a trap composed of 89 places in 405 ms of which 8 ms to minimize.
[2024-05-20 16:15:15] [INFO ] Deduced a trap composed of 55 places in 650 ms of which 11 ms to minimize.
[2024-05-20 16:15:15] [INFO ] Deduced a trap composed of 115 places in 540 ms of which 6 ms to minimize.
SMT process timed out in 60480ms, After SMT, problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60499ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1130 places, 1291/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65682 ms. Remains : 1041/1130 places, 1291/1501 transitions.
[2024-05-20 16:15:15] [INFO ] Flatten gal took : 50 ms
[2024-05-20 16:15:15] [INFO ] Flatten gal took : 42 ms
[2024-05-20 16:15:15] [INFO ] Input system was already deterministic with 1291 transitions.
[2024-05-20 16:15:16] [INFO ] Flatten gal took : 40 ms
[2024-05-20 16:15:16] [INFO ] Flatten gal took : 40 ms
[2024-05-20 16:15:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality13455575804099322411.gal : 7 ms
[2024-05-20 16:15:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality12056200335997118396.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/CTLCardinality13455575804099322411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12056200335997118396.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-20 16:15:46] [INFO ] Flatten gal took : 39 ms
[2024-05-20 16:15:46] [INFO ] Applying decomposition
[2024-05-20 16:15:46] [INFO ] Flatten gal took : 41 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/graph3643015342970868077.txt' '-o' '/tmp/graph3643015342970868077.bin' '-w' '/tmp/graph3643015342970868077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3643015342970868077.bin' '-l' '-1' '-v' '-w' '/tmp/graph3643015342970868077.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:15:46] [INFO ] Decomposing Gal with order
[2024-05-20 16:15:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:15:46] [INFO ] Removed a total of 1012 redundant transitions.
[2024-05-20 16:15:46] [INFO ] Flatten gal took : 83 ms
[2024-05-20 16:15:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 21 ms.
[2024-05-20 16:15:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality14323333620589801829.gal : 17 ms
[2024-05-20 16:15:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality10368977556041145686.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/CTLCardinality14323333620589801829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10368977556041145686.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 : 1130/1130 places, 1501/1501 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1110 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1110 transition count 1481
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1093 transition count 1452
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1093 transition count 1452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 1085 transition count 1440
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 1085 transition count 1440
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 1081 transition count 1436
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 1081 transition count 1436
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 1077 transition count 1432
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 1077 transition count 1432
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 1074 transition count 1429
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 1074 transition count 1429
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 1072 transition count 1427
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 1072 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 1071 transition count 1426
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 1071 transition count 1426
Applied a total of 122 rules in 348 ms. Remains 1071 /1130 variables (removed 59) and now considering 1426/1501 (removed 75) transitions.
// Phase 1: matrix 1426 rows 1071 cols
[2024-05-20 16:16:17] [INFO ] Computed 110 invariants in 15 ms
[2024-05-20 16:16:17] [INFO ] Implicit Places using invariants in 936 ms returned []
[2024-05-20 16:16:17] [INFO ] Invariant cache hit.
[2024-05-20 16:16:21] [INFO ] Implicit Places using invariants and state equation in 3186 ms returned []
Implicit Place search using SMT with State Equation took 4126 ms to find 0 implicit places.
Running 1425 sub problems to find dead transitions.
[2024-05-20 16:16:21] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1070 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1070/2497 variables, and 63 constraints, problems are : Problem set: 0 solved, 1425 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/31 constraints, Generalized P Invariants (flows): 63/79 constraints, State Equation: 0/1071 constraints, PredecessorRefiner: 1425/1425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1070 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1070 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
At refinement iteration 2 (OVERLAPS) 1/1071 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
SMT process timed out in 60610ms, After SMT, problems are : Problem set: 0 solved, 1425 unsolved
Search for dead transitions found 0 dead transitions in 60630ms
Starting structural reductions in LTL mode, iteration 1 : 1071/1130 places, 1426/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65109 ms. Remains : 1071/1130 places, 1426/1501 transitions.
[2024-05-20 16:17:21] [INFO ] Flatten gal took : 42 ms
[2024-05-20 16:17:21] [INFO ] Flatten gal took : 43 ms
[2024-05-20 16:17:21] [INFO ] Input system was already deterministic with 1426 transitions.
[2024-05-20 16:17:22] [INFO ] Flatten gal took : 52 ms
[2024-05-20 16:17:22] [INFO ] Flatten gal took : 47 ms
[2024-05-20 16:17:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6997412703243798997.gal : 7 ms
[2024-05-20 16:17:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality8763205115330698979.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/CTLCardinality6997412703243798997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8763205115330698979.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-20 16:17:52] [INFO ] Flatten gal took : 41 ms
[2024-05-20 16:17:52] [INFO ] Applying decomposition
[2024-05-20 16:17:52] [INFO ] Flatten gal took : 41 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/graph16809050360382324235.txt' '-o' '/tmp/graph16809050360382324235.bin' '-w' '/tmp/graph16809050360382324235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16809050360382324235.bin' '-l' '-1' '-v' '-w' '/tmp/graph16809050360382324235.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:17:52] [INFO ] Decomposing Gal with order
[2024-05-20 16:17:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:17:52] [INFO ] Removed a total of 1233 redundant transitions.
[2024-05-20 16:17:52] [INFO ] Flatten gal took : 85 ms
[2024-05-20 16:17:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 21 ms.
[2024-05-20 16:17:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10763407914379263550.gal : 14 ms
[2024-05-20 16:17:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality18127987779303290300.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/CTLCardinality10763407914379263550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18127987779303290300.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 : 1130/1130 places, 1501/1501 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1110 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1110 transition count 1481
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1093 transition count 1452
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1093 transition count 1452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 1084 transition count 1439
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 1084 transition count 1439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 1079 transition count 1427
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 1079 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 1074 transition count 1415
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 1074 transition count 1415
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 1070 transition count 1411
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 1070 transition count 1411
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 1067 transition count 1401
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 1067 transition count 1401
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 1064 transition count 1391
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 1064 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 1062 transition count 1389
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 1062 transition count 1389
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 1060 transition count 1380
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 1060 transition count 1380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 1058 transition count 1371
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 1058 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 1056 transition count 1369
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 1056 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 1054 transition count 1360
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 1054 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 1052 transition count 1351
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 1041 transition count 1291
Applied a total of 182 rules in 922 ms. Remains 1041 /1130 variables (removed 89) and now considering 1291/1501 (removed 210) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2024-05-20 16:18:23] [INFO ] Computed 110 invariants in 12 ms
[2024-05-20 16:18:24] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-20 16:18:24] [INFO ] Invariant cache hit.
[2024-05-20 16:18:28] [INFO ] Implicit Places using invariants and state equation in 3783 ms returned []
Implicit Place search using SMT with State Equation took 4431 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2024-05-20 16:18:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 13.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 3.0)
(s46 1.0)
(s47 6.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 10.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 5.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 9.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 5.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 5.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 2.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 4.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 4.0)
(s416 1.0)
(s417 76.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 13.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 1.0)
(s629 0.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 0.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 0.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 4.0)
(s718 1.0)
(s719 0.0)
(s720 1.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 23.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1040 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (OVERLAPS) 1/1041 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-20 16:19:26] [INFO ] Deduced a trap composed of 89 places in 406 ms of which 6 ms to minimize.
[2024-05-20 16:19:27] [INFO ] Deduced a trap composed of 55 places in 559 ms of which 8 ms to minimize.
[2024-05-20 16:19:28] [INFO ] Deduced a trap composed of 115 places in 503 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 1)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 1)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 1)
(s747 0)
(s748 0)
(s749 0)
(s750 1)
(s751 0)
(s752 0)
(s753 1)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 1)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/2332 variables, and 113 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 3/3 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60502ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1130 places, 1291/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65859 ms. Remains : 1041/1130 places, 1291/1501 transitions.
[2024-05-20 16:19:28] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:19:28] [INFO ] Flatten gal took : 34 ms
[2024-05-20 16:19:28] [INFO ] Input system was already deterministic with 1291 transitions.
[2024-05-20 16:19:28] [INFO ] Flatten gal took : 35 ms
[2024-05-20 16:19:28] [INFO ] Flatten gal took : 42 ms
[2024-05-20 16:19:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality14497273989667604839.gal : 7 ms
[2024-05-20 16:19:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality1518120933894330120.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/CTLCardinality14497273989667604839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1518120933894330120.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-20 16:19:58] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:19:58] [INFO ] Applying decomposition
[2024-05-20 16:19:58] [INFO ] Flatten gal took : 32 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/graph11415593354340442755.txt' '-o' '/tmp/graph11415593354340442755.bin' '-w' '/tmp/graph11415593354340442755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11415593354340442755.bin' '-l' '-1' '-v' '-w' '/tmp/graph11415593354340442755.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:19:59] [INFO ] Decomposing Gal with order
[2024-05-20 16:19:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:19:59] [INFO ] Removed a total of 1010 redundant transitions.
[2024-05-20 16:19:59] [INFO ] Flatten gal took : 68 ms
[2024-05-20 16:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 11 ms.
[2024-05-20 16:19:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3618947362908546130.gal : 12 ms
[2024-05-20 16:19:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality17701164520534415453.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/CTLCardinality3618947362908546130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17701164520534415453.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 : 1130/1130 places, 1501/1501 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1110 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1110 transition count 1481
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1093 transition count 1452
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1093 transition count 1452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 1084 transition count 1439
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 1084 transition count 1439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 1079 transition count 1427
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 1079 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 1074 transition count 1415
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 1074 transition count 1415
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 1070 transition count 1411
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 1070 transition count 1411
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 1067 transition count 1401
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 1067 transition count 1401
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 1064 transition count 1391
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 1064 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 1062 transition count 1389
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 1062 transition count 1389
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 1060 transition count 1380
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 1060 transition count 1380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 1058 transition count 1371
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 1058 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 1056 transition count 1369
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 1056 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 1054 transition count 1360
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 1054 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 1052 transition count 1351
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 1041 transition count 1291
Applied a total of 182 rules in 947 ms. Remains 1041 /1130 variables (removed 89) and now considering 1291/1501 (removed 210) transitions.
[2024-05-20 16:20:30] [INFO ] Invariant cache hit.
[2024-05-20 16:20:30] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-05-20 16:20:30] [INFO ] Invariant cache hit.
[2024-05-20 16:20:34] [INFO ] Implicit Places using invariants and state equation in 3460 ms returned []
Implicit Place search using SMT with State Equation took 4093 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2024-05-20 16:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1040 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (OVERLAPS) 1/1041 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-20 16:21:33] [INFO ] Deduced a trap composed of 89 places in 403 ms of which 6 ms to minimize.
[2024-05-20 16:21:33] [INFO ] Deduced a trap composed of 55 places in 621 ms of which 8 ms to minimize.
[2024-05-20 16:21:34] [INFO ] Deduced a trap composed of 115 places in 521 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/2332 variables, and 113 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 3/3 constraints]
After SMT, in 60500ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60518ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1130 places, 1291/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65560 ms. Remains : 1041/1130 places, 1291/1501 transitions.
[2024-05-20 16:21:34] [INFO ] Flatten gal took : 30 ms
[2024-05-20 16:21:34] [INFO ] Flatten gal took : 37 ms
[2024-05-20 16:21:34] [INFO ] Input system was already deterministic with 1291 transitions.
[2024-05-20 16:21:34] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:21:35] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:21:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality1020693153599194604.gal : 7 ms
[2024-05-20 16:21:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality17831644916404236057.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/CTLCardinality1020693153599194604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17831644916404236057.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-20 16:22:05] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:22:05] [INFO ] Applying decomposition
[2024-05-20 16:22:05] [INFO ] Flatten gal took : 31 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/graph12632341503514802061.txt' '-o' '/tmp/graph12632341503514802061.bin' '-w' '/tmp/graph12632341503514802061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12632341503514802061.bin' '-l' '-1' '-v' '-w' '/tmp/graph12632341503514802061.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:22:05] [INFO ] Decomposing Gal with order
[2024-05-20 16:22:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:22:05] [INFO ] Removed a total of 1010 redundant transitions.
[2024-05-20 16:22:05] [INFO ] Flatten gal took : 69 ms
[2024-05-20 16:22:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 11 ms.
[2024-05-20 16:22:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11564770340082731500.gal : 13 ms
[2024-05-20 16:22:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality3046601462262791002.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/CTLCardinality11564770340082731500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3046601462262791002.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 : 1130/1130 places, 1501/1501 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1110 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1110 transition count 1481
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1093 transition count 1452
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1093 transition count 1452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 1084 transition count 1439
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 1084 transition count 1439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 1079 transition count 1427
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 1079 transition count 1427
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 1075 transition count 1416
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 1075 transition count 1416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 1072 transition count 1413
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 1072 transition count 1413
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 1070 transition count 1404
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 1070 transition count 1404
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 1068 transition count 1395
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 1068 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 1067 transition count 1394
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 1067 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 1066 transition count 1386
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 1066 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 1065 transition count 1378
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 1065 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 1064 transition count 1377
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 1064 transition count 1377
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 1063 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 1063 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 1062 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 1062 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 1061 transition count 1360
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 1061 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 1060 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 1060 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 1059 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 1059 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 1058 transition count 1343
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 1058 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 1057 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 1057 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 1056 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 1056 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 1055 transition count 1326
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 1055 transition count 1326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 1054 transition count 1318
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 1054 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 1053 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 1053 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 1052 transition count 1309
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 1052 transition count 1309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 1051 transition count 1301
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 1051 transition count 1301
Applied a total of 162 rules in 944 ms. Remains 1051 /1130 variables (removed 79) and now considering 1301/1501 (removed 200) transitions.
// Phase 1: matrix 1301 rows 1051 cols
[2024-05-20 16:22:36] [INFO ] Computed 110 invariants in 12 ms
[2024-05-20 16:22:37] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-20 16:22:37] [INFO ] Invariant cache hit.
[2024-05-20 16:22:40] [INFO ] Implicit Places using invariants and state equation in 3216 ms returned []
Implicit Place search using SMT with State Equation took 3998 ms to find 0 implicit places.
Running 1300 sub problems to find dead transitions.
[2024-05-20 16:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1050 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1050/2352 variables, and 67 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/28 constraints, Generalized P Invariants (flows): 67/82 constraints, State Equation: 0/1051 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1050 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1050 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 2 (OVERLAPS) 1/1051 variables, 28/95 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1051 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-05-20 16:23:40] [INFO ] Deduced a trap composed of 49 places in 406 ms of which 6 ms to minimize.
[2024-05-20 16:23:41] [INFO ] Deduced a trap composed of 77 places in 393 ms of which 6 ms to minimize.
SMT process timed out in 60774ms, After SMT, problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60789ms
Starting structural reductions in LTL mode, iteration 1 : 1051/1130 places, 1301/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65735 ms. Remains : 1051/1130 places, 1301/1501 transitions.
[2024-05-20 16:23:41] [INFO ] Flatten gal took : 30 ms
[2024-05-20 16:23:41] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:23:41] [INFO ] Input system was already deterministic with 1301 transitions.
[2024-05-20 16:23:41] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:23:41] [INFO ] Flatten gal took : 33 ms
[2024-05-20 16:23:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality14311396084011589227.gal : 5 ms
[2024-05-20 16:23:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality586537727362299181.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/CTLCardinality14311396084011589227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality586537727362299181.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-20 16:24:11] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:24:11] [INFO ] Applying decomposition
[2024-05-20 16:24:11] [INFO ] Flatten gal took : 37 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/graph4371277811987022050.txt' '-o' '/tmp/graph4371277811987022050.bin' '-w' '/tmp/graph4371277811987022050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4371277811987022050.bin' '-l' '-1' '-v' '-w' '/tmp/graph4371277811987022050.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:24:11] [INFO ] Decomposing Gal with order
[2024-05-20 16:24:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:24:11] [INFO ] Removed a total of 1018 redundant transitions.
[2024-05-20 16:24:11] [INFO ] Flatten gal took : 61 ms
[2024-05-20 16:24:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 9 ms.
[2024-05-20 16:24:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality17842893200512491499.gal : 11 ms
[2024-05-20 16:24:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality1894896210248093452.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/CTLCardinality17842893200512491499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1894896210248093452.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 : 1130/1130 places, 1501/1501 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1114 transition count 1485
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1114 transition count 1485
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 1099 transition count 1458
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 1099 transition count 1458
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 1099 transition count 1455
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 1091 transition count 1447
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 1091 transition count 1447
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 1088 transition count 1437
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 1088 transition count 1437
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 1085 transition count 1427
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 1085 transition count 1427
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 1083 transition count 1425
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 1083 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 1081 transition count 1416
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 1081 transition count 1416
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 1079 transition count 1407
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 1079 transition count 1407
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 1078 transition count 1406
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 1078 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1077 transition count 1398
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1077 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 1076 transition count 1390
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 1076 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 1075 transition count 1389
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 1075 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 1074 transition count 1381
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 1074 transition count 1381
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 1073 transition count 1373
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 1073 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 1072 transition count 1372
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 1072 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 1071 transition count 1364
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 1071 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 1070 transition count 1356
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 1070 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 1069 transition count 1355
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 1069 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 1068 transition count 1347
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 1068 transition count 1347
Applied a total of 127 rules in 741 ms. Remains 1068 /1130 variables (removed 62) and now considering 1347/1501 (removed 154) transitions.
// Phase 1: matrix 1347 rows 1068 cols
[2024-05-20 16:24:42] [INFO ] Computed 110 invariants in 12 ms
[2024-05-20 16:24:43] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-05-20 16:24:43] [INFO ] Invariant cache hit.
[2024-05-20 16:24:46] [INFO ] Implicit Places using invariants and state equation in 3231 ms returned []
Implicit Place search using SMT with State Equation took 4063 ms to find 0 implicit places.
Running 1346 sub problems to find dead transitions.
[2024-05-20 16:24:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1067 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1346 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1067/2415 variables, and 60 constraints, problems are : Problem set: 0 solved, 1346 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 60/80 constraints, State Equation: 0/1068 constraints, PredecessorRefiner: 1346/1346 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1067 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1067 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1346 unsolved
At refinement iteration 2 (OVERLAPS) 1/1068 variables, 30/90 constraints. Problems are: Problem set: 0 solved, 1346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1068 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1346 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 1)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 1)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 1)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 1)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 1)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 1)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 1)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 1)
(s788 0)
(s789 0)
(s790 1)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 1)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 1)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 1)
(s879 0)
(s880 1)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1068/2415 variables, and 110 constraints, problems are : Problem set: 0 solved, 1346 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/1068 constraints, PredecessorRefiner: 0/1346 constraints, Known Traps: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 1346 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Starting structural reductions in LTL mode, iteration 1 : 1068/1130 places, 1347/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65348 ms. Remains : 1068/1130 places, 1347/1501 transitions.
[2024-05-20 16:25:47] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:25:47] [INFO ] Flatten gal took : 34 ms
[2024-05-20 16:25:47] [INFO ] Input system was already deterministic with 1347 transitions.
[2024-05-20 16:25:47] [INFO ] Flatten gal took : 33 ms
[2024-05-20 16:25:47] [INFO ] Flatten gal took : 34 ms
[2024-05-20 16:25:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18378482992839405173.gal : 6 ms
[2024-05-20 16:25:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality5450568175595198509.ctl : 75 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/CTLCardinality18378482992839405173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5450568175595198509.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-20 16:26:17] [INFO ] Flatten gal took : 34 ms
[2024-05-20 16:26:17] [INFO ] Applying decomposition
[2024-05-20 16:26:17] [INFO ] Flatten gal took : 35 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/graph15162808573404624809.txt' '-o' '/tmp/graph15162808573404624809.bin' '-w' '/tmp/graph15162808573404624809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15162808573404624809.bin' '-l' '-1' '-v' '-w' '/tmp/graph15162808573404624809.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:26:17] [INFO ] Decomposing Gal with order
[2024-05-20 16:26:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:26:17] [INFO ] Removed a total of 1077 redundant transitions.
[2024-05-20 16:26:17] [INFO ] Flatten gal took : 58 ms
[2024-05-20 16:26:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 8 ms.
[2024-05-20 16:26:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1563720494054063432.gal : 12 ms
[2024-05-20 16:26:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3989513275458742847.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/CTLCardinality1563720494054063432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3989513275458742847.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 : 1130/1130 places, 1501/1501 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1129 transition count 1295
Reduce places removed 205 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 413 place count 924 transition count 1292
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 rules applied. Total rules applied 417 place count 923 transition count 1289
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 420 place count 921 transition count 1288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 421 place count 920 transition count 1288
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 288 Pre rules applied. Total rules applied 421 place count 920 transition count 1000
Deduced a syphon composed of 288 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 5 with 598 rules applied. Total rules applied 1019 place count 610 transition count 1000
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 15 rules applied. Total rules applied 1034 place count 608 transition count 987
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 14 rules applied. Total rules applied 1048 place count 595 transition count 986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1049 place count 594 transition count 986
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 1049 place count 594 transition count 977
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 27 rules applied. Total rules applied 1076 place count 576 transition count 977
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 1076 place count 576 transition count 969
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1092 place count 568 transition count 969
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1105 place count 555 transition count 956
Iterating global reduction 8 with 13 rules applied. Total rules applied 1118 place count 555 transition count 956
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 1118 place count 555 transition count 950
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1130 place count 549 transition count 950
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1138 place count 541 transition count 930
Iterating global reduction 8 with 8 rules applied. Total rules applied 1146 place count 541 transition count 930
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1148 place count 539 transition count 921
Iterating global reduction 8 with 2 rules applied. Total rules applied 1150 place count 539 transition count 921
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1152 place count 537 transition count 912
Iterating global reduction 8 with 2 rules applied. Total rules applied 1154 place count 537 transition count 912
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1155 place count 536 transition count 904
Iterating global reduction 8 with 1 rules applied. Total rules applied 1156 place count 536 transition count 904
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1157 place count 535 transition count 896
Iterating global reduction 8 with 1 rules applied. Total rules applied 1158 place count 535 transition count 896
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1159 place count 534 transition count 888
Iterating global reduction 8 with 1 rules applied. Total rules applied 1160 place count 534 transition count 888
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1161 place count 533 transition count 880
Iterating global reduction 8 with 1 rules applied. Total rules applied 1162 place count 533 transition count 880
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1163 place count 532 transition count 872
Iterating global reduction 8 with 1 rules applied. Total rules applied 1164 place count 532 transition count 872
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1165 place count 531 transition count 864
Iterating global reduction 8 with 1 rules applied. Total rules applied 1166 place count 531 transition count 864
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1167 place count 530 transition count 856
Iterating global reduction 8 with 1 rules applied. Total rules applied 1168 place count 530 transition count 856
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1169 place count 529 transition count 848
Iterating global reduction 8 with 1 rules applied. Total rules applied 1170 place count 529 transition count 848
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1171 place count 528 transition count 840
Iterating global reduction 8 with 1 rules applied. Total rules applied 1172 place count 528 transition count 840
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1173 place count 527 transition count 832
Iterating global reduction 8 with 1 rules applied. Total rules applied 1174 place count 527 transition count 832
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1175 place count 526 transition count 824
Iterating global reduction 8 with 1 rules applied. Total rules applied 1176 place count 526 transition count 824
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1177 place count 525 transition count 816
Iterating global reduction 8 with 1 rules applied. Total rules applied 1178 place count 525 transition count 816
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1179 place count 524 transition count 808
Iterating global reduction 8 with 1 rules applied. Total rules applied 1180 place count 524 transition count 808
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 8 with 135 rules applied. Total rules applied 1315 place count 456 transition count 741
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1318 place count 453 transition count 738
Ensure Unique test removed 1 places
Iterating global reduction 8 with 4 rules applied. Total rules applied 1322 place count 452 transition count 738
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1322 place count 452 transition count 737
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1324 place count 451 transition count 737
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1326 place count 449 transition count 735
Iterating global reduction 8 with 2 rules applied. Total rules applied 1328 place count 449 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 1330 place count 449 transition count 733
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1331 place count 448 transition count 733
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1331 place count 448 transition count 732
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1333 place count 447 transition count 732
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1334 place count 447 transition count 732
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1336 place count 445 transition count 730
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1338 place count 443 transition count 730
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1338 place count 443 transition count 724
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 1351 place count 436 transition count 724
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 11 with 3 rules applied. Total rules applied 1354 place count 433 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1354 place count 433 transition count 723
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1356 place count 432 transition count 723
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 1362 place count 429 transition count 720
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1364 place count 427 transition count 718
Iterating global reduction 12 with 2 rules applied. Total rules applied 1366 place count 427 transition count 718
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1368 place count 425 transition count 716
Iterating global reduction 12 with 2 rules applied. Total rules applied 1370 place count 425 transition count 716
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1372 place count 425 transition count 714
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 1372 place count 425 transition count 712
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1376 place count 423 transition count 712
Applied a total of 1376 rules in 470 ms. Remains 423 /1130 variables (removed 707) and now considering 712/1501 (removed 789) transitions.
// Phase 1: matrix 712 rows 423 cols
[2024-05-20 16:26:48] [INFO ] Computed 69 invariants in 7 ms
[2024-05-20 16:26:48] [INFO ] Implicit Places using invariants in 471 ms returned [1, 18, 19, 34, 51, 69, 89, 155, 165, 166, 167, 168, 170, 187, 205, 225, 290, 291, 294, 305, 306, 307, 308, 309, 327, 331, 350, 351, 352, 353]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 473 ms to find 30 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 393/1130 places, 712/1501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 393 transition count 661
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 104 place count 342 transition count 659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 340 transition count 659
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 106 place count 340 transition count 641
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 142 place count 322 transition count 641
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 9 rules applied. Total rules applied 151 place count 319 transition count 635
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 157 place count 313 transition count 635
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 159 place count 311 transition count 633
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 311 transition count 633
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 163 place count 311 transition count 631
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 199 place count 293 transition count 613
Applied a total of 199 rules in 35 ms. Remains 293 /393 variables (removed 100) and now considering 613/712 (removed 99) transitions.
// Phase 1: matrix 613 rows 293 cols
[2024-05-20 16:26:48] [INFO ] Computed 36 invariants in 5 ms
[2024-05-20 16:26:49] [INFO ] Implicit Places using invariants in 363 ms returned [96, 103, 109, 191, 198, 205, 285, 289]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 364 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 285/1130 places, 613/1501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 285 transition count 612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 284 transition count 612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 280 transition count 608
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 280 transition count 608
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 276 transition count 604
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 276 transition count 604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 274 transition count 602
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 274 transition count 602
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 2 with 4 rules applied. Total rules applied 26 place count 272 transition count 600
Applied a total of 26 rules in 29 ms. Remains 272 /285 variables (removed 13) and now considering 600/613 (removed 13) transitions.
// Phase 1: matrix 600 rows 272 cols
[2024-05-20 16:26:49] [INFO ] Computed 28 invariants in 4 ms
[2024-05-20 16:26:49] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-20 16:26:49] [INFO ] Invariant cache hit.
[2024-05-20 16:26:50] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 272/1130 places, 600/1501 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 2403 ms. Remains : 272/1130 places, 600/1501 transitions.
[2024-05-20 16:26:50] [INFO ] Flatten gal took : 16 ms
[2024-05-20 16:26:50] [INFO ] Flatten gal took : 18 ms
[2024-05-20 16:26:50] [INFO ] Input system was already deterministic with 600 transitions.
[2024-05-20 16:26:50] [INFO ] Flatten gal took : 18 ms
[2024-05-20 16:26:50] [INFO ] Flatten gal took : 18 ms
[2024-05-20 16:26:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality13220530267520075914.gal : 3 ms
[2024-05-20 16:26:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality12675325586885357089.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/CTLCardinality13220530267520075914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12675325586885357089.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.44187e+08,20.1846,408676,2,14986,5,1.2574e+06,6,0,1691,1.35663e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 16:27:20] [INFO ] Flatten gal took : 19 ms
[2024-05-20 16:27:20] [INFO ] Applying decomposition
[2024-05-20 16:27:20] [INFO ] Flatten gal took : 17 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/graph4505389584526799568.txt' '-o' '/tmp/graph4505389584526799568.bin' '-w' '/tmp/graph4505389584526799568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4505389584526799568.bin' '-l' '-1' '-v' '-w' '/tmp/graph4505389584526799568.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:27:20] [INFO ] Decomposing Gal with order
[2024-05-20 16:27:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:27:20] [INFO ] Removed a total of 1129 redundant transitions.
[2024-05-20 16:27:20] [INFO ] Flatten gal took : 40 ms
[2024-05-20 16:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 7 ms.
[2024-05-20 16:27:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10271527485994726355.gal : 3 ms
[2024-05-20 16:27:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality14504460897421836677.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/CTLCardinality10271527485994726355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14504460897421836677.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.44187e+08,16.3222,320020,1737,965,468238,45514,1055,1.2357e+06,249,393424,0


Converting to forward existential form...Done !
original formula: EG(EF(((EF((i2.u24.p173==0)) * ((i7.u70.p1084==0)||(i0.u8.p63==1))) * ((((i1.i1.u46.p574==0)||(i7.u71.p1168==1))||((i4.i0.u49.p754==0)||(...223
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((E(TRUE U (i2.u24.p173==0)) * ((i7.u70.p1084==0)||(i0.u8.p63==1))) * ((((i1.i1.u46.p574==0)...278
Reverse transition relation is NOT exact ! Due to transitions t507, t517, t566, t574, t589, t591, t599, i3.t529, i3.i0.t528, i4.t533, i4.i0.t489, i4.i0.t59...478
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1130/1130 places, 1501/1501 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1110 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1110 transition count 1481
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1093 transition count 1452
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1093 transition count 1452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 1084 transition count 1439
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 1084 transition count 1439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 1079 transition count 1427
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 1079 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 1074 transition count 1415
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 1074 transition count 1415
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 1070 transition count 1411
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 1070 transition count 1411
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 1067 transition count 1401
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 1067 transition count 1401
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 1064 transition count 1391
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 1064 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 1062 transition count 1389
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 1062 transition count 1389
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 1060 transition count 1380
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 1060 transition count 1380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 1058 transition count 1371
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 1058 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 1056 transition count 1369
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 1056 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 1054 transition count 1360
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 1054 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 1052 transition count 1351
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 1041 transition count 1291
Applied a total of 182 rules in 945 ms. Remains 1041 /1130 variables (removed 89) and now considering 1291/1501 (removed 210) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2024-05-20 16:27:51] [INFO ] Computed 110 invariants in 12 ms
[2024-05-20 16:27:52] [INFO ] Implicit Places using invariants in 840 ms returned []
[2024-05-20 16:27:52] [INFO ] Invariant cache hit.
[2024-05-20 16:27:56] [INFO ] Implicit Places using invariants and state equation in 3576 ms returned []
Implicit Place search using SMT with State Equation took 4421 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2024-05-20 16:27:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 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 Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1040 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (OVERLAPS) 1/1041 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-20 16:28:55] [INFO ] Deduced a trap composed of 89 places in 402 ms of which 6 ms to minimize.
[2024-05-20 16:28:56] [INFO ] Deduced a trap composed of 55 places in 591 ms of which 8 ms to minimize.
SMT process timed out in 60464ms, After SMT, problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1130 places, 1291/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65848 ms. Remains : 1041/1130 places, 1291/1501 transitions.
[2024-05-20 16:28:56] [INFO ] Flatten gal took : 36 ms
[2024-05-20 16:28:56] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:28:56] [INFO ] Input system was already deterministic with 1291 transitions.
[2024-05-20 16:28:56] [INFO ] Flatten gal took : 30 ms
[2024-05-20 16:28:56] [INFO ] Flatten gal took : 30 ms
[2024-05-20 16:28:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9516917001617355770.gal : 5 ms
[2024-05-20 16:28:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality1198607358192250187.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/CTLCardinality9516917001617355770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1198607358192250187.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-20 16:29:26] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:29:26] [INFO ] Applying decomposition
[2024-05-20 16:29:26] [INFO ] Flatten gal took : 31 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/graph13207478435129943575.txt' '-o' '/tmp/graph13207478435129943575.bin' '-w' '/tmp/graph13207478435129943575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13207478435129943575.bin' '-l' '-1' '-v' '-w' '/tmp/graph13207478435129943575.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:29:26] [INFO ] Decomposing Gal with order
[2024-05-20 16:29:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:29:27] [INFO ] Removed a total of 1006 redundant transitions.
[2024-05-20 16:29:27] [INFO ] Flatten gal took : 50 ms
[2024-05-20 16:29:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 5 ms.
[2024-05-20 16:29:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality7345593533898304238.gal : 8 ms
[2024-05-20 16:29:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality9317922433226157700.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/CTLCardinality7345593533898304238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9317922433226157700.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 : 1130/1130 places, 1501/1501 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1129 transition count 1290
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 217 rules applied. Total rules applied 427 place count 919 transition count 1283
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 rules applied. Total rules applied 433 place count 916 transition count 1280
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 436 place count 914 transition count 1279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 437 place count 913 transition count 1279
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 288 Pre rules applied. Total rules applied 437 place count 913 transition count 991
Deduced a syphon composed of 288 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 5 with 599 rules applied. Total rules applied 1036 place count 602 transition count 991
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 18 rules applied. Total rules applied 1054 place count 600 transition count 975
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1070 place count 584 transition count 975
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 1070 place count 584 transition count 967
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1094 place count 568 transition count 967
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 1094 place count 568 transition count 960
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1108 place count 561 transition count 960
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1121 place count 548 transition count 947
Iterating global reduction 7 with 13 rules applied. Total rules applied 1134 place count 548 transition count 947
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 1134 place count 548 transition count 941
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1146 place count 542 transition count 941
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1154 place count 534 transition count 921
Iterating global reduction 7 with 8 rules applied. Total rules applied 1162 place count 534 transition count 921
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1164 place count 532 transition count 912
Iterating global reduction 7 with 2 rules applied. Total rules applied 1166 place count 532 transition count 912
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1168 place count 530 transition count 903
Iterating global reduction 7 with 2 rules applied. Total rules applied 1170 place count 530 transition count 903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1171 place count 529 transition count 895
Iterating global reduction 7 with 1 rules applied. Total rules applied 1172 place count 529 transition count 895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1173 place count 528 transition count 887
Iterating global reduction 7 with 1 rules applied. Total rules applied 1174 place count 528 transition count 887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1175 place count 527 transition count 879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1176 place count 527 transition count 879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1177 place count 526 transition count 871
Iterating global reduction 7 with 1 rules applied. Total rules applied 1178 place count 526 transition count 871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1179 place count 525 transition count 863
Iterating global reduction 7 with 1 rules applied. Total rules applied 1180 place count 525 transition count 863
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1181 place count 524 transition count 855
Iterating global reduction 7 with 1 rules applied. Total rules applied 1182 place count 524 transition count 855
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1183 place count 523 transition count 847
Iterating global reduction 7 with 1 rules applied. Total rules applied 1184 place count 523 transition count 847
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1185 place count 522 transition count 839
Iterating global reduction 7 with 1 rules applied. Total rules applied 1186 place count 522 transition count 839
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1187 place count 521 transition count 831
Iterating global reduction 7 with 1 rules applied. Total rules applied 1188 place count 521 transition count 831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1189 place count 520 transition count 823
Iterating global reduction 7 with 1 rules applied. Total rules applied 1190 place count 520 transition count 823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1191 place count 519 transition count 815
Iterating global reduction 7 with 1 rules applied. Total rules applied 1192 place count 519 transition count 815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 518 transition count 807
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 518 transition count 807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1195 place count 517 transition count 799
Iterating global reduction 7 with 1 rules applied. Total rules applied 1196 place count 517 transition count 799
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 7 with 145 rules applied. Total rules applied 1341 place count 443 transition count 728
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1345 place count 439 transition count 724
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 1350 place count 438 transition count 724
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1351 place count 438 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1352 place count 437 transition count 723
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1352 place count 437 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1354 place count 436 transition count 722
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1357 place count 433 transition count 719
Iterating global reduction 9 with 3 rules applied. Total rules applied 1360 place count 433 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 1362 place count 433 transition count 717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1363 place count 432 transition count 717
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1363 place count 432 transition count 716
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1365 place count 431 transition count 716
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1366 place count 430 transition count 715
Iterating global reduction 11 with 1 rules applied. Total rules applied 1367 place count 430 transition count 715
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1368 place count 430 transition count 715
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1370 place count 428 transition count 713
Reduce places removed 4 places and 0 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 11 with 6 rules applied. Total rules applied 1376 place count 424 transition count 711
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1378 place count 422 transition count 711
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 8 Pre rules applied. Total rules applied 1378 place count 422 transition count 703
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 17 rules applied. Total rules applied 1395 place count 413 transition count 703
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 1400 place count 408 transition count 703
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1400 place count 408 transition count 702
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1402 place count 407 transition count 702
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1412 place count 402 transition count 697
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1416 place count 398 transition count 693
Iterating global reduction 14 with 4 rules applied. Total rules applied 1420 place count 398 transition count 693
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1422 place count 396 transition count 691
Iterating global reduction 14 with 2 rules applied. Total rules applied 1424 place count 396 transition count 691
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1425 place count 396 transition count 690
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1425 place count 396 transition count 689
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1427 place count 395 transition count 689
Applied a total of 1427 rules in 386 ms. Remains 395 /1130 variables (removed 735) and now considering 689/1501 (removed 812) transitions.
// Phase 1: matrix 689 rows 395 cols
[2024-05-20 16:29:57] [INFO ] Computed 63 invariants in 5 ms
[2024-05-20 16:29:57] [INFO ] Implicit Places using invariants in 431 ms returned [1, 18, 19, 32, 49, 67, 86, 143, 146, 156, 157, 159, 176, 194, 215, 271, 272, 275, 286, 287, 288, 306, 328, 329, 330, 331]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 434 ms to find 26 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 369/1130 places, 689/1501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 369 transition count 642
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 322 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 321 transition count 641
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 96 place count 321 transition count 624
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 35 rules applied. Total rules applied 131 place count 303 transition count 624
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 143 place count 299 transition count 616
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 151 place count 291 transition count 616
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 154 place count 288 transition count 613
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 288 transition count 613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 159 place count 288 transition count 611
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 189 place count 273 transition count 596
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 273 transition count 595
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 6 with 1 rules applied. Total rules applied 191 place count 273 transition count 594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 192 place count 272 transition count 594
Applied a total of 192 rules in 39 ms. Remains 272 /369 variables (removed 97) and now considering 594/689 (removed 95) transitions.
// Phase 1: matrix 594 rows 272 cols
[2024-05-20 16:29:58] [INFO ] Computed 32 invariants in 4 ms
[2024-05-20 16:29:58] [INFO ] Implicit Places using invariants in 436 ms returned [91, 98, 186, 193, 199, 269]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 437 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 266/1130 places, 594/1501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 266 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 265 transition count 593
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 262 transition count 590
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 262 transition count 590
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 259 transition count 587
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 259 transition count 587
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 257 transition count 585
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 257 transition count 585
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 255 transition count 583
Applied a total of 22 rules in 27 ms. Remains 255 /266 variables (removed 11) and now considering 583/594 (removed 11) transitions.
// Phase 1: matrix 583 rows 255 cols
[2024-05-20 16:29:58] [INFO ] Computed 26 invariants in 4 ms
[2024-05-20 16:29:58] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-20 16:29:58] [INFO ] Invariant cache hit.
[2024-05-20 16:29:59] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 255/1130 places, 583/1501 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 2491 ms. Remains : 255/1130 places, 583/1501 transitions.
[2024-05-20 16:29:59] [INFO ] Flatten gal took : 15 ms
[2024-05-20 16:29:59] [INFO ] Flatten gal took : 16 ms
[2024-05-20 16:29:59] [INFO ] Input system was already deterministic with 583 transitions.
[2024-05-20 16:29:59] [INFO ] Flatten gal took : 17 ms
[2024-05-20 16:29:59] [INFO ] Flatten gal took : 17 ms
[2024-05-20 16:29:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality27637093736897663.gal : 3 ms
[2024-05-20 16:29:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality6419863024461454120.ctl : 5 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/CTLCardinality27637093736897663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6419863024461454120.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.16948e+08,16.1374,335124,2,13671,5,1.00063e+06,6,0,1606,1.028e+06,0


Converting to forward existential form...Done !
original formula: (EG(AF((p362!=1))) * AG(((p595==0)||(p371==1))))
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!((p362!=1)))))))] = FALSE * [(FwdU(Init,TRUE) * !(((p595==0)||(p371==1))))] = FALSE)
(forward)formula 0,0,16.1529,335124,1,0,8,1.00063e+06,9,2,1617,1.028e+06,1
FORMULA ASLink-PT-02b-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1130/1130 places, 1501/1501 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1111 transition count 1482
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1111 transition count 1482
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 1095 transition count 1454
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 1095 transition count 1454
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 1095 transition count 1450
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 1089 transition count 1444
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 1089 transition count 1444
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 1086 transition count 1434
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 1086 transition count 1434
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 1083 transition count 1424
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 1083 transition count 1424
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 1080 transition count 1421
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 1080 transition count 1421
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 1078 transition count 1412
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 1078 transition count 1412
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 1077 transition count 1404
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 1077 transition count 1404
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 1076 transition count 1403
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 1076 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 1075 transition count 1395
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 1075 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 1074 transition count 1387
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 1074 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 1073 transition count 1386
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 1073 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 1072 transition count 1378
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 1072 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 1071 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 1071 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 1070 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 1070 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 1069 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 1069 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 1068 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 1068 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 1067 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 1067 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 1066 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 1066 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 1065 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 1065 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 1064 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 1064 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 1063 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 1063 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 1062 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 1062 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 1061 transition count 1318
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 1061 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 1060 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 1060 transition count 1310
Applied a total of 144 rules in 946 ms. Remains 1060 /1130 variables (removed 70) and now considering 1310/1501 (removed 191) transitions.
// Phase 1: matrix 1310 rows 1060 cols
[2024-05-20 16:30:16] [INFO ] Computed 110 invariants in 16 ms
[2024-05-20 16:30:17] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-05-20 16:30:17] [INFO ] Invariant cache hit.
[2024-05-20 16:30:21] [INFO ] Implicit Places using invariants and state equation in 4256 ms returned []
Implicit Place search using SMT with State Equation took 5030 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-05-20 16:30:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1059 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 13.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 3.0)
(s45 1.0)
(s46 1.0)
(s47 6.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 10.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 11.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 31.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 5.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 4.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 5.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 5.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 2.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 4.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 101.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1059/2370 variables, and 65 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1059 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1059 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (OVERLAPS) 1/1060 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1060 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
[2024-05-20 16:31:21] [INFO ] Deduced a trap composed of 159 places in 566 ms of which 7 ms to minimize.
[2024-05-20 16:31:21] [INFO ] Deduced a trap composed of 108 places in 187 ms of which 3 ms to minimize.
[2024-05-20 16:31:22] [INFO ] Deduced a trap composed of 174 places in 471 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/2370 variables, and 113 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 3/3 constraints]
After SMT, in 60506ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Starting structural reductions in LTL mode, iteration 1 : 1060/1130 places, 1310/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66501 ms. Remains : 1060/1130 places, 1310/1501 transitions.
[2024-05-20 16:31:22] [INFO ] Flatten gal took : 29 ms
[2024-05-20 16:31:22] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:31:22] [INFO ] Input system was already deterministic with 1310 transitions.
[2024-05-20 16:31:22] [INFO ] Flatten gal took : 30 ms
[2024-05-20 16:31:22] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:31:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality14386025035472423247.gal : 9 ms
[2024-05-20 16:31:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality7940543876490335932.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/CTLCardinality14386025035472423247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7940543876490335932.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-20 16:31:52] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:31:52] [INFO ] Applying decomposition
[2024-05-20 16:31:52] [INFO ] Flatten gal took : 31 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/graph18389864726174879599.txt' '-o' '/tmp/graph18389864726174879599.bin' '-w' '/tmp/graph18389864726174879599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18389864726174879599.bin' '-l' '-1' '-v' '-w' '/tmp/graph18389864726174879599.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:31:52] [INFO ] Decomposing Gal with order
[2024-05-20 16:31:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:31:52] [INFO ] Removed a total of 1011 redundant transitions.
[2024-05-20 16:31:52] [INFO ] Flatten gal took : 52 ms
[2024-05-20 16:31:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 6 ms.
[2024-05-20 16:31:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9826520089596010107.gal : 9 ms
[2024-05-20 16:31:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1087320897344267784.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/CTLCardinality9826520089596010107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1087320897344267784.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1130/1130 places, 1501/1501 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1112 transition count 1483
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1112 transition count 1483
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 1097 transition count 1456
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 1097 transition count 1456
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 1097 transition count 1452
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 79 place count 1088 transition count 1443
Iterating global reduction 1 with 9 rules applied. Total rules applied 88 place count 1088 transition count 1443
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 1084 transition count 1432
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 1084 transition count 1432
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 1079 transition count 1420
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 1079 transition count 1420
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 1075 transition count 1416
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 1075 transition count 1416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 1072 transition count 1406
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 1072 transition count 1406
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 1069 transition count 1396
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 1069 transition count 1396
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 1067 transition count 1394
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 1067 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 1065 transition count 1385
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 1065 transition count 1385
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 1063 transition count 1376
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 1063 transition count 1376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 140 place count 1061 transition count 1374
Iterating global reduction 1 with 2 rules applied. Total rules applied 142 place count 1061 transition count 1374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 144 place count 1059 transition count 1365
Iterating global reduction 1 with 2 rules applied. Total rules applied 146 place count 1059 transition count 1365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 1057 transition count 1356
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 1057 transition count 1356
Applied a total of 150 rules in 548 ms. Remains 1057 /1130 variables (removed 73) and now considering 1356/1501 (removed 145) transitions.
// Phase 1: matrix 1356 rows 1057 cols
[2024-05-20 16:32:23] [INFO ] Computed 110 invariants in 16 ms
[2024-05-20 16:32:24] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-20 16:32:24] [INFO ] Invariant cache hit.
[2024-05-20 16:32:29] [INFO ] Implicit Places using invariants and state equation in 5356 ms returned []
Implicit Place search using SMT with State Equation took 6226 ms to find 0 implicit places.
Running 1355 sub problems to find dead transitions.
[2024-05-20 16:32:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1056/2413 variables, and 61 constraints, problems are : Problem set: 0 solved, 1355 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/26 constraints, Generalized P Invariants (flows): 61/84 constraints, State Equation: 0/1057 constraints, PredecessorRefiner: 1355/1355 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1056 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 2 (OVERLAPS) 1/1057 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1057 variables, 23/110 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
[2024-05-20 16:33:29] [INFO ] Deduced a trap composed of 123 places in 285 ms of which 5 ms to minimize.
[2024-05-20 16:33:30] [INFO ] Deduced a trap composed of 90 places in 293 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1057/2413 variables, and 112 constraints, problems are : Problem set: 0 solved, 1355 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 0/1057 constraints, PredecessorRefiner: 0/1355 constraints, Known Traps: 2/2 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 1355 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 1057/1130 places, 1356/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67336 ms. Remains : 1057/1130 places, 1356/1501 transitions.
[2024-05-20 16:33:30] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:33:30] [INFO ] Flatten gal took : 33 ms
[2024-05-20 16:33:30] [INFO ] Input system was already deterministic with 1356 transitions.
[2024-05-20 16:33:30] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:33:30] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:33:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality18326090136584439367.gal : 6 ms
[2024-05-20 16:33:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality2069391703131475275.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/CTLCardinality18326090136584439367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2069391703131475275.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-20 16:34:00] [INFO ] Flatten gal took : 33 ms
[2024-05-20 16:34:00] [INFO ] Applying decomposition
[2024-05-20 16:34:00] [INFO ] Flatten gal took : 32 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/graph17726006773546903827.txt' '-o' '/tmp/graph17726006773546903827.bin' '-w' '/tmp/graph17726006773546903827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17726006773546903827.bin' '-l' '-1' '-v' '-w' '/tmp/graph17726006773546903827.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:34:00] [INFO ] Decomposing Gal with order
[2024-05-20 16:34:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:34:00] [INFO ] Removed a total of 1119 redundant transitions.
[2024-05-20 16:34:00] [INFO ] Flatten gal took : 51 ms
[2024-05-20 16:34:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 7 ms.
[2024-05-20 16:34:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality17965413318420105991.gal : 9 ms
[2024-05-20 16:34:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14199411449621126576.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/CTLCardinality17965413318420105991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14199411449621126576.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 : 1130/1130 places, 1501/1501 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1110 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1110 transition count 1481
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1093 transition count 1452
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1093 transition count 1452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 1084 transition count 1439
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 1084 transition count 1439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 1079 transition count 1427
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 1079 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 1074 transition count 1415
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 1074 transition count 1415
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 1070 transition count 1411
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 1070 transition count 1411
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 1067 transition count 1401
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 1067 transition count 1401
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 1064 transition count 1391
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 1064 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 1062 transition count 1389
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 1062 transition count 1389
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 1060 transition count 1380
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 1060 transition count 1380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 1058 transition count 1371
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 1058 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 1056 transition count 1369
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 1056 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 1054 transition count 1360
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 1054 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 1052 transition count 1351
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 1041 transition count 1291
Applied a total of 182 rules in 952 ms. Remains 1041 /1130 variables (removed 89) and now considering 1291/1501 (removed 210) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2024-05-20 16:34:32] [INFO ] Computed 110 invariants in 11 ms
[2024-05-20 16:34:32] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-05-20 16:34:32] [INFO ] Invariant cache hit.
[2024-05-20 16:34:36] [INFO ] Implicit Places using invariants and state equation in 3983 ms returned []
Implicit Place search using SMT with State Equation took 4609 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2024-05-20 16:34:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 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 Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1040 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (OVERLAPS) 1/1041 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-20 16:35:35] [INFO ] Deduced a trap composed of 89 places in 424 ms of which 6 ms to minimize.
[2024-05-20 16:35:36] [INFO ] Deduced a trap composed of 55 places in 627 ms of which 11 ms to minimize.
[2024-05-20 16:35:36] [INFO ] Deduced a trap composed of 115 places in 522 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/2332 variables, and 113 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 3/3 constraints]
After SMT, in 60490ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1130 places, 1291/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66072 ms. Remains : 1041/1130 places, 1291/1501 transitions.
[2024-05-20 16:35:37] [INFO ] Flatten gal took : 29 ms
[2024-05-20 16:35:37] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:35:37] [INFO ] Input system was already deterministic with 1291 transitions.
[2024-05-20 16:35:37] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:35:37] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:35:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality9359289105804846032.gal : 5 ms
[2024-05-20 16:35:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5480825301190956811.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/CTLCardinality9359289105804846032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5480825301190956811.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-20 16:36:07] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:36:07] [INFO ] Applying decomposition
[2024-05-20 16:36:07] [INFO ] Flatten gal took : 31 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/graph4829358083182000144.txt' '-o' '/tmp/graph4829358083182000144.bin' '-w' '/tmp/graph4829358083182000144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4829358083182000144.bin' '-l' '-1' '-v' '-w' '/tmp/graph4829358083182000144.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:36:07] [INFO ] Decomposing Gal with order
[2024-05-20 16:36:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:36:07] [INFO ] Removed a total of 1001 redundant transitions.
[2024-05-20 16:36:07] [INFO ] Flatten gal took : 51 ms
[2024-05-20 16:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2024-05-20 16:36:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality1659022263368560487.gal : 9 ms
[2024-05-20 16:36:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality5147431080473835168.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/CTLCardinality1659022263368560487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5147431080473835168.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1130/1130 places, 1501/1501 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1110 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1110 transition count 1481
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1093 transition count 1452
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1093 transition count 1452
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 1093 transition count 1448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 1084 transition count 1439
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 1084 transition count 1439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 1079 transition count 1427
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 1079 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 1074 transition count 1415
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 1074 transition count 1415
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 1070 transition count 1411
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 1070 transition count 1411
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 1067 transition count 1401
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 1067 transition count 1401
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 1064 transition count 1391
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 1064 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 1062 transition count 1389
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 1062 transition count 1389
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 1060 transition count 1380
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 1060 transition count 1380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 1058 transition count 1371
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 1058 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 1056 transition count 1369
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 1056 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 1054 transition count 1360
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 1054 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 1052 transition count 1351
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 1042 transition count 1299
Applied a total of 180 rules in 887 ms. Remains 1042 /1130 variables (removed 88) and now considering 1299/1501 (removed 202) transitions.
// Phase 1: matrix 1299 rows 1042 cols
[2024-05-20 16:36:38] [INFO ] Computed 110 invariants in 10 ms
[2024-05-20 16:36:39] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-05-20 16:36:39] [INFO ] Invariant cache hit.
[2024-05-20 16:36:42] [INFO ] Implicit Places using invariants and state equation in 3263 ms returned []
Implicit Place search using SMT with State Equation took 4086 ms to find 0 implicit places.
Running 1298 sub problems to find dead transitions.
[2024-05-20 16:36:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1041 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 13.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 3.0)
(s45 1.0)
(s46 6.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 10.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 5.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1041/2341 variables, and 63 constraints, problems are : Problem set: 0 solved, 1298 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 63/80 constraints, State Equation: 0/1042 constraints, PredecessorRefiner: 1298/1298 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1041 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1041 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 2 (OVERLAPS) 1/1042 variables, 30/93 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
[2024-05-20 16:37:42] [INFO ] Deduced a trap composed of 83 places in 403 ms of which 6 ms to minimize.
[2024-05-20 16:37:42] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 5 ms to minimize.
[2024-05-20 16:37:43] [INFO ] Deduced a trap composed of 102 places in 491 ms of which 6 ms to minimize.
SMT process timed out in 60548ms, After SMT, problems are : Problem set: 0 solved, 1298 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Starting structural reductions in LTL mode, iteration 1 : 1042/1130 places, 1299/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65540 ms. Remains : 1042/1130 places, 1299/1501 transitions.
[2024-05-20 16:37:43] [INFO ] Flatten gal took : 29 ms
[2024-05-20 16:37:43] [INFO ] Flatten gal took : 33 ms
[2024-05-20 16:37:43] [INFO ] Input system was already deterministic with 1299 transitions.
[2024-05-20 16:37:43] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:37:43] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:37:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14058034849480671577.gal : 5 ms
[2024-05-20 16:37:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16509999610820872974.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/CTLCardinality14058034849480671577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16509999610820872974.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-20 16:38:13] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:38:13] [INFO ] Applying decomposition
[2024-05-20 16:38:13] [INFO ] Flatten gal took : 32 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/graph13011745289704506140.txt' '-o' '/tmp/graph13011745289704506140.bin' '-w' '/tmp/graph13011745289704506140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13011745289704506140.bin' '-l' '-1' '-v' '-w' '/tmp/graph13011745289704506140.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:38:13] [INFO ] Decomposing Gal with order
[2024-05-20 16:38:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:38:13] [INFO ] Removed a total of 1025 redundant transitions.
[2024-05-20 16:38:13] [INFO ] Flatten gal took : 50 ms
[2024-05-20 16:38:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 9 ms.
[2024-05-20 16:38:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality12563673273177075692.gal : 8 ms
[2024-05-20 16:38:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality1062169326501799453.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/CTLCardinality12563673273177075692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1062169326501799453.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 : 1130/1130 places, 1501/1501 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1114 transition count 1485
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1114 transition count 1485
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 46 place count 1100 transition count 1466
Iterating global reduction 0 with 14 rules applied. Total rules applied 60 place count 1100 transition count 1466
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 1100 transition count 1463
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 1092 transition count 1455
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 1092 transition count 1455
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 1088 transition count 1451
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 1088 transition count 1451
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 1085 transition count 1448
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 1085 transition count 1448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 1083 transition count 1446
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 1083 transition count 1446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 1082 transition count 1445
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 1082 transition count 1445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 1081 transition count 1444
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 1081 transition count 1444
Applied a total of 101 rules in 335 ms. Remains 1081 /1130 variables (removed 49) and now considering 1444/1501 (removed 57) transitions.
// Phase 1: matrix 1444 rows 1081 cols
[2024-05-20 16:38:44] [INFO ] Computed 110 invariants in 12 ms
[2024-05-20 16:38:45] [INFO ] Implicit Places using invariants in 870 ms returned []
[2024-05-20 16:38:45] [INFO ] Invariant cache hit.
[2024-05-20 16:38:48] [INFO ] Implicit Places using invariants and state equation in 3432 ms returned []
Implicit Place search using SMT with State Equation took 4306 ms to find 0 implicit places.
Running 1443 sub problems to find dead transitions.
[2024-05-20 16:38:48] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/2525 variables, and 64 constraints, problems are : Problem set: 0 solved, 1443 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/28 constraints, Generalized P Invariants (flows): 64/82 constraints, State Equation: 0/1081 constraints, PredecessorRefiner: 1443/1443 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1080 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1443 unsolved
SMT process timed out in 60619ms, After SMT, problems are : Problem set: 0 solved, 1443 unsolved
Search for dead transitions found 0 dead transitions in 60637ms
Starting structural reductions in LTL mode, iteration 1 : 1081/1130 places, 1444/1501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65283 ms. Remains : 1081/1130 places, 1444/1501 transitions.
[2024-05-20 16:39:49] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:39:49] [INFO ] Flatten gal took : 41 ms
[2024-05-20 16:39:49] [INFO ] Input system was already deterministic with 1444 transitions.
[2024-05-20 16:39:49] [INFO ] Flatten gal took : 52 ms
[2024-05-20 16:39:49] [INFO ] Flatten gal took : 53 ms
[2024-05-20 16:39:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality1835022535241979464.gal : 9 ms
[2024-05-20 16:39:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16759308029068537228.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/CTLCardinality1835022535241979464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16759308029068537228.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-20 16:40:19] [INFO ] Flatten gal took : 35 ms
[2024-05-20 16:40:19] [INFO ] Applying decomposition
[2024-05-20 16:40:19] [INFO ] Flatten gal took : 35 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/graph1594436977085593082.txt' '-o' '/tmp/graph1594436977085593082.bin' '-w' '/tmp/graph1594436977085593082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1594436977085593082.bin' '-l' '-1' '-v' '-w' '/tmp/graph1594436977085593082.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:40:19] [INFO ] Decomposing Gal with order
[2024-05-20 16:40:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:40:19] [INFO ] Removed a total of 1256 redundant transitions.
[2024-05-20 16:40:19] [INFO ] Flatten gal took : 55 ms
[2024-05-20 16:40:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2024-05-20 16:40:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality7788417337616612322.gal : 10 ms
[2024-05-20 16:40:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality7244068496031505216.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/CTLCardinality7788417337616612322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7244068496031505216.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 : 1130/1130 places, 1501/1501 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1129 transition count 1292
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 215 rules applied. Total rules applied 423 place count 921 transition count 1285
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 rules applied. Total rules applied 429 place count 918 transition count 1282
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 432 place count 916 transition count 1281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 433 place count 915 transition count 1281
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 284 Pre rules applied. Total rules applied 433 place count 915 transition count 997
Deduced a syphon composed of 284 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 5 with 591 rules applied. Total rules applied 1024 place count 608 transition count 997
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 18 rules applied. Total rules applied 1042 place count 606 transition count 981
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1058 place count 590 transition count 981
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 1058 place count 590 transition count 973
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1082 place count 574 transition count 973
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 1082 place count 574 transition count 966
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1096 place count 567 transition count 966
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1108 place count 555 transition count 954
Iterating global reduction 7 with 12 rules applied. Total rules applied 1120 place count 555 transition count 954
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 1120 place count 555 transition count 948
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1132 place count 549 transition count 948
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1139 place count 542 transition count 929
Iterating global reduction 7 with 7 rules applied. Total rules applied 1146 place count 542 transition count 929
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1148 place count 540 transition count 920
Iterating global reduction 7 with 2 rules applied. Total rules applied 1150 place count 540 transition count 920
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1152 place count 538 transition count 911
Iterating global reduction 7 with 2 rules applied. Total rules applied 1154 place count 538 transition count 911
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1155 place count 537 transition count 903
Iterating global reduction 7 with 1 rules applied. Total rules applied 1156 place count 537 transition count 903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1157 place count 536 transition count 895
Iterating global reduction 7 with 1 rules applied. Total rules applied 1158 place count 536 transition count 895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1159 place count 535 transition count 887
Iterating global reduction 7 with 1 rules applied. Total rules applied 1160 place count 535 transition count 887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1161 place count 534 transition count 879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1162 place count 534 transition count 879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1163 place count 533 transition count 871
Iterating global reduction 7 with 1 rules applied. Total rules applied 1164 place count 533 transition count 871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1165 place count 532 transition count 863
Iterating global reduction 7 with 1 rules applied. Total rules applied 1166 place count 532 transition count 863
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1167 place count 531 transition count 855
Iterating global reduction 7 with 1 rules applied. Total rules applied 1168 place count 531 transition count 855
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1169 place count 530 transition count 847
Iterating global reduction 7 with 1 rules applied. Total rules applied 1170 place count 530 transition count 847
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 7 with 144 rules applied. Total rules applied 1314 place count 457 transition count 776
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1318 place count 453 transition count 772
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 1323 place count 452 transition count 772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1323 place count 452 transition count 771
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1325 place count 451 transition count 771
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1328 place count 448 transition count 768
Iterating global reduction 7 with 3 rules applied. Total rules applied 1331 place count 448 transition count 768
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1333 place count 448 transition count 766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1334 place count 447 transition count 766
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1334 place count 447 transition count 765
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1336 place count 446 transition count 765
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1337 place count 445 transition count 764
Iterating global reduction 9 with 1 rules applied. Total rules applied 1338 place count 445 transition count 764
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1340 place count 443 transition count 762
Reduce places removed 4 places and 0 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 9 with 6 rules applied. Total rules applied 1346 place count 439 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1348 place count 437 transition count 760
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 8 Pre rules applied. Total rules applied 1348 place count 437 transition count 752
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 17 rules applied. Total rules applied 1365 place count 428 transition count 752
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 1370 place count 423 transition count 752
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1370 place count 423 transition count 751
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1372 place count 422 transition count 751
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1382 place count 417 transition count 746
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1386 place count 413 transition count 742
Iterating global reduction 12 with 4 rules applied. Total rules applied 1390 place count 413 transition count 742
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1391 place count 412 transition count 741
Iterating global reduction 12 with 1 rules applied. Total rules applied 1392 place count 412 transition count 741
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1393 place count 412 transition count 740
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1393 place count 412 transition count 739
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1395 place count 411 transition count 739
Applied a total of 1395 rules in 312 ms. Remains 411 /1130 variables (removed 719) and now considering 739/1501 (removed 762) transitions.
// Phase 1: matrix 739 rows 411 cols
[2024-05-20 16:40:50] [INFO ] Computed 64 invariants in 6 ms
[2024-05-20 16:40:50] [INFO ] Implicit Places using invariants in 583 ms returned [1, 20, 21, 34, 51, 69, 88, 144, 154, 155, 157, 174, 192, 251, 275, 276, 279, 290, 291, 292, 316, 320, 339, 340, 341, 342]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 585 ms to find 26 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 385/1130 places, 739/1501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 385 transition count 692
Reduce places removed 47 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 338 transition count 689
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 100 place count 335 transition count 689
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 100 place count 335 transition count 674
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 131 place count 319 transition count 674
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 9 rules applied. Total rules applied 140 place count 316 transition count 668
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 146 place count 310 transition count 668
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 148 place count 308 transition count 666
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 308 transition count 666
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 308 transition count 665
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 181 place count 293 transition count 650
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 293 transition count 649
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 6 with 1 rules applied. Total rules applied 183 place count 293 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 184 place count 292 transition count 648
Applied a total of 184 rules in 48 ms. Remains 292 /385 variables (removed 93) and now considering 648/739 (removed 91) transitions.
// Phase 1: matrix 648 rows 292 cols
[2024-05-20 16:40:50] [INFO ] Computed 34 invariants in 4 ms
[2024-05-20 16:40:51] [INFO ] Implicit Places using invariants in 334 ms returned [93, 100, 106, 199, 205, 289]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 336 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 286/1130 places, 648/1501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 285 transition count 647
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 282 transition count 644
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 282 transition count 644
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 279 transition count 641
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 279 transition count 641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 278 transition count 640
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 278 transition count 640
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 276 transition count 638
Applied a total of 20 rules in 25 ms. Remains 276 /286 variables (removed 10) and now considering 638/648 (removed 10) transitions.
// Phase 1: matrix 638 rows 276 cols
[2024-05-20 16:40:51] [INFO ] Computed 28 invariants in 5 ms
[2024-05-20 16:40:51] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-20 16:40:51] [INFO ] Invariant cache hit.
[2024-05-20 16:40:52] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 276/1130 places, 638/1501 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 2590 ms. Remains : 276/1130 places, 638/1501 transitions.
[2024-05-20 16:40:52] [INFO ] Flatten gal took : 17 ms
[2024-05-20 16:40:52] [INFO ] Flatten gal took : 18 ms
[2024-05-20 16:40:52] [INFO ] Input system was already deterministic with 638 transitions.
[2024-05-20 16:40:52] [INFO ] Flatten gal took : 18 ms
[2024-05-20 16:40:52] [INFO ] Flatten gal took : 19 ms
[2024-05-20 16:40:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7683677157563759745.gal : 2 ms
[2024-05-20 16:40:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17197965554475496748.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/CTLCardinality7683677157563759745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17197965554475496748.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,7.06022e+08,23.8132,506016,2,17699,5,1.56269e+06,6,0,1745,1.60606e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 16:41:22] [INFO ] Flatten gal took : 19 ms
[2024-05-20 16:41:22] [INFO ] Applying decomposition
[2024-05-20 16:41:22] [INFO ] Flatten gal took : 19 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/graph17885553348954001035.txt' '-o' '/tmp/graph17885553348954001035.bin' '-w' '/tmp/graph17885553348954001035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17885553348954001035.bin' '-l' '-1' '-v' '-w' '/tmp/graph17885553348954001035.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:41:22] [INFO ] Decomposing Gal with order
[2024-05-20 16:41:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:41:22] [INFO ] Removed a total of 1224 redundant transitions.
[2024-05-20 16:41:22] [INFO ] Flatten gal took : 28 ms
[2024-05-20 16:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2024-05-20 16:41:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5577881767039190499.gal : 3 ms
[2024-05-20 16:41:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality16568708651351988489.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/CTLCardinality5577881767039190499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16568708651351988489.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.06022e+08,18.3382,343936,2119,1310,530540,58555,996,1.02914e+06,243,360095,0


Converting to forward existential form...Done !
original formula: EF(!(A((i0.u0.p39==0) U (AF((((i7.u73.p1150==0)||(u74.p1191==1))||(i4.i1.u49.p695==0))) + !(E(((i4.i1.u47.p648==0)||(i3.u59.p892==1)) U (...179
=> equivalent forward existential formula: ([(FwdU(((FwdU(FwdU(Init,TRUE),!((!(EG(!((((i7.u73.p1150==0)||(u74.p1191==1))||(i4.i1.u49.p695==0))))) + !(E(((i...568
Reverse transition relation is NOT exact ! Due to transitions t246, t556, t566, t567, t572, t607, t616, t629, i2.u17.t521, i2.u17.t522, i2.u17.t580, i2.u17...570
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-20 16:41:52] [INFO ] Flatten gal took : 37 ms
[2024-05-20 16:41:52] [INFO ] Flatten gal took : 37 ms
[2024-05-20 16:41:52] [INFO ] Applying decomposition
[2024-05-20 16:41:52] [INFO ] Flatten gal took : 37 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/graph9704033065442112467.txt' '-o' '/tmp/graph9704033065442112467.bin' '-w' '/tmp/graph9704033065442112467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9704033065442112467.bin' '-l' '-1' '-v' '-w' '/tmp/graph9704033065442112467.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:41:53] [INFO ] Decomposing Gal with order
[2024-05-20 16:41:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:41:53] [INFO ] Removed a total of 1284 redundant transitions.
[2024-05-20 16:41:53] [INFO ] Flatten gal took : 55 ms
[2024-05-20 16:41:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 11 ms.
[2024-05-20 16:41:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13102695017302248341.gal : 8 ms
[2024-05-20 16:41:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality12997358712469784038.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/CTLCardinality13102695017302248341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12997358712469784038.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 15 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02b"
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 ASLink-PT-02b, 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 r004-smll-171620117700033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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