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.r576-smll-171734920200169.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 MedleyA-PT-22, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 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 MedleyA-PT-22-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717394576616

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-03 06:02:58] [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-06-03 06:02:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 06:02:58] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2024-06-03 06:02:59] [INFO ] Transformed 307 places.
[2024-06-03 06:02:59] [INFO ] Transformed 740 transitions.
[2024-06-03 06:02:59] [INFO ] Found NUPN structural information;
[2024-06-03 06:02:59] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 476 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 116 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-22-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 304 transition count 740
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 67 place count 240 transition count 665
Iterating global reduction 1 with 64 rules applied. Total rules applied 131 place count 240 transition count 665
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 136 place count 240 transition count 660
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 141 place count 235 transition count 651
Iterating global reduction 2 with 5 rules applied. Total rules applied 146 place count 235 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 234 transition count 649
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 234 transition count 649
Applied a total of 148 rules in 114 ms. Remains 234 /307 variables (removed 73) and now considering 649/740 (removed 91) transitions.
// Phase 1: matrix 649 rows 234 cols
[2024-06-03 06:02:59] [INFO ] Computed 22 invariants in 38 ms
[2024-06-03 06:03:00] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-06-03 06:03:00] [INFO ] Invariant cache hit.
[2024-06-03 06:03:00] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 648 sub problems to find dead transitions.
[2024-06-03 06:03:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD599 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/233 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 06:03:14] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 49 ms to minimize.
[2024-06-03 06:03:14] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 14 ms to minimize.
[2024-06-03 06:03:14] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2024-06-03 06:03:15] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 4 ms to minimize.
[2024-06-03 06:03:15] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2024-06-03 06:03:15] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 3 ms to minimize.
[2024-06-03 06:03:15] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-06-03 06:03:15] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 2 ms to minimize.
[2024-06-03 06:03:16] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 1 ms to minimize.
[2024-06-03 06:03:16] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2024-06-03 06:03:16] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-06-03 06:03:17] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-06-03 06:03:17] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2024-06-03 06:03:17] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2024-06-03 06:03:18] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-06-03 06:03:18] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-03 06:03:18] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-06-03 06:03:18] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-06-03 06:03:18] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 19/41 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 06:03:28] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/42 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 06:03:33] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 3 ms to minimize.
[2024-06-03 06:03:33] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 233/883 variables, and 44 constraints, problems are : Problem set: 144 solved, 504 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 144 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 16/16 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 22/44 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 06:03:39] [INFO ] Deduced a trap composed of 58 places in 250 ms of which 3 ms to minimize.
[2024-06-03 06:03:39] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 2/46 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 06:03:46] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 2 ms to minimize.
[2024-06-03 06:03:46] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/48 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 06:03:51] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 3 ms to minimize.
[2024-06-03 06:03:51] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 2 ms to minimize.
[2024-06-03 06:03:52] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 3 ms to minimize.
[2024-06-03 06:03:52] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 4/52 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/52 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 8 (OVERLAPS) 649/882 variables, 233/285 constraints. Problems are: Problem set: 144 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 882/883 variables, and 788 constraints, problems are : Problem set: 144 solved, 504 unsolved in 30280 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 233/234 constraints, PredecessorRefiner: 503/648 constraints, Known Traps: 30/30 constraints]
After SMT, in 63219ms problems are : Problem set: 144 solved, 504 unsolved
Search for dead transitions found 144 dead transitions in 63261ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 234/307 places, 505/740 transitions.
Applied a total of 0 rules in 12 ms. Remains 234 /234 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64683 ms. Remains : 234/307 places, 505/740 transitions.
Support contains 85 out of 234 places after structural reductions.
[2024-06-03 06:04:04] [INFO ] Flatten gal took : 108 ms
[2024-06-03 06:04:04] [INFO ] Flatten gal took : 53 ms
[2024-06-03 06:04:04] [INFO ] Input system was already deterministic with 505 transitions.
Support contains 78 out of 234 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (1163 resets) in 3137 ms. (12 steps per ms) remains 29/52 properties
BEST_FIRST walk for 4002 steps (26 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (24 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (24 resets) in 43 ms. (91 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (23 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (23 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (25 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (25 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 66 ms. (59 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (26 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (23 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (23 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
// Phase 1: matrix 505 rows 234 cols
[2024-06-03 06:04:05] [INFO ] Computed 22 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 81/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 77/208 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 8/216 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 495/711 variables, 216/236 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/711 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 25/736 variables, 15/251 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/736 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/737 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/737 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 2/739 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/739 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (OVERLAPS) 0/739 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 256 constraints, problems are : Problem set: 0 solved, 29 unsolved in 2491 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 81/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-03 06:04:08] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-06-03 06:04:08] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 77/208 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-03 06:04:09] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 3 ms to minimize.
[2024-06-03 06:04:09] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 4 ms to minimize.
[2024-06-03 06:04:09] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 7 ms to minimize.
[2024-06-03 06:04:10] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 2 ms to minimize.
[2024-06-03 06:04:10] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-06-03 06:04:10] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 3 ms to minimize.
[2024-06-03 06:04:10] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 3 ms to minimize.
[2024-06-03 06:04:10] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 3 ms to minimize.
[2024-06-03 06:04:11] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 2 ms to minimize.
[2024-06-03 06:04:11] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 2 ms to minimize.
[2024-06-03 06:04:11] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2024-06-03 06:04:11] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-06-03 06:04:11] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-06-03 06:04:11] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2024-06-03 06:04:11] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-06-03 06:04:12] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-06-03 06:04:12] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 5 ms to minimize.
[2024-06-03 06:04:12] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-03 06:04:12] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-03 06:04:12] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-03 06:04:12] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 3 ms to minimize.
[2024-06-03 06:04:12] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 3 ms to minimize.
[2024-06-03 06:04:12] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 2 ms to minimize.
[2024-06-03 06:04:13] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-06-03 06:04:13] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 4 ms to minimize.
[2024-06-03 06:04:13] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 3 ms to minimize.
SMT process timed out in 7600ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 233 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 0 with 14 rules applied. Total rules applied 15 place count 233 transition count 490
Reduce places removed 13 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 19 rules applied. Total rules applied 34 place count 220 transition count 484
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 214 transition count 484
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 40 place count 214 transition count 480
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 210 transition count 480
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 62 place count 196 transition count 451
Iterating global reduction 3 with 14 rules applied. Total rules applied 76 place count 196 transition count 451
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 192 transition count 435
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 192 transition count 435
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 191 transition count 433
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 191 transition count 433
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 128 place count 170 transition count 412
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 167 transition count 409
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 167 transition count 409
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 154 place count 157 transition count 517
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 170 place count 157 transition count 501
Drop transitions (Redundant composition of simpler transitions.) removed 89 transitions
Redundant transition composition rules discarded 89 transitions
Iterating global reduction 4 with 89 rules applied. Total rules applied 259 place count 157 transition count 412
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 156 transition count 423
Free-agglomeration rule (complex) applied 16 times with reduction of 8 identical transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 277 place count 156 transition count 625
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 304 place count 140 transition count 614
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 305 place count 140 transition count 614
Applied a total of 305 rules in 329 ms. Remains 140 /234 variables (removed 94) and now considering 614/505 (removed -109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 140/234 places, 614/505 transitions.
RANDOM walk for 40000 steps (2856 resets) in 1361 ms. (29 steps per ms) remains 6/29 properties
BEST_FIRST walk for 40004 steps (681 resets) in 173 ms. (229 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (679 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (768 resets) in 125 ms. (317 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (661 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (680 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
// Phase 1: matrix 614 rows 140 cols
[2024-06-03 06:04:14] [INFO ] Computed 23 invariants in 6 ms
[2024-06-03 06:04:14] [INFO ] State equation strengthened by 225 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/77 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 55/132 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/137 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 613/750 variables, 137/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 205/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/750 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/754 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/754 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/754 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/754 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 388 constraints, problems are : Problem set: 0 solved, 4 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 140/140 constraints, ReadFeed: 225/225 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/77 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 55/132 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/137 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 613/750 variables, 137/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 205/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/750 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 06:04:16] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 3 ms to minimize.
[2024-06-03 06:04:16] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-03 06:04:16] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-06-03 06:04:16] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 2 ms to minimize.
[2024-06-03 06:04:17] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 5/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 06:04:17] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 3 ms to minimize.
[2024-06-03 06:04:18] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 3 ms to minimize.
[2024-06-03 06:04:18] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/750 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 06:04:18] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-06-03 06:04:19] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-03 06:04:19] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2024-06-03 06:04:19] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-06-03 06:04:19] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-06-03 06:04:19] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/750 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/750 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/754 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/754 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/754 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 06:04:20] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/754 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 06:04:21] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 2 ms to minimize.
[2024-06-03 06:04:21] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 2 ms to minimize.
[2024-06-03 06:04:21] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 2 ms to minimize.
[2024-06-03 06:04:22] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/754 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 06:04:22] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 2 ms to minimize.
[2024-06-03 06:04:23] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/754 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/754 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 06:04:23] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/754 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/754 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/754 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 414 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 140/140 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 22/22 constraints]
After SMT, in 9574ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 1150 ms.
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 614/614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 140 transition count 605
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 131 transition count 605
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 131 transition count 603
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 129 transition count 603
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 40 place count 111 transition count 492
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 111 transition count 492
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 107 transition count 470
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 107 transition count 470
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 95 place count 91 transition count 457
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 88 transition count 441
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 88 transition count 441
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 111 place count 83 transition count 481
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 81 transition count 464
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 81 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 80 transition count 462
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 80 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 149 place count 80 transition count 430
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 154 place count 80 transition count 527
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 168 place count 75 transition count 518
Applied a total of 168 rules in 166 ms. Remains 75 /140 variables (removed 65) and now considering 518/614 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 75/140 places, 518/614 transitions.
RANDOM walk for 17660 steps (2441 resets) in 887 ms. (19 steps per ms) remains 0/1 properties
[2024-06-03 06:04:25] [INFO ] Flatten gal took : 52 ms
[2024-06-03 06:04:25] [INFO ] Flatten gal took : 41 ms
[2024-06-03 06:04:26] [INFO ] Input system was already deterministic with 505 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 194 transition count 442
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 194 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 194 transition count 438
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 102 place count 176 transition count 390
Iterating global reduction 1 with 18 rules applied. Total rules applied 120 place count 176 transition count 390
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 168 transition count 369
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 168 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 139 place count 165 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 142 place count 165 transition count 360
Applied a total of 142 rules in 15 ms. Remains 165 /234 variables (removed 69) and now considering 360/505 (removed 145) transitions.
// Phase 1: matrix 360 rows 165 cols
[2024-06-03 06:04:26] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 06:04:26] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-03 06:04:26] [INFO ] Invariant cache hit.
[2024-06-03 06:04:26] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2024-06-03 06:04:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-03 06:04:31] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 3 ms to minimize.
[2024-06-03 06:04:31] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-06-03 06:04:31] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-06-03 06:04:32] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-06-03 06:04:32] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-06-03 06:04:32] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/524 variables, 164/192 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-03 06:04:38] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 8 (OVERLAPS) 1/525 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-03 06:04:56] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-03 06:04:56] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 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 Real declared 525/525 variables, and 196 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/524 variables, 164/195 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 358/553 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-03 06:05:07] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 359 unsolved
SMT process timed out in 60720ms, After SMT, problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60728ms
Starting structural reductions in LTL mode, iteration 1 : 165/234 places, 360/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61259 ms. Remains : 165/234 places, 360/505 transitions.
[2024-06-03 06:05:27] [INFO ] Flatten gal took : 31 ms
[2024-06-03 06:05:27] [INFO ] Flatten gal took : 28 ms
[2024-06-03 06:05:27] [INFO ] Input system was already deterministic with 360 transitions.
[2024-06-03 06:05:27] [INFO ] Flatten gal took : 25 ms
[2024-06-03 06:05:27] [INFO ] Flatten gal took : 24 ms
[2024-06-03 06:05:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality9283654443193098227.gal : 30 ms
[2024-06-03 06:05:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality8111156206880331349.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9283654443193098227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8111156206880331349.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-06-03 06:05:57] [INFO ] Flatten gal took : 21 ms
[2024-06-03 06:05:57] [INFO ] Applying decomposition
[2024-06-03 06:05:57] [INFO ] Flatten gal took : 20 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/graph6077782063630387669.txt' '-o' '/tmp/graph6077782063630387669.bin' '-w' '/tmp/graph6077782063630387669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6077782063630387669.bin' '-l' '-1' '-v' '-w' '/tmp/graph6077782063630387669.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:05:57] [INFO ] Decomposing Gal with order
[2024-06-03 06:05:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:05:58] [INFO ] Removed a total of 738 redundant transitions.
[2024-06-03 06:05:58] [INFO ] Flatten gal took : 160 ms
[2024-06-03 06:05:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 37 ms.
[2024-06-03 06:05:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality15680781461705979286.gal : 9 ms
[2024-06-03 06:05:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5737477528917754215.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/CTLCardinality15680781461705979286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5737477528917754215.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,1.8077e+11,9.47195,197236,5054,819,326121,5855,638,834820,134,51701,0


Converting to forward existential form...Done !
original formula: (AF((i1.u26.p144==1)) + AG((AX(((((i0.i2.u34.p217==1)||(i6.i1.u24.p138==0))||(i10.i1.u44.p277==1)) * EX(((i6.i1.u22.p132==0)||(i3.u42.p24...235
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(!(EG(!((i1.u26.p144==1)))))),TRUE) * !(!(EX(!(((((i0.i2.u34.p217==1)||(i6.i1.u24.p138==0)...314
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t37, t64, t77, t102, t135, t140, t144, t160, t183, t185, t191, t195, t196, t200, t20...1257
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 38 place count 196 transition count 449
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 196 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 196 transition count 446
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 92 place count 182 transition count 411
Iterating global reduction 2 with 14 rules applied. Total rules applied 106 place count 182 transition count 411
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 176 transition count 395
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 176 transition count 395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 175 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 175 transition count 392
Applied a total of 120 rules in 18 ms. Remains 175 /234 variables (removed 59) and now considering 392/505 (removed 113) transitions.
// Phase 1: matrix 392 rows 175 cols
[2024-06-03 06:06:28] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 06:06:28] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-03 06:06:28] [INFO ] Invariant cache hit.
[2024-06-03 06:06:28] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-06-03 06:06:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-03 06:06:35] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-06-03 06:06:35] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-06-03 06:06:35] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 5 ms to minimize.
[2024-06-03 06:06:35] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-06-03 06:06:35] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-06-03 06:06:35] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-06-03 06:06:35] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-03 06:06:36] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-06-03 06:06:36] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-06-03 06:06:36] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/567 variables, 175/207 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-03 06:06:45] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-03 06:06:59] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
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 567/567 variables, and 209 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/567 variables, 175/209 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 391/600 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-03 06:07:13] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-06-03 06:07:13] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2024-06-03 06:07:14] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-06-03 06:07:14] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 2 ms to minimize.
[2024-06-03 06:07:14] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 2 ms to minimize.
[2024-06-03 06:07:19] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-06-03 06:07:27] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
[2024-06-03 06:07:27] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 3 ms to minimize.
[2024-06-03 06:07:27] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 609 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 21/21 constraints]
After SMT, in 60825ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60834ms
Starting structural reductions in LTL mode, iteration 1 : 175/234 places, 392/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61385 ms. Remains : 175/234 places, 392/505 transitions.
[2024-06-03 06:07:29] [INFO ] Flatten gal took : 20 ms
[2024-06-03 06:07:29] [INFO ] Flatten gal took : 24 ms
[2024-06-03 06:07:29] [INFO ] Input system was already deterministic with 392 transitions.
[2024-06-03 06:07:29] [INFO ] Flatten gal took : 28 ms
[2024-06-03 06:07:29] [INFO ] Flatten gal took : 28 ms
[2024-06-03 06:07:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality10153281485046719508.gal : 6 ms
[2024-06-03 06:07:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality7635559527478634874.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/CTLCardinality10153281485046719508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7635559527478634874.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-06-03 06:08:00] [INFO ] Flatten gal took : 29 ms
[2024-06-03 06:08:00] [INFO ] Applying decomposition
[2024-06-03 06:08:00] [INFO ] Flatten gal took : 29 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/graph5533578206929773472.txt' '-o' '/tmp/graph5533578206929773472.bin' '-w' '/tmp/graph5533578206929773472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5533578206929773472.bin' '-l' '-1' '-v' '-w' '/tmp/graph5533578206929773472.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:08:00] [INFO ] Decomposing Gal with order
[2024-06-03 06:08:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:08:00] [INFO ] Removed a total of 654 redundant transitions.
[2024-06-03 06:08:00] [INFO ] Flatten gal took : 80 ms
[2024-06-03 06:08:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 19 ms.
[2024-06-03 06:08:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality16552506983687186447.gal : 6 ms
[2024-06-03 06:08:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality7400146292892646844.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/CTLCardinality16552506983687186447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7400146292892646844.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,2.95031e+11,17.1356,298396,7034,1837,408148,42388,542,1.05813e+06,251,550155,0


Converting to forward existential form...Done !
original formula: ((AG(((u29.p253==0)||(u29.p256==1))) + EX(AG(EX((((i5.u24.p143==1)||(i1.u14.p62==0))||(i2.u11.p53==1)))))) * (EX((EG(((i4.u16.p106!=0)&&(...288
=> equivalent forward existential formula: ([(FwdU((Init * !(EX(!(E(TRUE U !(EX((((i5.u24.p143==1)||(i1.u14.p62==0))||(i2.u11.p53==1))))))))),TRUE) * !(((u...392
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t44, t70, t116, t152, t161, t164, t169, t201, t214, t222, t224, t228, t311, t313, t3...1424
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.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 38 place count 196 transition count 447
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 196 transition count 447
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 196 transition count 444
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 92 place count 182 transition count 409
Iterating global reduction 2 with 14 rules applied. Total rules applied 106 place count 182 transition count 409
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 176 transition count 393
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 176 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 174 transition count 387
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 174 transition count 387
Applied a total of 122 rules in 16 ms. Remains 174 /234 variables (removed 60) and now considering 387/505 (removed 118) transitions.
// Phase 1: matrix 387 rows 174 cols
[2024-06-03 06:08:30] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 06:08:30] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 06:08:30] [INFO ] Invariant cache hit.
[2024-06-03 06:08:31] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2024-06-03 06:08:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-03 06:08:36] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-06-03 06:08:36] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-06-03 06:08:36] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-03 06:08:36] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-06-03 06:08:36] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-06-03 06:08:37] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-03 06:08:37] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-03 06:08:37] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-03 06:08:37] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-03 06:08:37] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-03 06:08:38] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 387/561 variables, 174/207 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-03 06:08:45] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2024-06-03 06:08:46] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-06-03 06:08:46] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 210 constraints, problems are : Problem set: 0 solved, 386 unsolved in 29512 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 387/561 variables, 174/210 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 386/596 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-03 06:09:16] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 597 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 15/15 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 174/234 places, 387/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60727 ms. Remains : 174/234 places, 387/505 transitions.
[2024-06-03 06:09:31] [INFO ] Flatten gal took : 15 ms
[2024-06-03 06:09:31] [INFO ] Flatten gal took : 17 ms
[2024-06-03 06:09:31] [INFO ] Input system was already deterministic with 387 transitions.
[2024-06-03 06:09:31] [INFO ] Flatten gal took : 22 ms
[2024-06-03 06:09:31] [INFO ] Flatten gal took : 22 ms
[2024-06-03 06:09:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality18037046087173235754.gal : 9 ms
[2024-06-03 06:09:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality11545067109835275237.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/CTLCardinality18037046087173235754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11545067109835275237.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-06-03 06:10:01] [INFO ] Flatten gal took : 14 ms
[2024-06-03 06:10:01] [INFO ] Applying decomposition
[2024-06-03 06:10:01] [INFO ] Flatten gal took : 14 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/graph16151542031472158549.txt' '-o' '/tmp/graph16151542031472158549.bin' '-w' '/tmp/graph16151542031472158549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16151542031472158549.bin' '-l' '-1' '-v' '-w' '/tmp/graph16151542031472158549.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:10:01] [INFO ] Decomposing Gal with order
[2024-06-03 06:10:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:10:01] [INFO ] Removed a total of 748 redundant transitions.
[2024-06-03 06:10:01] [INFO ] Flatten gal took : 31 ms
[2024-06-03 06:10:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 9 ms.
[2024-06-03 06:10:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality1540056774284040295.gal : 3 ms
[2024-06-03 06:10:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality483474249028329049.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/CTLCardinality1540056774284040295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality483474249028329049.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37925e+11,27.4026,443592,6703,861,622316,7884,673,1.76911e+06,167,89322,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 42 place count 192 transition count 442
Iterating global reduction 1 with 41 rules applied. Total rules applied 83 place count 192 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 192 transition count 438
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 103 place count 176 transition count 395
Iterating global reduction 2 with 16 rules applied. Total rules applied 119 place count 176 transition count 395
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 127 place count 168 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 135 place count 168 transition count 374
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 165 transition count 365
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 165 transition count 365
Applied a total of 141 rules in 13 ms. Remains 165 /234 variables (removed 69) and now considering 365/505 (removed 140) transitions.
// Phase 1: matrix 365 rows 165 cols
[2024-06-03 06:10:31] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 06:10:31] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-03 06:10:31] [INFO ] Invariant cache hit.
[2024-06-03 06:10:32] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-03 06:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 06:10:37] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 2 ms to minimize.
[2024-06-03 06:10:37] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-06-03 06:10:37] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-06-03 06:10:38] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-06-03 06:10:38] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2024-06-03 06:10:38] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/530 variables, 165/193 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 06:10:45] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 06:10:52] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/530 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 195 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/530 variables, 165/195 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 364/559 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 06:11:15] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 06:11:24] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/530 variables, and 561 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 10/10 constraints]
After SMT, in 60730ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60738ms
Starting structural reductions in LTL mode, iteration 1 : 165/234 places, 365/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61241 ms. Remains : 165/234 places, 365/505 transitions.
[2024-06-03 06:11:32] [INFO ] Flatten gal took : 17 ms
[2024-06-03 06:11:32] [INFO ] Flatten gal took : 13 ms
[2024-06-03 06:11:32] [INFO ] Input system was already deterministic with 365 transitions.
[2024-06-03 06:11:33] [INFO ] Flatten gal took : 13 ms
[2024-06-03 06:11:33] [INFO ] Flatten gal took : 15 ms
[2024-06-03 06:11:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality4035490640399128478.gal : 11 ms
[2024-06-03 06:11:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7216955612586344982.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/CTLCardinality4035490640399128478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7216955612586344982.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-06-03 06:12:03] [INFO ] Flatten gal took : 13 ms
[2024-06-03 06:12:03] [INFO ] Applying decomposition
[2024-06-03 06:12:03] [INFO ] Flatten gal took : 13 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/graph17079365750954103380.txt' '-o' '/tmp/graph17079365750954103380.bin' '-w' '/tmp/graph17079365750954103380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17079365750954103380.bin' '-l' '-1' '-v' '-w' '/tmp/graph17079365750954103380.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:12:03] [INFO ] Decomposing Gal with order
[2024-06-03 06:12:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:12:03] [INFO ] Removed a total of 734 redundant transitions.
[2024-06-03 06:12:03] [INFO ] Flatten gal took : 30 ms
[2024-06-03 06:12:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 8 ms.
[2024-06-03 06:12:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality3369408280928042031.gal : 4 ms
[2024-06-03 06:12:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality16614894393520271309.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/CTLCardinality3369408280928042031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16614894393520271309.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,1.30316e+11,8.1407,186840,4080,821,285614,13018,623,953761,143,93731,0


Converting to forward existential form...Done !
original formula: EG(((AX(((i3.u27.p151==0)||(i6.i1.u30.p204==1))) * EG(((i7.i0.u34.p224==0)||(i8.i2.u45.p292==1)))) + ((i5.i0.u5.p31==0) * AG((i3.u22.p97=...162
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(((i3.u27.p151==0)||(i6.i1.u30.p204==1))))) * EG(((i7.i0.u34.p224==0)||(i8.i2.u45.p292==1))))...223
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t60, t78, t85, t103, t141, t145, t147, t153, t188, t192, t203, t205, t324, t325, t32...1242
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 230 transition count 472
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 200 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 199 transition count 471
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 63 place count 199 transition count 467
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 195 transition count 467
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 107 place count 159 transition count 408
Iterating global reduction 3 with 36 rules applied. Total rules applied 143 place count 159 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 143 place count 159 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 156 transition count 405
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 166 place count 139 transition count 360
Iterating global reduction 3 with 17 rules applied. Total rules applied 183 place count 139 transition count 360
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 189 place count 133 transition count 344
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 133 transition count 344
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 131 transition count 338
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 131 transition count 338
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 246 place count 106 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 249 place count 106 transition count 313
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 256 place count 99 transition count 298
Iterating global reduction 4 with 7 rules applied. Total rules applied 263 place count 99 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 266 place count 99 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 272 place count 96 transition count 292
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 274 place count 94 transition count 290
Applied a total of 274 rules in 97 ms. Remains 94 /234 variables (removed 140) and now considering 290/505 (removed 215) transitions.
// Phase 1: matrix 290 rows 94 cols
[2024-06-03 06:12:33] [INFO ] Computed 19 invariants in 2 ms
[2024-06-03 06:12:33] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-03 06:12:33] [INFO ] Invariant cache hit.
[2024-06-03 06:12:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-03 06:12:33] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-03 06:12:33] [INFO ] Redundant transitions in 18 ms returned []
Running 279 sub problems to find dead transitions.
[2024-06-03 06:12:33] [INFO ] Invariant cache hit.
[2024-06-03 06:12:33] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 3/93 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 289/382 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (OVERLAPS) 2/384 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/384 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 149 constraints, problems are : Problem set: 0 solved, 279 unsolved in 14483 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 3/93 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 289/382 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 278/426 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (OVERLAPS) 2/384 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 12 (OVERLAPS) 0/384 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 428 constraints, problems are : Problem set: 0 solved, 279 unsolved in 26010 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
After SMT, in 41052ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 41056ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/234 places, 290/505 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41560 ms. Remains : 94/234 places, 290/505 transitions.
[2024-06-03 06:13:14] [INFO ] Flatten gal took : 22 ms
[2024-06-03 06:13:14] [INFO ] Flatten gal took : 13 ms
[2024-06-03 06:13:14] [INFO ] Input system was already deterministic with 290 transitions.
[2024-06-03 06:13:14] [INFO ] Flatten gal took : 13 ms
[2024-06-03 06:13:14] [INFO ] Flatten gal took : 12 ms
[2024-06-03 06:13:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality11309215466344684930.gal : 3 ms
[2024-06-03 06:13:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2093726079703548272.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/CTLCardinality11309215466344684930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2093726079703548272.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59525e+09,14.914,315408,2,15612,5,1.10042e+06,6,0,658,1.4056e+06,0


Converting to forward existential form...Done !
original formula: EF(EG(((p70==0)||(p141==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p70==0)||(p141==1)))] != FALSE
Hit Full ! (commute/partial/dont) 267/0/23
(forward)formula 0,1,20.7687,315408,1,0,9,1.11356e+06,19,3,4772,1.4056e+06,8
FORMULA MedleyA-PT-22-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 198 transition count 452
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 198 transition count 452
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 198 transition count 449
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 185 transition count 413
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 185 transition count 413
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 107 place count 178 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 114 place count 178 transition count 394
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 176 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 176 transition count 388
Applied a total of 118 rules in 13 ms. Remains 176 /234 variables (removed 58) and now considering 388/505 (removed 117) transitions.
// Phase 1: matrix 388 rows 176 cols
[2024-06-03 06:13:35] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 06:13:35] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-03 06:13:35] [INFO ] Invariant cache hit.
[2024-06-03 06:13:36] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2024-06-03 06:13:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-03 06:13:42] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2024-06-03 06:13:42] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-06-03 06:13:43] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-06-03 06:13:43] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2024-06-03 06:13:43] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-06-03 06:13:43] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 3 ms to minimize.
[2024-06-03 06:13:44] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-06-03 06:13:44] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-06-03 06:13:44] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-03 06:13:44] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-03 06:13:45] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (OVERLAPS) 388/564 variables, 176/209 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-03 06:13:54] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-03 06:14:04] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-06-03 06:14:04] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 212 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-03 06:14:11] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 6 (OVERLAPS) 388/564 variables, 176/213 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 387/600 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 600 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 15/15 constraints]
After SMT, in 61044ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 61052ms
Starting structural reductions in LTL mode, iteration 1 : 176/234 places, 388/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61561 ms. Remains : 176/234 places, 388/505 transitions.
[2024-06-03 06:14:37] [INFO ] Flatten gal took : 14 ms
[2024-06-03 06:14:37] [INFO ] Flatten gal took : 17 ms
[2024-06-03 06:14:37] [INFO ] Input system was already deterministic with 388 transitions.
[2024-06-03 06:14:37] [INFO ] Flatten gal took : 15 ms
[2024-06-03 06:14:37] [INFO ] Flatten gal took : 14 ms
[2024-06-03 06:14:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality17592356025788013183.gal : 3 ms
[2024-06-03 06:14:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality13485171501593625624.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/CTLCardinality17592356025788013183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13485171501593625624.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-06-03 06:15:07] [INFO ] Flatten gal took : 24 ms
[2024-06-03 06:15:07] [INFO ] Applying decomposition
[2024-06-03 06:15:07] [INFO ] Flatten gal took : 25 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/graph3188791376502264178.txt' '-o' '/tmp/graph3188791376502264178.bin' '-w' '/tmp/graph3188791376502264178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3188791376502264178.bin' '-l' '-1' '-v' '-w' '/tmp/graph3188791376502264178.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:15:07] [INFO ] Decomposing Gal with order
[2024-06-03 06:15:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:15:07] [INFO ] Removed a total of 772 redundant transitions.
[2024-06-03 06:15:07] [INFO ] Flatten gal took : 56 ms
[2024-06-03 06:15:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 18 ms.
[2024-06-03 06:15:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality13546324840750427650.gal : 13 ms
[2024-06-03 06:15:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality18129443384344038143.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/CTLCardinality13546324840750427650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18129443384344038143.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 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 190 transition count 439
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 190 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 190 transition count 435
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 109 place count 172 transition count 387
Iterating global reduction 2 with 18 rules applied. Total rules applied 127 place count 172 transition count 387
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 136 place count 163 transition count 363
Iterating global reduction 2 with 9 rules applied. Total rules applied 145 place count 163 transition count 363
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 160 transition count 354
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 160 transition count 354
Applied a total of 151 rules in 9 ms. Remains 160 /234 variables (removed 74) and now considering 354/505 (removed 151) transitions.
// Phase 1: matrix 354 rows 160 cols
[2024-06-03 06:15:37] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 06:15:38] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-03 06:15:38] [INFO ] Invariant cache hit.
[2024-06-03 06:15:38] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-06-03 06:15:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-03 06:15:44] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 2 ms to minimize.
[2024-06-03 06:15:44] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-06-03 06:15:44] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-06-03 06:15:44] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-06-03 06:15:44] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-06-03 06:15:45] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/188 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-03 06:15:52] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 0/514 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 189 constraints, problems are : Problem set: 0 solved, 353 unsolved in 29706 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 353/542 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-03 06:16:20] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-03 06:16:31] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-06-03 06:16:33] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 545 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 10/10 constraints]
After SMT, in 60670ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60678ms
Starting structural reductions in LTL mode, iteration 1 : 160/234 places, 354/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61139 ms. Remains : 160/234 places, 354/505 transitions.
[2024-06-03 06:16:39] [INFO ] Flatten gal took : 21 ms
[2024-06-03 06:16:39] [INFO ] Flatten gal took : 23 ms
[2024-06-03 06:16:39] [INFO ] Input system was already deterministic with 354 transitions.
[2024-06-03 06:16:39] [INFO ] Flatten gal took : 22 ms
[2024-06-03 06:16:39] [INFO ] Flatten gal took : 21 ms
[2024-06-03 06:16:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality9491965980647249161.gal : 4 ms
[2024-06-03 06:16:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality3126529788695828170.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/CTLCardinality9491965980647249161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3126529788695828170.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-06-03 06:17:09] [INFO ] Flatten gal took : 14 ms
[2024-06-03 06:17:09] [INFO ] Applying decomposition
[2024-06-03 06:17:09] [INFO ] Flatten gal took : 14 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/graph14479267742813515421.txt' '-o' '/tmp/graph14479267742813515421.bin' '-w' '/tmp/graph14479267742813515421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14479267742813515421.bin' '-l' '-1' '-v' '-w' '/tmp/graph14479267742813515421.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:17:09] [INFO ] Decomposing Gal with order
[2024-06-03 06:17:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:17:09] [INFO ] Removed a total of 722 redundant transitions.
[2024-06-03 06:17:09] [INFO ] Flatten gal took : 40 ms
[2024-06-03 06:17:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 6 ms.
[2024-06-03 06:17:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9970152735697541262.gal : 3 ms
[2024-06-03 06:17:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality13802733096587470774.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/CTLCardinality9970152735697541262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13802733096587470774.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,9.70872e+10,4.28772,101016,2944,653,157702,8276,576,464647,136,52949,0


Converting to forward existential form...Done !
original formula: AX(EF(!(E((i9.i1.u43.p299==0) U (i0.i2.u20.p121==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E((i9.i1.u43.p299==0) U (i0.i2.u20.p121==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t97, t135, t139, t166, t168, t178, t186, t190, i1.u5.t126, i2.t117, i2.u7.t95, ...1049
(forward)formula 0,1,7.38502,127416,1,0,186595,19691,3202,687497,705,158043,443987
FORMULA MedleyA-PT-22-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 230 transition count 470
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 198 transition count 470
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 65 place count 198 transition count 466
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 194 transition count 466
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 108 place count 159 transition count 408
Iterating global reduction 2 with 35 rules applied. Total rules applied 143 place count 159 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 143 place count 159 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 156 transition count 405
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 165 place count 140 transition count 361
Iterating global reduction 2 with 16 rules applied. Total rules applied 181 place count 140 transition count 361
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 187 place count 134 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 193 place count 134 transition count 345
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 195 place count 132 transition count 339
Iterating global reduction 2 with 2 rules applied. Total rules applied 197 place count 132 transition count 339
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 243 place count 108 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 246 place count 108 transition count 314
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 254 place count 100 transition count 296
Iterating global reduction 3 with 8 rules applied. Total rules applied 262 place count 100 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 265 place count 100 transition count 293
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 97 transition count 290
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 95 transition count 288
Applied a total of 273 rules in 56 ms. Remains 95 /234 variables (removed 139) and now considering 288/505 (removed 217) transitions.
// Phase 1: matrix 288 rows 95 cols
[2024-06-03 06:17:16] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 06:17:17] [INFO ] Implicit Places using invariants in 124 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 94/234 places, 288/505 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 190 ms. Remains : 94/234 places, 288/505 transitions.
[2024-06-03 06:17:17] [INFO ] Flatten gal took : 9 ms
[2024-06-03 06:17:17] [INFO ] Flatten gal took : 10 ms
[2024-06-03 06:17:17] [INFO ] Input system was already deterministic with 288 transitions.
[2024-06-03 06:17:17] [INFO ] Flatten gal took : 17 ms
RANDOM walk for 9814 steps (1029 resets) in 33 ms. (288 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-22-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 06:17:17] [INFO ] Flatten gal took : 24 ms
[2024-06-03 06:17:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17720940642808563211.gal : 3 ms
[2024-06-03 06:17:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10994970608975658317.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17720940642808563211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10994970608975658317.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 39 place count 195 transition count 444
Iterating global reduction 1 with 38 rules applied. Total rules applied 77 place count 195 transition count 444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 195 transition count 442
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 95 place count 179 transition count 400
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 179 transition count 400
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 117 place count 173 transition count 384
Iterating global reduction 2 with 6 rules applied. Total rules applied 123 place count 173 transition count 384
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 171 transition count 378
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 171 transition count 378
Applied a total of 127 rules in 9 ms. Remains 171 /234 variables (removed 63) and now considering 378/505 (removed 127) transitions.
// Phase 1: matrix 378 rows 171 cols
[2024-06-03 06:17:17] [INFO ] Computed 22 invariants in 5 ms
[2024-06-03 06:17:17] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-03 06:17:17] [INFO ] Invariant cache hit.
[2024-06-03 06:17:17] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-06-03 06:17:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-03 06:17:23] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-06-03 06:17:23] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-03 06:17:23] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-03 06:17:23] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-06-03 06:17:23] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-06-03 06:17:24] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/549 variables, 171/199 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-03 06:17:31] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (OVERLAPS) 0/549 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 200 constraints, problems are : Problem set: 0 solved, 377 unsolved in 28145 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/549 variables, 171/200 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 377/577 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-03 06:17:58] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-06-03 06:17:58] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-03 06:18:12] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 580 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 10/10 constraints]
After SMT, in 58751ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 58756ms
Starting structural reductions in LTL mode, iteration 1 : 171/234 places, 378/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59173 ms. Remains : 171/234 places, 378/505 transitions.
[2024-06-03 06:18:16] [INFO ] Flatten gal took : 18 ms
[2024-06-03 06:18:16] [INFO ] Flatten gal took : 20 ms
[2024-06-03 06:18:16] [INFO ] Input system was already deterministic with 378 transitions.
[2024-06-03 06:18:16] [INFO ] Flatten gal took : 20 ms
[2024-06-03 06:18:16] [INFO ] Flatten gal took : 20 ms
[2024-06-03 06:18:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality12691690077196575072.gal : 4 ms
[2024-06-03 06:18:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality2922594173651917113.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/CTLCardinality12691690077196575072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2922594173651917113.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-06-03 06:18:46] [INFO ] Flatten gal took : 12 ms
[2024-06-03 06:18:46] [INFO ] Applying decomposition
[2024-06-03 06:18:46] [INFO ] Flatten gal took : 12 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/graph3676412729154696732.txt' '-o' '/tmp/graph3676412729154696732.bin' '-w' '/tmp/graph3676412729154696732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3676412729154696732.bin' '-l' '-1' '-v' '-w' '/tmp/graph3676412729154696732.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:18:46] [INFO ] Decomposing Gal with order
[2024-06-03 06:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:18:46] [INFO ] Removed a total of 723 redundant transitions.
[2024-06-03 06:18:46] [INFO ] Flatten gal took : 30 ms
[2024-06-03 06:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 6 ms.
[2024-06-03 06:18:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality16693991794629349690.gal : 3 ms
[2024-06-03 06:18:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality11057576299592081453.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/CTLCardinality16693991794629349690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11057576299592081453.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,2.22762e+11,19.7117,336980,5249,1117,447220,16312,642,1.38929e+06,189,171388,0


Converting to forward existential form...Done !
original formula: !(A((EF(EG(((i8.u40.p195==0)||(i10.i1.u44.p290==1)))) + (AX(A((i2.i2.u32.p217==1) U (i6.u17.p103==0))) * EF(((((i3.u8.p44==0)||(i6.u27.p1...288
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(!((E(!((i10.i0.u42.p295==1)) U (!(((i6.u27.p173==0)||(i6.u17.p113==1))) * !((i10.i0.u42.p2...1225
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t63, t112, t146, t147, t154, t158, t160, t173, t191, t193, t195, t201, t203, t216, t...1365
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 41 place count 193 transition count 446
Iterating global reduction 1 with 40 rules applied. Total rules applied 81 place count 193 transition count 446
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 193 transition count 442
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 101 place count 177 transition count 401
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 177 transition count 401
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 125 place count 169 transition count 380
Iterating global reduction 2 with 8 rules applied. Total rules applied 133 place count 169 transition count 380
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 166 transition count 371
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 166 transition count 371
Applied a total of 139 rules in 15 ms. Remains 166 /234 variables (removed 68) and now considering 371/505 (removed 134) transitions.
// Phase 1: matrix 371 rows 166 cols
[2024-06-03 06:19:16] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 06:19:16] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 06:19:16] [INFO ] Invariant cache hit.
[2024-06-03 06:19:17] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-03 06:19:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-03 06:19:22] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-06-03 06:19:22] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-06-03 06:19:22] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-06-03 06:19:22] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-06-03 06:19:23] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 2 ms to minimize.
[2024-06-03 06:19:23] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-06-03 06:19:23] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2024-06-03 06:19:23] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-06-03 06:19:23] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-03 06:19:23] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-03 06:19:24] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-03 06:19:24] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 371/537 variables, 166/200 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-03 06:19:31] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/537 variables, and 201 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 371/537 variables, 166/201 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 370/571 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-03 06:19:59] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-03 06:19:59] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-06-03 06:20:00] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-06-03 06:20:01] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 4/575 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 575 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 17/17 constraints]
After SMT, in 60644ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60648ms
Starting structural reductions in LTL mode, iteration 1 : 166/234 places, 371/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61110 ms. Remains : 166/234 places, 371/505 transitions.
[2024-06-03 06:20:17] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:20:17] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:20:17] [INFO ] Input system was already deterministic with 371 transitions.
[2024-06-03 06:20:17] [INFO ] Flatten gal took : 20 ms
[2024-06-03 06:20:17] [INFO ] Flatten gal took : 20 ms
[2024-06-03 06:20:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality2945557509412938069.gal : 4 ms
[2024-06-03 06:20:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3483505250481886787.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/CTLCardinality2945557509412938069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3483505250481886787.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-06-03 06:20:47] [INFO ] Flatten gal took : 13 ms
[2024-06-03 06:20:47] [INFO ] Applying decomposition
[2024-06-03 06:20:48] [INFO ] Flatten gal took : 13 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/graph16254972327939182397.txt' '-o' '/tmp/graph16254972327939182397.bin' '-w' '/tmp/graph16254972327939182397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16254972327939182397.bin' '-l' '-1' '-v' '-w' '/tmp/graph16254972327939182397.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:20:48] [INFO ] Decomposing Gal with order
[2024-06-03 06:20:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:20:48] [INFO ] Removed a total of 740 redundant transitions.
[2024-06-03 06:20:48] [INFO ] Flatten gal took : 28 ms
[2024-06-03 06:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 4 ms.
[2024-06-03 06:20:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality6592546842778830633.gal : 3 ms
[2024-06-03 06:20:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality18326526276330412434.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/CTLCardinality6592546842778830633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18326526276330412434.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,1.41657e+11,10.4804,191336,5440,854,299741,9684,614,964017,167,79248,0


Converting to forward existential form...Done !
original formula: EX(AG(A(EF((i5.u26.p161==1)) U ((i7.u32.p218==1)&&(((i2.u13.p82==0)||(i2.u3.p5==1))||(i4.u23.p143==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!((E(!(((i7.u32.p218==1)&&(((i2.u13.p82==0)||(i2.u3.p5==1))||(i4.u23.p143==1)))) U (!(...360
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t102, t118, t139, t144, t155, t185, t189, t190, t192, t194, t207, t209, t211, t...1239
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 190 transition count 439
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 190 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 190 transition count 435
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 108 place count 173 transition count 388
Iterating global reduction 2 with 17 rules applied. Total rules applied 125 place count 173 transition count 388
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 134 place count 164 transition count 364
Iterating global reduction 2 with 9 rules applied. Total rules applied 143 place count 164 transition count 364
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 161 transition count 355
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 161 transition count 355
Applied a total of 149 rules in 11 ms. Remains 161 /234 variables (removed 73) and now considering 355/505 (removed 150) transitions.
// Phase 1: matrix 355 rows 161 cols
[2024-06-03 06:21:18] [INFO ] Computed 22 invariants in 10 ms
[2024-06-03 06:21:18] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-03 06:21:18] [INFO ] Invariant cache hit.
[2024-06-03 06:21:18] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2024-06-03 06:21:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-03 06:21:23] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-06-03 06:21:23] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2024-06-03 06:21:24] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-06-03 06:21:24] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-03 06:21:24] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-03 06:21:24] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-03 06:21:31] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 190 constraints, problems are : Problem set: 0 solved, 354 unsolved in 25970 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 354/544 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-03 06:21:56] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 545 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 8/8 constraints]
After SMT, in 56962ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 56970ms
Starting structural reductions in LTL mode, iteration 1 : 161/234 places, 355/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57586 ms. Remains : 161/234 places, 355/505 transitions.
[2024-06-03 06:22:15] [INFO ] Flatten gal took : 18 ms
[2024-06-03 06:22:15] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:22:15] [INFO ] Input system was already deterministic with 355 transitions.
[2024-06-03 06:22:15] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:22:15] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:22:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality5035507103143924429.gal : 10 ms
[2024-06-03 06:22:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality2076874173652494010.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/CTLCardinality5035507103143924429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2076874173652494010.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-06-03 06:22:45] [INFO ] Flatten gal took : 12 ms
[2024-06-03 06:22:45] [INFO ] Applying decomposition
[2024-06-03 06:22:45] [INFO ] Flatten gal took : 11 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/graph2305857617572889355.txt' '-o' '/tmp/graph2305857617572889355.bin' '-w' '/tmp/graph2305857617572889355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2305857617572889355.bin' '-l' '-1' '-v' '-w' '/tmp/graph2305857617572889355.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:22:46] [INFO ] Decomposing Gal with order
[2024-06-03 06:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:22:46] [INFO ] Removed a total of 662 redundant transitions.
[2024-06-03 06:22:46] [INFO ] Flatten gal took : 26 ms
[2024-06-03 06:22:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 12 ms.
[2024-06-03 06:22:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality8372119837982784947.gal : 3 ms
[2024-06-03 06:22:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5472641975338042749.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/CTLCardinality8372119837982784947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5472641975338042749.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15126e+11,9.70553,203708,4430,651,376478,29112,544,616896,163,192810,0


Converting to forward existential form...Done !
original formula: AG(AX(AX((EG((i6.u40.p195==0)) + ((i5.u4.p21==0)&&(i1.i1.u9.p45==1))))))
=> equivalent forward existential formula: [((EY(EY(FwdU(Init,TRUE))) * !(((i5.u4.p21==0)&&(i1.i1.u9.p45==1)))) * !(EG((i6.u40.p195==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t72, t97, t130, t136, t140, t149, t157, t160, t197, t201, t203, u3.t96, u3.t98,...1075
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 230 transition count 471
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 199 transition count 470
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 198 transition count 470
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 65 place count 198 transition count 466
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 73 place count 194 transition count 466
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 104 place count 163 transition count 415
Iterating global reduction 3 with 31 rules applied. Total rules applied 135 place count 163 transition count 415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 135 place count 163 transition count 413
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 161 transition count 413
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 155 place count 145 transition count 372
Iterating global reduction 3 with 16 rules applied. Total rules applied 171 place count 145 transition count 372
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 176 place count 140 transition count 359
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 140 transition count 359
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 138 transition count 353
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 138 transition count 353
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 232 place count 113 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 235 place count 113 transition count 328
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 243 place count 105 transition count 310
Iterating global reduction 4 with 8 rules applied. Total rules applied 251 place count 105 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 254 place count 105 transition count 307
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 260 place count 102 transition count 304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 100 transition count 302
Applied a total of 262 rules in 70 ms. Remains 100 /234 variables (removed 134) and now considering 302/505 (removed 203) transitions.
// Phase 1: matrix 302 rows 100 cols
[2024-06-03 06:23:16] [INFO ] Computed 19 invariants in 1 ms
[2024-06-03 06:23:16] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-03 06:23:16] [INFO ] Invariant cache hit.
[2024-06-03 06:23:16] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-03 06:23:16] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-03 06:23:16] [INFO ] Redundant transitions in 13 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-03 06:23:16] [INFO ] Invariant cache hit.
[2024-06-03 06:23:16] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-03 06:23:18] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-03 06:23:20] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 3/99 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-03 06:23:23] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 301/400 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 2/402 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 13 (OVERLAPS) 0/402 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 158 constraints, problems are : Problem set: 0 solved, 291 unsolved in 21214 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 3/99 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 301/400 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 290/447 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 2/402 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 14 (OVERLAPS) 0/402 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 449 constraints, problems are : Problem set: 0 solved, 291 unsolved in 29353 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 3/3 constraints]
After SMT, in 51004ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 51008ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/234 places, 302/505 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51473 ms. Remains : 100/234 places, 302/505 transitions.
[2024-06-03 06:24:07] [INFO ] Flatten gal took : 10 ms
[2024-06-03 06:24:07] [INFO ] Flatten gal took : 10 ms
[2024-06-03 06:24:07] [INFO ] Input system was already deterministic with 302 transitions.
[2024-06-03 06:24:07] [INFO ] Flatten gal took : 11 ms
[2024-06-03 06:24:07] [INFO ] Flatten gal took : 10 ms
[2024-06-03 06:24:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4756957183560621635.gal : 2 ms
[2024-06-03 06:24:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality8036502909607870017.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/CTLCardinality4756957183560621635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8036502909607870017.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-06-03 06:24:37] [INFO ] Flatten gal took : 9 ms
[2024-06-03 06:24:37] [INFO ] Applying decomposition
[2024-06-03 06:24:37] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1639301785557381461.txt' '-o' '/tmp/graph1639301785557381461.bin' '-w' '/tmp/graph1639301785557381461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1639301785557381461.bin' '-l' '-1' '-v' '-w' '/tmp/graph1639301785557381461.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:24:37] [INFO ] Decomposing Gal with order
[2024-06-03 06:24:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:24:37] [INFO ] Removed a total of 733 redundant transitions.
[2024-06-03 06:24:37] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:24:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 4 ms.
[2024-06-03 06:24:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality4736179158505298855.gal : 2 ms
[2024-06-03 06:24:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality12886846347202516017.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/CTLCardinality4736179158505298855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12886846347202516017.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,4.18521e+09,21.9291,420528,2889,130,541959,994,404,2.72488e+06,108,13393,0


Converting to forward existential form...Done !
original formula: AG(((AG((i4.u15.p203==0)) + AG(((i1.u0.p13==1)||(i3.u14.p160==1)))) + (((i4.u21.p261==0)&&(i3.u8.p101==1)) * AG((i4.u16.p226==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((!(E(TRUE U !((i4.u15.p203==0)))) + !(E(TRUE U !(((i1.u0.p13==1)||(i3.u14.p160==1)))))))...366
Reverse transition relation is NOT exact ! Due to transitions t13, t18, t68, t70, t78, t90, t91, t98, t99, t102, t103, t156, t157, t171, t185, i0.t82, i0.t...994
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 230 transition count 472
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 200 transition count 470
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 198 transition count 470
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 65 place count 198 transition count 467
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 195 transition count 467
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 103 place count 163 transition count 416
Iterating global reduction 3 with 32 rules applied. Total rules applied 135 place count 163 transition count 416
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 135 place count 163 transition count 414
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 161 transition count 414
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 153 place count 147 transition count 373
Iterating global reduction 3 with 14 rules applied. Total rules applied 167 place count 147 transition count 373
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 173 place count 141 transition count 357
Iterating global reduction 3 with 6 rules applied. Total rules applied 179 place count 141 transition count 357
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 139 transition count 351
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 139 transition count 351
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 230 place count 115 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 233 place count 115 transition count 325
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 240 place count 108 transition count 310
Iterating global reduction 4 with 7 rules applied. Total rules applied 247 place count 108 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 250 place count 108 transition count 307
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 254 place count 106 transition count 305
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 104 transition count 303
Applied a total of 256 rules in 51 ms. Remains 104 /234 variables (removed 130) and now considering 303/505 (removed 202) transitions.
// Phase 1: matrix 303 rows 104 cols
[2024-06-03 06:25:07] [INFO ] Computed 21 invariants in 2 ms
[2024-06-03 06:25:08] [INFO ] Implicit Places using invariants in 121 ms returned [6, 39]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 123 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 102/234 places, 303/505 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 180 ms. Remains : 102/234 places, 303/505 transitions.
[2024-06-03 06:25:08] [INFO ] Flatten gal took : 10 ms
[2024-06-03 06:25:08] [INFO ] Flatten gal took : 11 ms
[2024-06-03 06:25:08] [INFO ] Input system was already deterministic with 303 transitions.
[2024-06-03 06:25:08] [INFO ] Flatten gal took : 11 ms
[2024-06-03 06:25:08] [INFO ] Flatten gal took : 11 ms
[2024-06-03 06:25:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6925813246751802765.gal : 3 ms
[2024-06-03 06:25:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality5447067147060375765.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/CTLCardinality6925813246751802765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5447067147060375765.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-06-03 06:25:38] [INFO ] Flatten gal took : 10 ms
[2024-06-03 06:25:38] [INFO ] Applying decomposition
[2024-06-03 06:25:38] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13965535818580915588.txt' '-o' '/tmp/graph13965535818580915588.bin' '-w' '/tmp/graph13965535818580915588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13965535818580915588.bin' '-l' '-1' '-v' '-w' '/tmp/graph13965535818580915588.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:25:38] [INFO ] Decomposing Gal with order
[2024-06-03 06:25:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:25:38] [INFO ] Removed a total of 758 redundant transitions.
[2024-06-03 06:25:38] [INFO ] Flatten gal took : 18 ms
[2024-06-03 06:25:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 3 ms.
[2024-06-03 06:25:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality11121596858547512802.gal : 1 ms
[2024-06-03 06:25:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality15935606893377294881.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/CTLCardinality11121596858547512802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15935606893377294881.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5023e+09,2.23045,61868,1703,62,94050,445,463,349840,76,3038,0


Converting to forward existential form...Done !
original formula: EF((EF(((E(AF((i3.u20.p229==1)) U (((i0.u2.p39==1)||(i2.u10.p110==0))||(i2.u9.p15==1))) * (i1.u0.p25==1)) * ((i5.u1.p14==0)||(i2.u11.p97=...200
=> equivalent forward existential formula: [(FwdU(((FwdU((FwdU(Init,TRUE) * ((i5.u26.p292==0)||(i1.u8.p67==1))),TRUE) * ((i5.u1.p14==0)||(i2.u11.p97==1))) ...266
Reverse transition relation is NOT exact ! Due to transitions t30, t35, t54, t75, t78, t183, t221, t224, i0.t80, i0.t59, i0.u2.t41, i0.u3.t60, i0.u3.t63, i...828
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.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 42 place count 192 transition count 442
Iterating global reduction 1 with 41 rules applied. Total rules applied 83 place count 192 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 192 transition count 438
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 177 transition count 397
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 177 transition count 397
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 124 place count 170 transition count 379
Iterating global reduction 2 with 7 rules applied. Total rules applied 131 place count 170 transition count 379
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 167 transition count 370
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 167 transition count 370
Applied a total of 137 rules in 9 ms. Remains 167 /234 variables (removed 67) and now considering 370/505 (removed 135) transitions.
// Phase 1: matrix 370 rows 167 cols
[2024-06-03 06:26:08] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 06:26:08] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-03 06:26:08] [INFO ] Invariant cache hit.
[2024-06-03 06:26:08] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-06-03 06:26:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 06:26:14] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 3 ms to minimize.
[2024-06-03 06:26:15] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-06-03 06:26:15] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-06-03 06:26:15] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-06-03 06:26:15] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-03 06:26:15] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/537 variables, 167/195 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 06:26:24] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 369 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 537/537 variables, and 196 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/537 variables, 167/196 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 369/565 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 06:27:05] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-06-03 06:27:06] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 567 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 9/9 constraints]
After SMT, in 60876ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60881ms
Starting structural reductions in LTL mode, iteration 1 : 167/234 places, 370/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61330 ms. Remains : 167/234 places, 370/505 transitions.
[2024-06-03 06:27:09] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:27:09] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:27:09] [INFO ] Input system was already deterministic with 370 transitions.
[2024-06-03 06:27:09] [INFO ] Flatten gal took : 19 ms
[2024-06-03 06:27:09] [INFO ] Flatten gal took : 20 ms
[2024-06-03 06:27:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality18017967311155737347.gal : 5 ms
[2024-06-03 06:27:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality15368388690387827349.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/CTLCardinality18017967311155737347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15368388690387827349.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-06-03 06:27:39] [INFO ] Flatten gal took : 12 ms
[2024-06-03 06:27:39] [INFO ] Applying decomposition
[2024-06-03 06:27:39] [INFO ] Flatten gal took : 11 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/graph7776027505273427964.txt' '-o' '/tmp/graph7776027505273427964.bin' '-w' '/tmp/graph7776027505273427964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7776027505273427964.bin' '-l' '-1' '-v' '-w' '/tmp/graph7776027505273427964.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:27:39] [INFO ] Decomposing Gal with order
[2024-06-03 06:27:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:27:39] [INFO ] Removed a total of 652 redundant transitions.
[2024-06-03 06:27:39] [INFO ] Flatten gal took : 25 ms
[2024-06-03 06:27:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 5 ms.
[2024-06-03 06:27:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality203388870779707418.gal : 3 ms
[2024-06-03 06:27:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality11930471167967680775.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/CTLCardinality203388870779707418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11930471167967680775.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65014e+11,13.7505,249292,5609,1418,327690,51097,554,1.12282e+06,191,369896,0


Converting to forward existential form...Done !
original formula: AG(((AF((u3.p88==0)) + AX(FALSE)) + (((i3.u24.p145==0)&&(i7.u40.p261==1)) * A((i5.u29.p192==1) U (i6.u35.p218==1)))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((((i3.u24.p145==0)&&(i7.u40.p261==1)) * !((E(!((i6.u35.p218==1)) U (!((i5.u29.p192==1...262
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t65, t103, t140, t147, t183, t185, t187, t193, t195, t210, t304, t305, t306, t307, t...1229
Detected timeout of ITS tools.
[2024-06-03 06:28:09] [INFO ] Flatten gal took : 16 ms
[2024-06-03 06:28:09] [INFO ] Flatten gal took : 17 ms
[2024-06-03 06:28:09] [INFO ] Applying decomposition
[2024-06-03 06:28:10] [INFO ] Flatten gal took : 15 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/graph12729158299542088911.txt' '-o' '/tmp/graph12729158299542088911.bin' '-w' '/tmp/graph12729158299542088911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12729158299542088911.bin' '-l' '-1' '-v' '-w' '/tmp/graph12729158299542088911.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:28:10] [INFO ] Decomposing Gal with order
[2024-06-03 06:28:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:28:10] [INFO ] Removed a total of 895 redundant transitions.
[2024-06-03 06:28:10] [INFO ] Flatten gal took : 35 ms
[2024-06-03 06:28:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 5 ms.
[2024-06-03 06:28:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality4017356738504296529.gal : 4 ms
[2024-06-03 06:28:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality18431528585276792091.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/CTLCardinality4017356738504296529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18431528585276792091.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 06:48:05] [INFO ] Applying decomposition
[2024-06-03 06:48:05] [INFO ] Flatten gal took : 15 ms
[2024-06-03 06:48:05] [INFO ] Decomposing Gal with order
[2024-06-03 06:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:48:05] [INFO ] Removed a total of 866 redundant transitions.
[2024-06-03 06:48:05] [INFO ] Flatten gal took : 35 ms
[2024-06-03 06:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 207 labels/synchronizations in 7 ms.
[2024-06-03 06:48:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality1275248350257207218.gal : 3 ms
[2024-06-03 06:48:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15468139312565807847.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/CTLCardinality1275248350257207218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15468139312565807847.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.

BK_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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r576-smll-171734920200169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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