Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600041.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyCommit-PT-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 627K May 29 14: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

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

=== Now, execution of the tool begins

BK_START 1749057474978

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 17:17:57] [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]
[2025-06-04 17:17:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 17:17:58] [INFO ] Load time of PNML (sax parser for PT used): 512 ms
[2025-06-04 17:17:58] [INFO ] Transformed 1534 places.
[2025-06-04 17:17:58] [INFO ] Transformed 2136 transitions.
[2025-06-04 17:17:58] [INFO ] Found NUPN structural information;
[2025-06-04 17:17:58] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 765 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-04b-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 137 out of 1534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 108 place count 1426 transition count 2028
Iterating global reduction 0 with 108 rules applied. Total rules applied 216 place count 1426 transition count 2028
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 277 place count 1365 transition count 1967
Iterating global reduction 0 with 61 rules applied. Total rules applied 338 place count 1365 transition count 1967
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 372 place count 1331 transition count 1933
Iterating global reduction 0 with 34 rules applied. Total rules applied 406 place count 1331 transition count 1933
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 432 place count 1305 transition count 1907
Iterating global reduction 0 with 26 rules applied. Total rules applied 458 place count 1305 transition count 1907
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 478 place count 1285 transition count 1887
Iterating global reduction 0 with 20 rules applied. Total rules applied 498 place count 1285 transition count 1887
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 517 place count 1266 transition count 1868
Iterating global reduction 0 with 19 rules applied. Total rules applied 536 place count 1266 transition count 1868
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 553 place count 1249 transition count 1851
Iterating global reduction 0 with 17 rules applied. Total rules applied 570 place count 1249 transition count 1851
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 587 place count 1232 transition count 1834
Iterating global reduction 0 with 17 rules applied. Total rules applied 604 place count 1232 transition count 1834
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 617 place count 1219 transition count 1821
Iterating global reduction 0 with 13 rules applied. Total rules applied 630 place count 1219 transition count 1821
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 638 place count 1211 transition count 1813
Iterating global reduction 0 with 8 rules applied. Total rules applied 646 place count 1211 transition count 1813
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 647 place count 1211 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 648 place count 1210 transition count 1811
Iterating global reduction 1 with 1 rules applied. Total rules applied 649 place count 1210 transition count 1811
Applied a total of 649 rules in 2841 ms. Remains 1210 /1534 variables (removed 324) and now considering 1811/2136 (removed 325) transitions.
// Phase 1: matrix 1811 rows 1210 cols
[2025-06-04 17:18:01] [INFO ] Computed 6 invariants in 62 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:18:03] [INFO ] Implicit Places using invariants in 1815 ms returned []
[2025-06-04 17:18:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:18:06] [INFO ] Implicit Places using invariants and state equation in 3219 ms returned []
Implicit Place search using SMT with State Equation took 5088 ms to find 0 implicit places.
Running 1810 sub problems to find dead transitions.
[2025-06-04 17:18:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1209/3021 variables, and 0 constraints, problems are : Problem set: 0 solved, 1810 unsolved in 30161 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1210 constraints, PredecessorRefiner: 1810/1810 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1209/3021 variables, and 0 constraints, problems are : Problem set: 0 solved, 1810 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1210 constraints, PredecessorRefiner: 0/1810 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63406ms problems are : Problem set: 0 solved, 1810 unsolved
Search for dead transitions found 0 dead transitions in 63463ms
Starting structural reductions in LTL mode, iteration 1 : 1210/1534 places, 1811/2136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71452 ms. Remains : 1210/1534 places, 1811/2136 transitions.
Support contains 137 out of 1210 places after structural reductions.
[2025-06-04 17:19:10] [INFO ] Flatten gal took : 342 ms
[2025-06-04 17:19:11] [INFO ] Flatten gal took : 201 ms
[2025-06-04 17:19:11] [INFO ] Input system was already deterministic with 1811 transitions.
Support contains 119 out of 1210 places (down from 137) after GAL structural reductions.
RANDOM walk for 40000 steps (417 resets) in 1885 ms. (21 steps per ms) remains 42/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
[2025-06-04 17:19:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1126/1196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:15] [INFO ] Deduced a trap composed of 335 places in 1735 ms of which 845 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:16] [INFO ] Deduced a trap composed of 336 places in 1647 ms of which 517 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:18] [INFO ] Deduced a trap composed of 325 places in 1585 ms of which 439 ms to minimize.
SMT process timed out in 5932ms, After SMT, problems are : Problem set: 0 solved, 42 unsolved
Fused 42 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 70 out of 1210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Graph (trivial) has 1064 edges and 1210 vertex of which 54 / 1210 are part of one of the 10 SCC in 11 ms
Free SCC test removed 44 places
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Graph (complete) has 1885 edges and 1166 vertex of which 1161 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.19 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 739 transitions
Trivial Post-agglo rules discarded 739 transitions
Performed 739 trivial Post agglomeration. Transition count delta: 739
Iterating post reduction 0 with 743 rules applied. Total rules applied 745 place count 1161 transition count 1007
Reduce places removed 739 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 758 rules applied. Total rules applied 1503 place count 422 transition count 988
Reduce places removed 10 places and 0 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 2 with 47 rules applied. Total rules applied 1550 place count 412 transition count 951
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 1587 place count 375 transition count 951
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 1587 place count 375 transition count 886
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1717 place count 310 transition count 886
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1724 place count 303 transition count 879
Iterating global reduction 4 with 7 rules applied. Total rules applied 1731 place count 303 transition count 879
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1735 place count 299 transition count 795
Iterating global reduction 4 with 4 rules applied. Total rules applied 1739 place count 299 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1740 place count 299 transition count 794
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1741 place count 298 transition count 793
Iterating global reduction 5 with 1 rules applied. Total rules applied 1742 place count 298 transition count 793
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1814 place count 262 transition count 757
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1820 place count 262 transition count 751
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1838 place count 244 transition count 445
Iterating global reduction 6 with 18 rules applied. Total rules applied 1856 place count 244 transition count 445
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1859 place count 244 transition count 442
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1865 place count 238 transition count 436
Iterating global reduction 7 with 6 rules applied. Total rules applied 1871 place count 238 transition count 436
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1873 place count 236 transition count 434
Iterating global reduction 7 with 2 rules applied. Total rules applied 1875 place count 236 transition count 434
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1893 place count 227 transition count 425
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1901 place count 223 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1902 place count 223 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1903 place count 223 transition count 442
Free-agglomeration rule applied 46 times.
Iterating global reduction 8 with 46 rules applied. Total rules applied 1949 place count 223 transition count 396
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 8 with 46 rules applied. Total rules applied 1995 place count 177 transition count 396
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1998 place count 174 transition count 393
Iterating global reduction 9 with 3 rules applied. Total rules applied 2001 place count 174 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 2076 place count 174 transition count 318
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2082 place count 174 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2086 place count 174 transition count 314
Applied a total of 2086 rules in 603 ms. Remains 174 /1210 variables (removed 1036) and now considering 314/1811 (removed 1497) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 604 ms. Remains : 174/1210 places, 314/1811 transitions.
RANDOM walk for 40000 steps (1032 resets) in 1091 ms. (36 steps per ms) remains 20/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (18 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
// Phase 1: matrix 314 rows 174 cols
[2025-06-04 17:19:19] [INFO ] Computed 6 invariants in 5 ms
[2025-06-04 17:19:19] [INFO ] State equation strengthened by 114 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 140/173 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/174 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 314/488 variables, 174/180 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 114/294 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 294 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 174/174 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 140/173 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:21] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:21] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:21] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:21] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:22] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:22] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:22] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:22] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:22] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 10 ms to minimize.
Problem AtomicPropp8 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/14 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/174 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:23] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:19:23] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 2/17 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 314/488 variables, 174/191 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 114/305 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 13/318 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/318 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/488 variables, 0/318 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 318 constraints, problems are : Problem set: 3 solved, 13 unsolved in 4341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 174/174 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 13/16 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5523ms problems are : Problem set: 3 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 240 ms.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-04b-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 17:19:25] [INFO ] Flatten gal took : 135 ms
[2025-06-04 17:19:25] [INFO ] Flatten gal took : 113 ms
[2025-06-04 17:19:25] [INFO ] Input system was already deterministic with 1811 transitions.
Computed a total of 213 stabilizing places and 223 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1169 transition count 1770
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1169 transition count 1770
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 115 place count 1136 transition count 1737
Iterating global reduction 0 with 33 rules applied. Total rules applied 148 place count 1136 transition count 1737
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 170 place count 1114 transition count 1715
Iterating global reduction 0 with 22 rules applied. Total rules applied 192 place count 1114 transition count 1715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 212 place count 1094 transition count 1695
Iterating global reduction 0 with 20 rules applied. Total rules applied 232 place count 1094 transition count 1695
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 248 place count 1078 transition count 1679
Iterating global reduction 0 with 16 rules applied. Total rules applied 264 place count 1078 transition count 1679
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 280 place count 1062 transition count 1663
Iterating global reduction 0 with 16 rules applied. Total rules applied 296 place count 1062 transition count 1663
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 311 place count 1047 transition count 1648
Iterating global reduction 0 with 15 rules applied. Total rules applied 326 place count 1047 transition count 1648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 327 place count 1047 transition count 1647
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 339 place count 1035 transition count 1635
Iterating global reduction 1 with 12 rules applied. Total rules applied 351 place count 1035 transition count 1635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 352 place count 1035 transition count 1634
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 361 place count 1026 transition count 1625
Iterating global reduction 2 with 9 rules applied. Total rules applied 370 place count 1026 transition count 1625
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 372 place count 1026 transition count 1623
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 378 place count 1020 transition count 1617
Iterating global reduction 3 with 6 rules applied. Total rules applied 384 place count 1020 transition count 1617
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 389 place count 1015 transition count 1612
Iterating global reduction 3 with 5 rules applied. Total rules applied 394 place count 1015 transition count 1612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 1015 transition count 1611
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 399 place count 1011 transition count 1607
Iterating global reduction 4 with 4 rules applied. Total rules applied 403 place count 1011 transition count 1607
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 407 place count 1007 transition count 1603
Iterating global reduction 4 with 4 rules applied. Total rules applied 411 place count 1007 transition count 1603
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 415 place count 1003 transition count 1599
Iterating global reduction 4 with 4 rules applied. Total rules applied 419 place count 1003 transition count 1599
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 423 place count 999 transition count 1595
Iterating global reduction 4 with 4 rules applied. Total rules applied 427 place count 999 transition count 1595
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 431 place count 995 transition count 1591
Iterating global reduction 4 with 4 rules applied. Total rules applied 435 place count 995 transition count 1591
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 439 place count 991 transition count 1587
Iterating global reduction 4 with 4 rules applied. Total rules applied 443 place count 991 transition count 1587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 444 place count 991 transition count 1586
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 447 place count 988 transition count 1583
Iterating global reduction 5 with 3 rules applied. Total rules applied 450 place count 988 transition count 1583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 451 place count 988 transition count 1582
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 453 place count 986 transition count 1580
Iterating global reduction 6 with 2 rules applied. Total rules applied 455 place count 986 transition count 1580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 456 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 457 place count 985 transition count 1578
Iterating global reduction 7 with 1 rules applied. Total rules applied 458 place count 985 transition count 1578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 459 place count 985 transition count 1577
Applied a total of 459 rules in 1204 ms. Remains 985 /1210 variables (removed 225) and now considering 1577/1811 (removed 234) transitions.
// Phase 1: matrix 1577 rows 985 cols
[2025-06-04 17:19:27] [INFO ] Computed 6 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:19:28] [INFO ] Implicit Places using invariants in 1208 ms returned []
[2025-06-04 17:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:19:30] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned []
Implicit Place search using SMT with State Equation took 3313 ms to find 0 implicit places.
Running 1576 sub problems to find dead transitions.
[2025-06-04 17:19:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/2562 variables, and 0 constraints, problems are : Problem set: 0 solved, 1576 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/985 constraints, PredecessorRefiner: 1576/1576 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1576 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/2562 variables, and 0 constraints, problems are : Problem set: 0 solved, 1576 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/985 constraints, PredecessorRefiner: 0/1576 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61694ms problems are : Problem set: 0 solved, 1576 unsolved
Search for dead transitions found 0 dead transitions in 61700ms
Starting structural reductions in LTL mode, iteration 1 : 985/1210 places, 1577/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66225 ms. Remains : 985/1210 places, 1577/1811 transitions.
[2025-06-04 17:20:32] [INFO ] Flatten gal took : 92 ms
[2025-06-04 17:20:32] [INFO ] Flatten gal took : 100 ms
[2025-06-04 17:20:32] [INFO ] Input system was already deterministic with 1577 transitions.
[2025-06-04 17:20:32] [INFO ] Flatten gal took : 58 ms
[2025-06-04 17:20:32] [INFO ] Flatten gal took : 59 ms
[2025-06-04 17:20:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality14962331720015488149.gal : 59 ms
[2025-06-04 17:20:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality2009035142924707056.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14962331720015488149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2009035142924707056.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-04 17:21:02] [INFO ] Flatten gal took : 58 ms
[2025-06-04 17:21:02] [INFO ] Applying decomposition
[2025-06-04 17:21:03] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16963894094264906140.txt' '-o' '/tmp/graph16963894094264906140.bin' '-w' '/tmp/graph16963894094264906140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16963894094264906140.bin' '-l' '-1' '-v' '-w' '/tmp/graph16963894094264906140.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:21:03] [INFO ] Decomposing Gal with order
[2025-06-04 17:21:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:21:03] [INFO ] Removed a total of 2808 redundant transitions.
[2025-06-04 17:21:04] [INFO ] Flatten gal took : 281 ms
[2025-06-04 17:21:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 47 ms.
[2025-06-04 17:21:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality8438576464152996520.gal : 37 ms
[2025-06-04 17:21:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality10374793333338647570.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8438576464152996520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10374793333338647570.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Graph (trivial) has 1193 edges and 1210 vertex of which 85 / 1210 are part of one of the 15 SCC in 4 ms
Free SCC test removed 70 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 852 transitions
Trivial Post-agglo rules discarded 852 transitions
Performed 852 trivial Post agglomeration. Transition count delta: 852
Iterating post reduction 0 with 852 rules applied. Total rules applied 853 place count 1139 transition count 879
Reduce places removed 852 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 864 rules applied. Total rules applied 1717 place count 287 transition count 867
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 1725 place count 282 transition count 864
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1728 place count 279 transition count 864
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 1728 place count 279 transition count 803
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 1850 place count 218 transition count 803
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1874 place count 194 transition count 778
Iterating global reduction 4 with 24 rules applied. Total rules applied 1898 place count 194 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1898 place count 194 transition count 777
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 1900 place count 193 transition count 777
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1912 place count 181 transition count 604
Iterating global reduction 4 with 12 rules applied. Total rules applied 1924 place count 181 transition count 604
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1928 place count 181 transition count 600
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1931 place count 178 transition count 596
Iterating global reduction 5 with 3 rules applied. Total rules applied 1934 place count 178 transition count 596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1935 place count 178 transition count 595
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1936 place count 177 transition count 594
Iterating global reduction 6 with 1 rules applied. Total rules applied 1937 place count 177 transition count 594
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1997 place count 147 transition count 564
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2003 place count 147 transition count 558
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 2030 place count 120 transition count 276
Iterating global reduction 7 with 27 rules applied. Total rules applied 2057 place count 120 transition count 276
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 2068 place count 120 transition count 265
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2084 place count 104 transition count 246
Iterating global reduction 8 with 16 rules applied. Total rules applied 2100 place count 104 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2101 place count 104 transition count 245
Discarding 14 places :
Symmetric choice reduction at 9 with 14 rule applications. Total rules 2115 place count 90 transition count 228
Iterating global reduction 9 with 14 rules applied. Total rules applied 2129 place count 90 transition count 228
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 2136 place count 90 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2138 place count 89 transition count 220
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2139 place count 88 transition count 214
Iterating global reduction 10 with 1 rules applied. Total rules applied 2140 place count 88 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2141 place count 88 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 2147 place count 88 transition count 207
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 2159 place count 82 transition count 201
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 2161 place count 82 transition count 201
Applied a total of 2161 rules in 165 ms. Remains 82 /1210 variables (removed 1128) and now considering 201/1811 (removed 1610) transitions.
[2025-06-04 17:21:34] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
// Phase 1: matrix 194 rows 82 cols
[2025-06-04 17:21:34] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:21:34] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-04 17:21:34] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
[2025-06-04 17:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:21:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 17:21:35] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:21:35] [INFO ] Redundant transitions in 15 ms returned []
Running 197 sub problems to find dead transitions.
[2025-06-04 17:21:35] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
[2025-06-04 17:21:35] [INFO ] Invariant cache hit.
[2025-06-04 17:21:35] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:37] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:37] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:38] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:38] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:38] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:38] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:38] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:38] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:39] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:39] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:39] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:39] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:39] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:39] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:39] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:40] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:40] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:40] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:41] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:41] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:42] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:42] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 193/275 variables, 82/106 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 30/136 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:45] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:45] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:46] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:46] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:46] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:46] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:46] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:47] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:21:48] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (OVERLAPS) 1/276 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (OVERLAPS) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 146 constraints, problems are : Problem set: 0 solved, 197 unsolved in 29212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 193/275 variables, 82/115 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 30/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 197/342 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 1/276 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/276 variables, and 343 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59348ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 59350ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/1210 places, 201/1811 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60080 ms. Remains : 82/1210 places, 201/1811 transitions.
[2025-06-04 17:22:34] [INFO ] Flatten gal took : 17 ms
[2025-06-04 17:22:34] [INFO ] Flatten gal took : 14 ms
[2025-06-04 17:22:34] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-04 17:22:34] [INFO ] Flatten gal took : 13 ms
[2025-06-04 17:22:34] [INFO ] Flatten gal took : 14 ms
[2025-06-04 17:22:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality10463177009547444544.gal : 3 ms
[2025-06-04 17:22:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality13932069289813228313.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10463177009547444544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13932069289813228313.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,801072,1.58378,43008,2,5364,5,106480,6,0,522,103451,0


Converting to forward existential form...Done !
original formula: AF(!(E(((p82==0)||(p604==1)) U AF(((p1507==0)||(p1371==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(((p82==0)||(p604==1)) U !(EG(!(((p1507==0)||(p1371==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t11, t13, t14, t15, t17, t18, t19, t20, t22, t23, t24, t27, t28, t29, t61, t62, t...384
(forward)formula 0,0,11.0536,231600,1,0,522,934181,423,227,6399,910279,581
FORMULA StigmergyCommit-PT-04b-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Graph (trivial) has 1193 edges and 1210 vertex of which 87 / 1210 are part of one of the 15 SCC in 4 ms
Free SCC test removed 72 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 849 transitions
Trivial Post-agglo rules discarded 849 transitions
Performed 849 trivial Post agglomeration. Transition count delta: 849
Iterating post reduction 0 with 849 rules applied. Total rules applied 850 place count 1137 transition count 879
Reduce places removed 849 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 861 rules applied. Total rules applied 1711 place count 288 transition count 867
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 1719 place count 283 transition count 864
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1722 place count 280 transition count 864
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 1722 place count 280 transition count 803
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 1844 place count 219 transition count 803
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1867 place count 196 transition count 780
Iterating global reduction 4 with 23 rules applied. Total rules applied 1890 place count 196 transition count 780
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1890 place count 196 transition count 779
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1892 place count 195 transition count 779
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1903 place count 184 transition count 608
Iterating global reduction 4 with 11 rules applied. Total rules applied 1914 place count 184 transition count 608
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1918 place count 184 transition count 604
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1920 place count 182 transition count 602
Iterating global reduction 5 with 2 rules applied. Total rules applied 1922 place count 182 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1923 place count 182 transition count 601
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1924 place count 181 transition count 600
Iterating global reduction 6 with 1 rules applied. Total rules applied 1925 place count 181 transition count 600
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1985 place count 151 transition count 570
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1992 place count 151 transition count 563
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 2020 place count 123 transition count 279
Iterating global reduction 7 with 28 rules applied. Total rules applied 2048 place count 123 transition count 279
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 2058 place count 123 transition count 269
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2075 place count 106 transition count 248
Iterating global reduction 8 with 17 rules applied. Total rules applied 2092 place count 106 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2093 place count 106 transition count 247
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 2108 place count 91 transition count 228
Iterating global reduction 9 with 15 rules applied. Total rules applied 2123 place count 91 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 2131 place count 91 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2133 place count 90 transition count 219
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2134 place count 89 transition count 213
Iterating global reduction 10 with 1 rules applied. Total rules applied 2135 place count 89 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2136 place count 89 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 2141 place count 89 transition count 207
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 2151 place count 84 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2152 place count 83 transition count 201
Applied a total of 2152 rules in 186 ms. Remains 83 /1210 variables (removed 1127) and now considering 201/1811 (removed 1610) transitions.
[2025-06-04 17:22:45] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
// Phase 1: matrix 194 rows 83 cols
[2025-06-04 17:22:45] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:22:46] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-04 17:22:46] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
[2025-06-04 17:22:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:22:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 17:22:46] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:22:46] [INFO ] Redundant transitions in 15 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-04 17:22:46] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
[2025-06-04 17:22:46] [INFO ] Invariant cache hit.
[2025-06-04 17:22:46] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 5/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:48] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:49] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:49] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:49] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:49] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:49] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:49] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:49] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:49] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:50] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:50] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:50] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:50] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:50] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:51] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:51] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:51] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:51] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:52] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:52] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:52] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:53] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 193/276 variables, 83/107 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:22:57] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 1/277 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:23:04] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/277 variables, and 140 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 5/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 193/276 variables, 83/109 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 30/139 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 190/329 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/277 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:23:43] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 331 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/1210 places, 201/1811 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60905 ms. Remains : 83/1210 places, 201/1811 transitions.
[2025-06-04 17:23:46] [INFO ] Flatten gal took : 13 ms
[2025-06-04 17:23:46] [INFO ] Flatten gal took : 14 ms
[2025-06-04 17:23:46] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-04 17:23:46] [INFO ] Flatten gal took : 24 ms
[2025-06-04 17:23:46] [INFO ] Flatten gal took : 12 ms
[2025-06-04 17:23:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11935495154171320807.gal : 2 ms
[2025-06-04 17:23:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4326670176827146981.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11935495154171320807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4326670176827146981.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.03093e+06,1.63698,43152,2,5697,5,104303,6,0,522,109678,0


Converting to forward existential form...Done !
original formula: !(A((p412==0) U EF(AG((((p966==0)||(p1010==1))&&(p986==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(E(TRUE U !((((p966==0)||(p1010==1))&&(p986==1)))))))) * !((p412==0))) * !(E(TRUE U !(...309
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t10, t12, t13, t14, t18, t19, t20, t22, t23, t24, t28, t29, t30, t63, t64, t71, t...389
(forward)formula 0,1,8.08622,178160,1,0,385,794711,419,181,6178,536963,410
FORMULA StigmergyCommit-PT-04b-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1169 transition count 1770
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1169 transition count 1770
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 114 place count 1137 transition count 1738
Iterating global reduction 0 with 32 rules applied. Total rules applied 146 place count 1137 transition count 1738
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 167 place count 1116 transition count 1717
Iterating global reduction 0 with 21 rules applied. Total rules applied 188 place count 1116 transition count 1717
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 207 place count 1097 transition count 1698
Iterating global reduction 0 with 19 rules applied. Total rules applied 226 place count 1097 transition count 1698
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 241 place count 1082 transition count 1683
Iterating global reduction 0 with 15 rules applied. Total rules applied 256 place count 1082 transition count 1683
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 271 place count 1067 transition count 1668
Iterating global reduction 0 with 15 rules applied. Total rules applied 286 place count 1067 transition count 1668
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 300 place count 1053 transition count 1654
Iterating global reduction 0 with 14 rules applied. Total rules applied 314 place count 1053 transition count 1654
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 315 place count 1053 transition count 1653
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 326 place count 1042 transition count 1642
Iterating global reduction 1 with 11 rules applied. Total rules applied 337 place count 1042 transition count 1642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 338 place count 1042 transition count 1641
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 346 place count 1034 transition count 1633
Iterating global reduction 2 with 8 rules applied. Total rules applied 354 place count 1034 transition count 1633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 355 place count 1034 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 361 place count 1028 transition count 1626
Iterating global reduction 3 with 6 rules applied. Total rules applied 367 place count 1028 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 372 place count 1023 transition count 1621
Iterating global reduction 3 with 5 rules applied. Total rules applied 377 place count 1023 transition count 1621
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 378 place count 1023 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 382 place count 1019 transition count 1616
Iterating global reduction 4 with 4 rules applied. Total rules applied 386 place count 1019 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 390 place count 1015 transition count 1612
Iterating global reduction 4 with 4 rules applied. Total rules applied 394 place count 1015 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 398 place count 1011 transition count 1608
Iterating global reduction 4 with 4 rules applied. Total rules applied 402 place count 1011 transition count 1608
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 406 place count 1007 transition count 1604
Iterating global reduction 4 with 4 rules applied. Total rules applied 410 place count 1007 transition count 1604
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 414 place count 1003 transition count 1600
Iterating global reduction 4 with 4 rules applied. Total rules applied 418 place count 1003 transition count 1600
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 422 place count 999 transition count 1596
Iterating global reduction 4 with 4 rules applied. Total rules applied 426 place count 999 transition count 1596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 427 place count 999 transition count 1595
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 430 place count 996 transition count 1592
Iterating global reduction 5 with 3 rules applied. Total rules applied 433 place count 996 transition count 1592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 434 place count 996 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 436 place count 994 transition count 1589
Iterating global reduction 6 with 2 rules applied. Total rules applied 438 place count 994 transition count 1589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 439 place count 994 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 440 place count 993 transition count 1587
Iterating global reduction 7 with 1 rules applied. Total rules applied 441 place count 993 transition count 1587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 442 place count 993 transition count 1586
Applied a total of 442 rules in 978 ms. Remains 993 /1210 variables (removed 217) and now considering 1586/1811 (removed 225) transitions.
// Phase 1: matrix 1586 rows 993 cols
[2025-06-04 17:23:55] [INFO ] Computed 6 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:23:56] [INFO ] Implicit Places using invariants in 834 ms returned []
[2025-06-04 17:23:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:23:58] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
Running 1585 sub problems to find dead transitions.
[2025-06-04 17:23:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 992/2579 variables, and 0 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/993 constraints, PredecessorRefiner: 1585/1585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1585 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/2579 variables, and 0 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/993 constraints, PredecessorRefiner: 0/1585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61813ms problems are : Problem set: 0 solved, 1585 unsolved
Search for dead transitions found 0 dead transitions in 61819ms
Starting structural reductions in LTL mode, iteration 1 : 993/1210 places, 1586/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65518 ms. Remains : 993/1210 places, 1586/1811 transitions.
[2025-06-04 17:25:00] [INFO ] Flatten gal took : 78 ms
[2025-06-04 17:25:00] [INFO ] Flatten gal took : 81 ms
[2025-06-04 17:25:00] [INFO ] Input system was already deterministic with 1586 transitions.
[2025-06-04 17:25:00] [INFO ] Flatten gal took : 80 ms
[2025-06-04 17:25:00] [INFO ] Flatten gal took : 82 ms
[2025-06-04 17:25:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality5325843228728163981.gal : 25 ms
[2025-06-04 17:25:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality5574654544195826591.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5325843228728163981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5574654544195826591.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-04 17:25:31] [INFO ] Flatten gal took : 70 ms
[2025-06-04 17:25:31] [INFO ] Applying decomposition
[2025-06-04 17:25:31] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph848441511427843896.txt' '-o' '/tmp/graph848441511427843896.bin' '-w' '/tmp/graph848441511427843896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph848441511427843896.bin' '-l' '-1' '-v' '-w' '/tmp/graph848441511427843896.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:25:31] [INFO ] Decomposing Gal with order
[2025-06-04 17:25:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:25:31] [INFO ] Removed a total of 2814 redundant transitions.
[2025-06-04 17:25:31] [INFO ] Flatten gal took : 124 ms
[2025-06-04 17:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 50 ms.
[2025-06-04 17:25:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality6858112631309835001.gal : 14 ms
[2025-06-04 17:25:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15816698281089594426.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6858112631309835001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15816698281089594426.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Graph (trivial) has 1199 edges and 1210 vertex of which 87 / 1210 are part of one of the 15 SCC in 3 ms
Free SCC test removed 72 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 857 transitions
Trivial Post-agglo rules discarded 857 transitions
Performed 857 trivial Post agglomeration. Transition count delta: 857
Iterating post reduction 0 with 857 rules applied. Total rules applied 858 place count 1137 transition count 871
Reduce places removed 857 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 868 rules applied. Total rules applied 1726 place count 280 transition count 860
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1731 place count 275 transition count 860
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 1731 place count 275 transition count 799
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 1853 place count 214 transition count 799
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1877 place count 190 transition count 774
Iterating global reduction 3 with 24 rules applied. Total rules applied 1901 place count 190 transition count 774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1901 place count 190 transition count 773
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1903 place count 189 transition count 773
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1915 place count 177 transition count 600
Iterating global reduction 3 with 12 rules applied. Total rules applied 1927 place count 177 transition count 600
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1931 place count 177 transition count 596
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1934 place count 174 transition count 592
Iterating global reduction 4 with 3 rules applied. Total rules applied 1937 place count 174 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1938 place count 174 transition count 591
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1939 place count 173 transition count 590
Iterating global reduction 5 with 1 rules applied. Total rules applied 1940 place count 173 transition count 590
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 2000 place count 143 transition count 560
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2007 place count 143 transition count 553
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 2035 place count 115 transition count 269
Iterating global reduction 6 with 28 rules applied. Total rules applied 2063 place count 115 transition count 269
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2074 place count 115 transition count 258
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2091 place count 98 transition count 237
Iterating global reduction 7 with 17 rules applied. Total rules applied 2108 place count 98 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2109 place count 98 transition count 236
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 2124 place count 83 transition count 217
Iterating global reduction 8 with 15 rules applied. Total rules applied 2139 place count 83 transition count 217
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2147 place count 83 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2149 place count 82 transition count 208
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2150 place count 81 transition count 203
Iterating global reduction 9 with 1 rules applied. Total rules applied 2151 place count 81 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2152 place count 81 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2157 place count 81 transition count 197
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 2167 place count 76 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2168 place count 75 transition count 191
Applied a total of 2168 rules in 103 ms. Remains 75 /1210 variables (removed 1135) and now considering 191/1811 (removed 1620) transitions.
[2025-06-04 17:26:01] [INFO ] Flow matrix only has 185 transitions (discarded 6 similar events)
// Phase 1: matrix 185 rows 75 cols
[2025-06-04 17:26:01] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:26:01] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-04 17:26:01] [INFO ] Flow matrix only has 185 transitions (discarded 6 similar events)
[2025-06-04 17:26:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:26:02] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 17:26:02] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:26:02] [INFO ] Redundant transitions in 2 ms returned []
Running 180 sub problems to find dead transitions.
[2025-06-04 17:26:02] [INFO ] Flow matrix only has 185 transitions (discarded 6 similar events)
[2025-06-04 17:26:02] [INFO ] Invariant cache hit.
[2025-06-04 17:26:02] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 5/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:04] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:04] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:04] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:04] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:04] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:04] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:04] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:05] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:05] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:05] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:05] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:05] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:05] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:06] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:06] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:06] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:06] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 184/259 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 30/124 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 1/260 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:13] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:14] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:14] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 128 constraints, problems are : Problem set: 0 solved, 180 unsolved in 21488 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 5/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 184/259 variables, 75/97 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 180/307 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:29] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:29] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:32] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:35] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:26:38] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 1/260 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 260/260 variables, and 313 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51579ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 51581ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/1210 places, 191/1811 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52001 ms. Remains : 75/1210 places, 191/1811 transitions.
[2025-06-04 17:26:53] [INFO ] Flatten gal took : 13 ms
[2025-06-04 17:26:53] [INFO ] Flatten gal took : 13 ms
[2025-06-04 17:26:53] [INFO ] Input system was already deterministic with 191 transitions.
[2025-06-04 17:26:53] [INFO ] Flatten gal took : 13 ms
[2025-06-04 17:26:53] [INFO ] Flatten gal took : 13 ms
[2025-06-04 17:26:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality6405681723092760498.gal : 2 ms
[2025-06-04 17:26:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16123425014604870210.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6405681723092760498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16123425014604870210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,712494,1.10707,27880,2,7064,5,78161,6,0,481,64296,0


Converting to forward existential form...Done !
original formula: AF(AG((p161==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p161==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t9, t11, t12, t13, t15, t16, t17, t19, t20, t21, t24, t26, t27, t56, t57, t64, t7...382
(forward)formula 0,0,9.04304,202276,1,0,380,890388,401,175,6164,680758,415
FORMULA StigmergyCommit-PT-04b-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1176 transition count 1777
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1176 transition count 1777
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 93 place count 1151 transition count 1752
Iterating global reduction 0 with 25 rules applied. Total rules applied 118 place count 1151 transition count 1752
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 133 place count 1136 transition count 1737
Iterating global reduction 0 with 15 rules applied. Total rules applied 148 place count 1136 transition count 1737
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 162 place count 1122 transition count 1723
Iterating global reduction 0 with 14 rules applied. Total rules applied 176 place count 1122 transition count 1723
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 187 place count 1111 transition count 1712
Iterating global reduction 0 with 11 rules applied. Total rules applied 198 place count 1111 transition count 1712
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 208 place count 1101 transition count 1702
Iterating global reduction 0 with 10 rules applied. Total rules applied 218 place count 1101 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 227 place count 1092 transition count 1693
Iterating global reduction 0 with 9 rules applied. Total rules applied 236 place count 1092 transition count 1693
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 243 place count 1085 transition count 1686
Iterating global reduction 0 with 7 rules applied. Total rules applied 250 place count 1085 transition count 1686
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 256 place count 1079 transition count 1680
Iterating global reduction 0 with 6 rules applied. Total rules applied 262 place count 1079 transition count 1680
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 265 place count 1076 transition count 1677
Iterating global reduction 0 with 3 rules applied. Total rules applied 268 place count 1076 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 270 place count 1074 transition count 1675
Iterating global reduction 0 with 2 rules applied. Total rules applied 272 place count 1074 transition count 1675
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 274 place count 1072 transition count 1673
Iterating global reduction 0 with 2 rules applied. Total rules applied 276 place count 1072 transition count 1673
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 278 place count 1070 transition count 1671
Iterating global reduction 0 with 2 rules applied. Total rules applied 280 place count 1070 transition count 1671
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 282 place count 1068 transition count 1669
Iterating global reduction 0 with 2 rules applied. Total rules applied 284 place count 1068 transition count 1669
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 286 place count 1066 transition count 1667
Iterating global reduction 0 with 2 rules applied. Total rules applied 288 place count 1066 transition count 1667
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 290 place count 1064 transition count 1665
Iterating global reduction 0 with 2 rules applied. Total rules applied 292 place count 1064 transition count 1665
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 294 place count 1062 transition count 1663
Iterating global reduction 0 with 2 rules applied. Total rules applied 296 place count 1062 transition count 1663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 297 place count 1062 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 1061 transition count 1661
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 1061 transition count 1661
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 300 place count 1061 transition count 1660
Applied a total of 300 rules in 1109 ms. Remains 1061 /1210 variables (removed 149) and now considering 1660/1811 (removed 151) transitions.
// Phase 1: matrix 1660 rows 1061 cols
[2025-06-04 17:27:04] [INFO ] Computed 6 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:27:05] [INFO ] Implicit Places using invariants in 1383 ms returned []
[2025-06-04 17:27:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:27:07] [INFO ] Implicit Places using invariants and state equation in 2410 ms returned []
Implicit Place search using SMT with State Equation took 3803 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2025-06-04 17:27:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)timeout

(s152 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1060/2721 variables, and 0 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 1659/1659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/2721 variables, and 0 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 0/1659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62107ms problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 62113ms
Starting structural reductions in LTL mode, iteration 1 : 1061/1210 places, 1660/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67032 ms. Remains : 1061/1210 places, 1660/1811 transitions.
[2025-06-04 17:28:10] [INFO ] Flatten gal took : 76 ms
[2025-06-04 17:28:10] [INFO ] Flatten gal took : 80 ms
[2025-06-04 17:28:10] [INFO ] Input system was already deterministic with 1660 transitions.
[2025-06-04 17:28:10] [INFO ] Flatten gal took : 48 ms
[2025-06-04 17:28:10] [INFO ] Flatten gal took : 49 ms
[2025-06-04 17:28:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality10705308283379381880.gal : 11 ms
[2025-06-04 17:28:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality10466102586449036974.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10705308283379381880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10466102586449036974.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-04 17:28:40] [INFO ] Flatten gal took : 77 ms
[2025-06-04 17:28:40] [INFO ] Applying decomposition
[2025-06-04 17:28:40] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8959673905705008640.txt' '-o' '/tmp/graph8959673905705008640.bin' '-w' '/tmp/graph8959673905705008640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8959673905705008640.bin' '-l' '-1' '-v' '-w' '/tmp/graph8959673905705008640.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:28:40] [INFO ] Decomposing Gal with order
[2025-06-04 17:28:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:28:41] [INFO ] Removed a total of 2824 redundant transitions.
[2025-06-04 17:28:41] [INFO ] Flatten gal took : 177 ms
[2025-06-04 17:28:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 18 ms.
[2025-06-04 17:28:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality597246385726073236.gal : 18 ms
[2025-06-04 17:28:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality1156209755655380143.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality597246385726073236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1156209755655380143.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Graph (trivial) has 1187 edges and 1210 vertex of which 85 / 1210 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 845 transitions
Trivial Post-agglo rules discarded 845 transitions
Performed 845 trivial Post agglomeration. Transition count delta: 845
Iterating post reduction 0 with 845 rules applied. Total rules applied 846 place count 1139 transition count 886
Reduce places removed 845 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 857 rules applied. Total rules applied 1703 place count 294 transition count 874
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 1711 place count 289 transition count 871
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1714 place count 286 transition count 871
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 1714 place count 286 transition count 809
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 1838 place count 224 transition count 809
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 1860 place count 202 transition count 786
Iterating global reduction 4 with 22 rules applied. Total rules applied 1882 place count 202 transition count 786
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1882 place count 202 transition count 785
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1884 place count 201 transition count 785
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1895 place count 190 transition count 613
Iterating global reduction 4 with 11 rules applied. Total rules applied 1906 place count 190 transition count 613
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1910 place count 190 transition count 609
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1913 place count 187 transition count 605
Iterating global reduction 5 with 3 rules applied. Total rules applied 1916 place count 187 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1917 place count 187 transition count 604
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1918 place count 186 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 1919 place count 186 transition count 603
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 1981 place count 155 transition count 572
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1988 place count 155 transition count 565
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 2012 place count 131 transition count 287
Iterating global reduction 7 with 24 rules applied. Total rules applied 2036 place count 131 transition count 287
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 2046 place count 131 transition count 277
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 2060 place count 117 transition count 261
Iterating global reduction 8 with 14 rules applied. Total rules applied 2074 place count 117 transition count 261
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 2086 place count 105 transition count 247
Iterating global reduction 8 with 12 rules applied. Total rules applied 2098 place count 105 transition count 247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 2105 place count 105 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2107 place count 104 transition count 239
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2108 place count 103 transition count 232
Iterating global reduction 9 with 1 rules applied. Total rules applied 2109 place count 103 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2110 place count 103 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2116 place count 103 transition count 225
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 2128 place count 97 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2129 place count 96 transition count 218
Applied a total of 2129 rules in 97 ms. Remains 96 /1210 variables (removed 1114) and now considering 218/1811 (removed 1593) transitions.
[2025-06-04 17:29:11] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 96 cols
[2025-06-04 17:29:11] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:29:11] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-06-04 17:29:11] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2025-06-04 17:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:29:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 17:29:11] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:29:11] [INFO ] Redundant transitions in 3 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-04 17:29:11] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2025-06-04 17:29:11] [INFO ] Invariant cache hit.
[2025-06-04 17:29:11] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 5/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:14] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:14] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:15] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:15] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:15] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:15] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:15] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:15] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:15] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:16] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:16] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:16] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:16] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:16] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:16] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:17] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:17] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:17] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:17] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:17] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:18] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:18] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:19] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:19] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:19] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:19] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:20] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:20] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:20] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 209/305 variables, 96/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 30/157 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:25] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (OVERLAPS) 1/306 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/306 variables, and 159 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 5/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:43] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:43] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:45] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 209/305 variables, 96/131 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 30/161 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 206/367 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:52] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:54] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:29:59] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/306 variables, and 370 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/1210 places, 218/1811 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60661 ms. Remains : 96/1210 places, 218/1811 transitions.
[2025-06-04 17:30:12] [INFO ] Flatten gal took : 13 ms
[2025-06-04 17:30:12] [INFO ] Flatten gal took : 16 ms
[2025-06-04 17:30:12] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-04 17:30:12] [INFO ] Flatten gal took : 16 ms
[2025-06-04 17:30:12] [INFO ] Flatten gal took : 14 ms
[2025-06-04 17:30:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6284927808025188555.gal : 2 ms
[2025-06-04 17:30:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality17391819981618832679.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6284927808025188555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17391819981618832679.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.509e+06,1.98284,43508,2,9627,5,122431,6,0,590,106810,0


Converting to forward existential form...Done !
original formula: EF(EG((AF(EG(((p402==0)&&(p147==1)))) + E((AF((p82==1)) + A((p343==1) U (p592==1))) U EG(((p1399==0)||(p1216==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!(EG(((p402==0)&&(p147==1)))))) + E((!(EG(!((p82==1)))) + !((E(!((p592==1)) U (!((p3...245
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t29, t30, t32, t33, t42, t70, t...412
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-04 17:30:42] [INFO ] Flatten gal took : 8 ms
[2025-06-04 17:30:42] [INFO ] Applying decomposition
[2025-06-04 17:30:42] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1388621582579854234.txt' '-o' '/tmp/graph1388621582579854234.bin' '-w' '/tmp/graph1388621582579854234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1388621582579854234.bin' '-l' '-1' '-v' '-w' '/tmp/graph1388621582579854234.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:30:42] [INFO ] Decomposing Gal with order
[2025-06-04 17:30:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:30:42] [INFO ] Removed a total of 397 redundant transitions.
[2025-06-04 17:30:42] [INFO ] Flatten gal took : 17 ms
[2025-06-04 17:30:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 5 ms.
[2025-06-04 17:30:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality10176687383971983110.gal : 2 ms
[2025-06-04 17:30:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12416220677218707690.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10176687383971983110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12416220677218707690.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.509e+06,1.33595,37908,990,690,25167,15082,531,97276,164,358840,0


Converting to forward existential form...Done !
original formula: EF(EG((AF(EG(((i2.i0.u8.p402==0)&&(i0.i0.u3.p147==1)))) + E((AF((i0.i0.u2.p82==1)) + A((i2.i0.u7.p343==1) U (i2.i1.u11.p592==1))) U EG(((...202
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!(EG(((i2.i0.u8.p402==0)&&(i0.i0.u3.p147==1)))))) + E((!(EG(!((i0.i0.u2.p82==1)))) +...331
Reverse transition relation is NOT exact ! Due to transitions t135, t190, t206, t207, t208, t209, t210, u13.t134, i0.t126, i0.i0.t32, i0.i0.t128, i0.i0.u1....612
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,22.3438,478196,1,0,514273,95612,3239,1.3797e+06,979,3.0445e+06,946181
FORMULA StigmergyCommit-PT-04b-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1169 transition count 1770
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1169 transition count 1770
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 113 place count 1138 transition count 1739
Iterating global reduction 0 with 31 rules applied. Total rules applied 144 place count 1138 transition count 1739
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 1117 transition count 1718
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 1117 transition count 1718
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 206 place count 1097 transition count 1698
Iterating global reduction 0 with 20 rules applied. Total rules applied 226 place count 1097 transition count 1698
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 242 place count 1081 transition count 1682
Iterating global reduction 0 with 16 rules applied. Total rules applied 258 place count 1081 transition count 1682
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 274 place count 1065 transition count 1666
Iterating global reduction 0 with 16 rules applied. Total rules applied 290 place count 1065 transition count 1666
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 305 place count 1050 transition count 1651
Iterating global reduction 0 with 15 rules applied. Total rules applied 320 place count 1050 transition count 1651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 321 place count 1050 transition count 1650
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 333 place count 1038 transition count 1638
Iterating global reduction 1 with 12 rules applied. Total rules applied 345 place count 1038 transition count 1638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 346 place count 1038 transition count 1637
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 355 place count 1029 transition count 1628
Iterating global reduction 2 with 9 rules applied. Total rules applied 364 place count 1029 transition count 1628
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 366 place count 1029 transition count 1626
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 372 place count 1023 transition count 1620
Iterating global reduction 3 with 6 rules applied. Total rules applied 378 place count 1023 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 383 place count 1018 transition count 1615
Iterating global reduction 3 with 5 rules applied. Total rules applied 388 place count 1018 transition count 1615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 389 place count 1018 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 393 place count 1014 transition count 1610
Iterating global reduction 4 with 4 rules applied. Total rules applied 397 place count 1014 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 400 place count 1011 transition count 1607
Iterating global reduction 4 with 3 rules applied. Total rules applied 403 place count 1011 transition count 1607
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 406 place count 1008 transition count 1604
Iterating global reduction 4 with 3 rules applied. Total rules applied 409 place count 1008 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 412 place count 1005 transition count 1601
Iterating global reduction 4 with 3 rules applied. Total rules applied 415 place count 1005 transition count 1601
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 418 place count 1002 transition count 1598
Iterating global reduction 4 with 3 rules applied. Total rules applied 421 place count 1002 transition count 1598
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 424 place count 999 transition count 1595
Iterating global reduction 4 with 3 rules applied. Total rules applied 427 place count 999 transition count 1595
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 430 place count 996 transition count 1592
Iterating global reduction 4 with 3 rules applied. Total rules applied 433 place count 996 transition count 1592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 434 place count 996 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 436 place count 994 transition count 1589
Iterating global reduction 5 with 2 rules applied. Total rules applied 438 place count 994 transition count 1589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 439 place count 994 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 440 place count 993 transition count 1587
Iterating global reduction 6 with 1 rules applied. Total rules applied 441 place count 993 transition count 1587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 442 place count 993 transition count 1586
Applied a total of 442 rules in 1174 ms. Remains 993 /1210 variables (removed 217) and now considering 1586/1811 (removed 225) transitions.
// Phase 1: matrix 1586 rows 993 cols
[2025-06-04 17:31:05] [INFO ] Computed 6 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:31:06] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2025-06-04 17:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:31:09] [INFO ] Implicit Places using invariants and state equation in 2186 ms returned []
Implicit Place search using SMT with State Equation took 3261 ms to find 0 implicit places.
Running 1585 sub problems to find dead transitions.
[2025-06-04 17:31:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 992/2579 variables, and 0 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/993 constraints, PredecessorRefiner: 1585/1585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1585 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/2579 variables, and 0 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/993 constraints, PredecessorRefiner: 0/1585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61910ms problems are : Problem set: 0 solved, 1585 unsolved
Search for dead transitions found 0 dead transitions in 61915ms
Starting structural reductions in LTL mode, iteration 1 : 993/1210 places, 1586/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66358 ms. Remains : 993/1210 places, 1586/1811 transitions.
[2025-06-04 17:32:11] [INFO ] Flatten gal took : 66 ms
[2025-06-04 17:32:11] [INFO ] Flatten gal took : 71 ms
[2025-06-04 17:32:11] [INFO ] Input system was already deterministic with 1586 transitions.
[2025-06-04 17:32:11] [INFO ] Flatten gal took : 117 ms
[2025-06-04 17:32:11] [INFO ] Flatten gal took : 69 ms
[2025-06-04 17:32:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality12323910565981730577.gal : 15 ms
[2025-06-04 17:32:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17083712462322909865.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12323910565981730577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17083712462322909865.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-04 17:32:41] [INFO ] Flatten gal took : 41 ms
[2025-06-04 17:32:41] [INFO ] Applying decomposition
[2025-06-04 17:32:41] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4425758359750538895.txt' '-o' '/tmp/graph4425758359750538895.bin' '-w' '/tmp/graph4425758359750538895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4425758359750538895.bin' '-l' '-1' '-v' '-w' '/tmp/graph4425758359750538895.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:32:41] [INFO ] Decomposing Gal with order
[2025-06-04 17:32:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:32:41] [INFO ] Removed a total of 2816 redundant transitions.
[2025-06-04 17:32:42] [INFO ] Flatten gal took : 93 ms
[2025-06-04 17:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2025-06-04 17:32:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2156971958535811104.gal : 13 ms
[2025-06-04 17:32:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5317243885468170602.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2156971958535811104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5317243885468170602.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1171 transition count 1772
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1171 transition count 1772
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 110 place count 1139 transition count 1740
Iterating global reduction 0 with 32 rules applied. Total rules applied 142 place count 1139 transition count 1740
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 163 place count 1118 transition count 1719
Iterating global reduction 0 with 21 rules applied. Total rules applied 184 place count 1118 transition count 1719
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 203 place count 1099 transition count 1700
Iterating global reduction 0 with 19 rules applied. Total rules applied 222 place count 1099 transition count 1700
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 238 place count 1083 transition count 1684
Iterating global reduction 0 with 16 rules applied. Total rules applied 254 place count 1083 transition count 1684
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 270 place count 1067 transition count 1668
Iterating global reduction 0 with 16 rules applied. Total rules applied 286 place count 1067 transition count 1668
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 301 place count 1052 transition count 1653
Iterating global reduction 0 with 15 rules applied. Total rules applied 316 place count 1052 transition count 1653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 317 place count 1052 transition count 1652
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 329 place count 1040 transition count 1640
Iterating global reduction 1 with 12 rules applied. Total rules applied 341 place count 1040 transition count 1640
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 342 place count 1040 transition count 1639
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 351 place count 1031 transition count 1630
Iterating global reduction 2 with 9 rules applied. Total rules applied 360 place count 1031 transition count 1630
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 362 place count 1031 transition count 1628
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 368 place count 1025 transition count 1622
Iterating global reduction 3 with 6 rules applied. Total rules applied 374 place count 1025 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 379 place count 1020 transition count 1617
Iterating global reduction 3 with 5 rules applied. Total rules applied 384 place count 1020 transition count 1617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 1020 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 389 place count 1016 transition count 1612
Iterating global reduction 4 with 4 rules applied. Total rules applied 393 place count 1016 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 396 place count 1013 transition count 1609
Iterating global reduction 4 with 3 rules applied. Total rules applied 399 place count 1013 transition count 1609
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 402 place count 1010 transition count 1606
Iterating global reduction 4 with 3 rules applied. Total rules applied 405 place count 1010 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 408 place count 1007 transition count 1603
Iterating global reduction 4 with 3 rules applied. Total rules applied 411 place count 1007 transition count 1603
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 414 place count 1004 transition count 1600
Iterating global reduction 4 with 3 rules applied. Total rules applied 417 place count 1004 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 420 place count 1001 transition count 1597
Iterating global reduction 4 with 3 rules applied. Total rules applied 423 place count 1001 transition count 1597
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 426 place count 998 transition count 1594
Iterating global reduction 4 with 3 rules applied. Total rules applied 429 place count 998 transition count 1594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 430 place count 998 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 432 place count 996 transition count 1591
Iterating global reduction 5 with 2 rules applied. Total rules applied 434 place count 996 transition count 1591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 435 place count 996 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 436 place count 995 transition count 1589
Iterating global reduction 6 with 1 rules applied. Total rules applied 437 place count 995 transition count 1589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 438 place count 995 transition count 1588
Applied a total of 438 rules in 1258 ms. Remains 995 /1210 variables (removed 215) and now considering 1588/1811 (removed 223) transitions.
// Phase 1: matrix 1588 rows 995 cols
[2025-06-04 17:33:13] [INFO ] Computed 6 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:33:14] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2025-06-04 17:33:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:33:16] [INFO ] Implicit Places using invariants and state equation in 2255 ms returned []
Implicit Place search using SMT with State Equation took 3305 ms to find 0 implicit places.
Running 1587 sub problems to find dead transitions.
[2025-06-04 17:33:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s739 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 994/2583 variables, and 0 constraints, problems are : Problem set: 0 solved, 1587 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/995 constraints, PredecessorRefiner: 1587/1587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1587 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 994/2583 variables, and 0 constraints, problems are : Problem set: 0 solved, 1587 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/995 constraints, PredecessorRefiner: 0/1587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61772ms problems are : Problem set: 0 solved, 1587 unsolved
Search for dead transitions found 0 dead transitions in 61779ms
Starting structural reductions in LTL mode, iteration 1 : 995/1210 places, 1588/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66350 ms. Remains : 995/1210 places, 1588/1811 transitions.
[2025-06-04 17:34:18] [INFO ] Flatten gal took : 66 ms
[2025-06-04 17:34:18] [INFO ] Flatten gal took : 71 ms
[2025-06-04 17:34:18] [INFO ] Input system was already deterministic with 1588 transitions.
[2025-06-04 17:34:18] [INFO ] Flatten gal took : 71 ms
[2025-06-04 17:34:18] [INFO ] Flatten gal took : 71 ms
[2025-06-04 17:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality9597210690444922357.gal : 10 ms
[2025-06-04 17:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3295034660045231035.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9597210690444922357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3295034660045231035.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-04 17:34:49] [INFO ] Flatten gal took : 72 ms
[2025-06-04 17:34:49] [INFO ] Applying decomposition
[2025-06-04 17:34:49] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15042215121478514611.txt' '-o' '/tmp/graph15042215121478514611.bin' '-w' '/tmp/graph15042215121478514611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15042215121478514611.bin' '-l' '-1' '-v' '-w' '/tmp/graph15042215121478514611.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:34:49] [INFO ] Decomposing Gal with order
[2025-06-04 17:34:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:34:49] [INFO ] Removed a total of 2812 redundant transitions.
[2025-06-04 17:34:49] [INFO ] Flatten gal took : 124 ms
[2025-06-04 17:34:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2025-06-04 17:34:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality10104442152797489601.gal : 16 ms
[2025-06-04 17:34:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality12024988694320914489.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10104442152797489601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12024988694320914489.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Graph (trivial) has 1197 edges and 1210 vertex of which 87 / 1210 are part of one of the 15 SCC in 4 ms
Free SCC test removed 72 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 853 transitions
Trivial Post-agglo rules discarded 853 transitions
Performed 853 trivial Post agglomeration. Transition count delta: 853
Iterating post reduction 0 with 853 rules applied. Total rules applied 854 place count 1137 transition count 875
Reduce places removed 853 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 865 rules applied. Total rules applied 1719 place count 284 transition count 863
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1726 place count 279 transition count 861
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1728 place count 277 transition count 861
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 1728 place count 277 transition count 800
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 1850 place count 216 transition count 800
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1874 place count 192 transition count 775
Iterating global reduction 4 with 24 rules applied. Total rules applied 1898 place count 192 transition count 775
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1898 place count 192 transition count 774
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1900 place count 191 transition count 774
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1912 place count 179 transition count 601
Iterating global reduction 4 with 12 rules applied. Total rules applied 1924 place count 179 transition count 601
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1928 place count 179 transition count 597
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1931 place count 176 transition count 593
Iterating global reduction 5 with 3 rules applied. Total rules applied 1934 place count 176 transition count 593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1935 place count 176 transition count 592
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1936 place count 175 transition count 591
Iterating global reduction 6 with 1 rules applied. Total rules applied 1937 place count 175 transition count 591
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1997 place count 145 transition count 561
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2004 place count 145 transition count 554
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 2032 place count 117 transition count 270
Iterating global reduction 7 with 28 rules applied. Total rules applied 2060 place count 117 transition count 270
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 2070 place count 117 transition count 260
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2087 place count 100 transition count 239
Iterating global reduction 8 with 17 rules applied. Total rules applied 2104 place count 100 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2105 place count 100 transition count 238
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 2120 place count 85 transition count 219
Iterating global reduction 9 with 15 rules applied. Total rules applied 2135 place count 85 transition count 219
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 2143 place count 85 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2145 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2146 place count 83 transition count 205
Iterating global reduction 10 with 1 rules applied. Total rules applied 2147 place count 83 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2148 place count 83 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 2153 place count 83 transition count 199
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 2163 place count 78 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2164 place count 77 transition count 193
Applied a total of 2164 rules in 115 ms. Remains 77 /1210 variables (removed 1133) and now considering 193/1811 (removed 1618) transitions.
[2025-06-04 17:35:19] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
// Phase 1: matrix 187 rows 77 cols
[2025-06-04 17:35:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:35:19] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-04 17:35:19] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
[2025-06-04 17:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:35:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 17:35:20] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:35:20] [INFO ] Redundant transitions in 2 ms returned []
Running 182 sub problems to find dead transitions.
[2025-06-04 17:35:20] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
[2025-06-04 17:35:20] [INFO ] Invariant cache hit.
[2025-06-04 17:35:20] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 5/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:22] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:22] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:22] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:22] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:22] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:22] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:22] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:23] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:23] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:23] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:23] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:23] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:24] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:24] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:24] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:25] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:25] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:26] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:26] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 186/263 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 1/264 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:34] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:34] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:35] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 132 constraints, problems are : Problem set: 0 solved, 182 unsolved in 26841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 5/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 186/263 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 30/131 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 182/313 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:54] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:35:58] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:36:02] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 182 unsolved
SMT process timed out in 56989ms, After SMT, problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 56990ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/1210 places, 193/1811 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57451 ms. Remains : 77/1210 places, 193/1811 transitions.
[2025-06-04 17:36:17] [INFO ] Flatten gal took : 7 ms
[2025-06-04 17:36:17] [INFO ] Flatten gal took : 7 ms
[2025-06-04 17:36:17] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-04 17:36:17] [INFO ] Flatten gal took : 8 ms
[2025-06-04 17:36:17] [INFO ] Flatten gal took : 8 ms
[2025-06-04 17:36:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality11425327970095721924.gal : 2 ms
[2025-06-04 17:36:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality6183950637588227593.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11425327970095721924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6183950637588227593.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,845350,1.5047,39716,2,5514,5,98119,6,0,491,104390,0


Converting to forward existential form...Done !
original formula: EG(((p642==0)||(p657==1)))
=> equivalent forward existential formula: [FwdG(Init,((p642==0)||(p657==1)))] != FALSE
Hit Full ! (commute/partial/dont) 189/0/4
(forward)formula 0,1,9.09668,181324,1,0,35,630468,19,4,4181,690174,32
FORMULA StigmergyCommit-PT-04b-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1172 transition count 1773
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1172 transition count 1773
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 106 place count 1142 transition count 1743
Iterating global reduction 0 with 30 rules applied. Total rules applied 136 place count 1142 transition count 1743
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 157 place count 1121 transition count 1722
Iterating global reduction 0 with 21 rules applied. Total rules applied 178 place count 1121 transition count 1722
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 197 place count 1102 transition count 1703
Iterating global reduction 0 with 19 rules applied. Total rules applied 216 place count 1102 transition count 1703
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 231 place count 1087 transition count 1688
Iterating global reduction 0 with 15 rules applied. Total rules applied 246 place count 1087 transition count 1688
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 261 place count 1072 transition count 1673
Iterating global reduction 0 with 15 rules applied. Total rules applied 276 place count 1072 transition count 1673
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 289 place count 1059 transition count 1660
Iterating global reduction 0 with 13 rules applied. Total rules applied 302 place count 1059 transition count 1660
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 303 place count 1059 transition count 1659
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 313 place count 1049 transition count 1649
Iterating global reduction 1 with 10 rules applied. Total rules applied 323 place count 1049 transition count 1649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 324 place count 1049 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 329 place count 1044 transition count 1643
Iterating global reduction 2 with 5 rules applied. Total rules applied 334 place count 1044 transition count 1643
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 335 place count 1044 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 336 place count 1043 transition count 1641
Iterating global reduction 3 with 1 rules applied. Total rules applied 337 place count 1043 transition count 1641
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 338 place count 1042 transition count 1640
Iterating global reduction 3 with 1 rules applied. Total rules applied 339 place count 1042 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 340 place count 1041 transition count 1639
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 1041 transition count 1639
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 342 place count 1040 transition count 1638
Iterating global reduction 3 with 1 rules applied. Total rules applied 343 place count 1040 transition count 1638
Applied a total of 343 rules in 671 ms. Remains 1040 /1210 variables (removed 170) and now considering 1638/1811 (removed 173) transitions.
// Phase 1: matrix 1638 rows 1040 cols
[2025-06-04 17:36:27] [INFO ] Computed 6 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:36:28] [INFO ] Implicit Places using invariants in 935 ms returned []
[2025-06-04 17:36:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:36:30] [INFO ] Implicit Places using invariants and state equation in 2194 ms returned []
Implicit Place search using SMT with State Equation took 3137 ms to find 0 implicit places.
Running 1637 sub problems to find dead transitions.
[2025-06-04 17:36:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1039/2678 variables, and 0 constraints, problems are : Problem set: 0 solved, 1637 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1040 constraints, PredecessorRefiner: 1637/1637 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1637 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1039/2678 variables, and 0 constraints, problems are : Problem set: 0 solved, 1637 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1040 constraints, PredecessorRefiner: 0/1637 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61793ms problems are : Problem set: 0 solved, 1637 unsolved
Search for dead transitions found 0 dead transitions in 61798ms
Starting structural reductions in LTL mode, iteration 1 : 1040/1210 places, 1638/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65613 ms. Remains : 1040/1210 places, 1638/1811 transitions.
[2025-06-04 17:37:32] [INFO ] Flatten gal took : 66 ms
[2025-06-04 17:37:32] [INFO ] Flatten gal took : 71 ms
[2025-06-04 17:37:32] [INFO ] Input system was already deterministic with 1638 transitions.
[2025-06-04 17:37:32] [INFO ] Flatten gal took : 71 ms
[2025-06-04 17:37:32] [INFO ] Flatten gal took : 71 ms
[2025-06-04 17:37:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality7968554871937109153.gal : 15 ms
[2025-06-04 17:37:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality15271149584407766488.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7968554871937109153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15271149584407766488.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-04 17:38:02] [INFO ] Flatten gal took : 41 ms
[2025-06-04 17:38:02] [INFO ] Applying decomposition
[2025-06-04 17:38:02] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12628988986981972107.txt' '-o' '/tmp/graph12628988986981972107.bin' '-w' '/tmp/graph12628988986981972107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12628988986981972107.bin' '-l' '-1' '-v' '-w' '/tmp/graph12628988986981972107.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:38:02] [INFO ] Decomposing Gal with order
[2025-06-04 17:38:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:38:02] [INFO ] Removed a total of 2827 redundant transitions.
[2025-06-04 17:38:02] [INFO ] Flatten gal took : 85 ms
[2025-06-04 17:38:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 25 ms.
[2025-06-04 17:38:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality9617913486853157372.gal : 16 ms
[2025-06-04 17:38:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1454735752322469910.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9617913486853157372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1454735752322469910.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1169 transition count 1770
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1169 transition count 1770
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 114 place count 1137 transition count 1738
Iterating global reduction 0 with 32 rules applied. Total rules applied 146 place count 1137 transition count 1738
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 168 place count 1115 transition count 1716
Iterating global reduction 0 with 22 rules applied. Total rules applied 190 place count 1115 transition count 1716
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 210 place count 1095 transition count 1696
Iterating global reduction 0 with 20 rules applied. Total rules applied 230 place count 1095 transition count 1696
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 246 place count 1079 transition count 1680
Iterating global reduction 0 with 16 rules applied. Total rules applied 262 place count 1079 transition count 1680
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 278 place count 1063 transition count 1664
Iterating global reduction 0 with 16 rules applied. Total rules applied 294 place count 1063 transition count 1664
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 309 place count 1048 transition count 1649
Iterating global reduction 0 with 15 rules applied. Total rules applied 324 place count 1048 transition count 1649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 325 place count 1048 transition count 1648
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 337 place count 1036 transition count 1636
Iterating global reduction 1 with 12 rules applied. Total rules applied 349 place count 1036 transition count 1636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 350 place count 1036 transition count 1635
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 359 place count 1027 transition count 1626
Iterating global reduction 2 with 9 rules applied. Total rules applied 368 place count 1027 transition count 1626
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 370 place count 1027 transition count 1624
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 376 place count 1021 transition count 1618
Iterating global reduction 3 with 6 rules applied. Total rules applied 382 place count 1021 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 387 place count 1016 transition count 1613
Iterating global reduction 3 with 5 rules applied. Total rules applied 392 place count 1016 transition count 1613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 1016 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 397 place count 1012 transition count 1608
Iterating global reduction 4 with 4 rules applied. Total rules applied 401 place count 1012 transition count 1608
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 405 place count 1008 transition count 1604
Iterating global reduction 4 with 4 rules applied. Total rules applied 409 place count 1008 transition count 1604
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 413 place count 1004 transition count 1600
Iterating global reduction 4 with 4 rules applied. Total rules applied 417 place count 1004 transition count 1600
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 421 place count 1000 transition count 1596
Iterating global reduction 4 with 4 rules applied. Total rules applied 425 place count 1000 transition count 1596
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 429 place count 996 transition count 1592
Iterating global reduction 4 with 4 rules applied. Total rules applied 433 place count 996 transition count 1592
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 437 place count 992 transition count 1588
Iterating global reduction 4 with 4 rules applied. Total rules applied 441 place count 992 transition count 1588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 442 place count 992 transition count 1587
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 445 place count 989 transition count 1584
Iterating global reduction 5 with 3 rules applied. Total rules applied 448 place count 989 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 449 place count 989 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 451 place count 987 transition count 1581
Iterating global reduction 6 with 2 rules applied. Total rules applied 453 place count 987 transition count 1581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 454 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 455 place count 986 transition count 1579
Iterating global reduction 7 with 1 rules applied. Total rules applied 456 place count 986 transition count 1579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 457 place count 986 transition count 1578
Applied a total of 457 rules in 1141 ms. Remains 986 /1210 variables (removed 224) and now considering 1578/1811 (removed 233) transitions.
// Phase 1: matrix 1578 rows 986 cols
[2025-06-04 17:38:34] [INFO ] Computed 6 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:38:34] [INFO ] Implicit Places using invariants in 710 ms returned []
[2025-06-04 17:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:38:36] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2621 ms to find 0 implicit places.
Running 1577 sub problems to find dead transitions.
[2025-06-04 17:38:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/2564 variables, and 0 constraints, problems are : Problem set: 0 solved, 1577 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 1577/1577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/2564 variables, and 0 constraints, problems are : Problem set: 0 solved, 1577 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 0/1577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61937ms problems are : Problem set: 0 solved, 1577 unsolved
Search for dead transitions found 0 dead transitions in 61943ms
Starting structural reductions in LTL mode, iteration 1 : 986/1210 places, 1578/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65712 ms. Remains : 986/1210 places, 1578/1811 transitions.
[2025-06-04 17:39:38] [INFO ] Flatten gal took : 66 ms
[2025-06-04 17:39:38] [INFO ] Flatten gal took : 69 ms
[2025-06-04 17:39:39] [INFO ] Input system was already deterministic with 1578 transitions.
[2025-06-04 17:39:39] [INFO ] Flatten gal took : 68 ms
[2025-06-04 17:39:39] [INFO ] Flatten gal took : 68 ms
[2025-06-04 17:39:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality8919014247137855870.gal : 14 ms
[2025-06-04 17:39:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality11961154217151548391.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8919014247137855870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11961154217151548391.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-04 17:40:09] [INFO ] Flatten gal took : 40 ms
[2025-06-04 17:40:09] [INFO ] Applying decomposition
[2025-06-04 17:40:09] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13258216914725186102.txt' '-o' '/tmp/graph13258216914725186102.bin' '-w' '/tmp/graph13258216914725186102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13258216914725186102.bin' '-l' '-1' '-v' '-w' '/tmp/graph13258216914725186102.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:40:09] [INFO ] Decomposing Gal with order
[2025-06-04 17:40:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:40:09] [INFO ] Removed a total of 2813 redundant transitions.
[2025-06-04 17:40:09] [INFO ] Flatten gal took : 84 ms
[2025-06-04 17:40:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2025-06-04 17:40:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality14703050975782110194.gal : 12 ms
[2025-06-04 17:40:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality4632216275752598029.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14703050975782110194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4632216275752598029.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Graph (trivial) has 1199 edges and 1210 vertex of which 84 / 1210 are part of one of the 14 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 859 transitions
Trivial Post-agglo rules discarded 859 transitions
Performed 859 trivial Post agglomeration. Transition count delta: 859
Iterating post reduction 0 with 859 rules applied. Total rules applied 860 place count 1139 transition count 871
Reduce places removed 859 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 871 rules applied. Total rules applied 1731 place count 280 transition count 859
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1736 place count 275 transition count 859
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 1736 place count 275 transition count 797
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 1860 place count 213 transition count 797
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1883 place count 190 transition count 773
Iterating global reduction 3 with 23 rules applied. Total rules applied 1906 place count 190 transition count 773
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1906 place count 190 transition count 772
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1908 place count 189 transition count 772
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1920 place count 177 transition count 599
Iterating global reduction 3 with 12 rules applied. Total rules applied 1932 place count 177 transition count 599
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1936 place count 177 transition count 595
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1939 place count 174 transition count 591
Iterating global reduction 4 with 3 rules applied. Total rules applied 1942 place count 174 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1943 place count 174 transition count 590
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1944 place count 173 transition count 589
Iterating global reduction 5 with 1 rules applied. Total rules applied 1945 place count 173 transition count 589
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 2005 place count 143 transition count 559
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2012 place count 143 transition count 552
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 2040 place count 115 transition count 268
Iterating global reduction 6 with 28 rules applied. Total rules applied 2068 place count 115 transition count 268
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2079 place count 115 transition count 257
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2096 place count 98 transition count 236
Iterating global reduction 7 with 17 rules applied. Total rules applied 2113 place count 98 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2114 place count 98 transition count 235
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 2129 place count 83 transition count 216
Iterating global reduction 8 with 15 rules applied. Total rules applied 2144 place count 83 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2152 place count 83 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2154 place count 82 transition count 207
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2155 place count 81 transition count 202
Iterating global reduction 9 with 1 rules applied. Total rules applied 2156 place count 81 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2157 place count 81 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2162 place count 81 transition count 196
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 2172 place count 76 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2173 place count 75 transition count 190
Applied a total of 2173 rules in 83 ms. Remains 75 /1210 variables (removed 1135) and now considering 190/1811 (removed 1621) transitions.
[2025-06-04 17:40:39] [INFO ] Flow matrix only has 184 transitions (discarded 6 similar events)
// Phase 1: matrix 184 rows 75 cols
[2025-06-04 17:40:39] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:40:40] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-04 17:40:40] [INFO ] Flow matrix only has 184 transitions (discarded 6 similar events)
[2025-06-04 17:40:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:40:40] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 17:40:40] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:40:40] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2025-06-04 17:40:40] [INFO ] Flow matrix only has 184 transitions (discarded 6 similar events)
[2025-06-04 17:40:40] [INFO ] Invariant cache hit.
[2025-06-04 17:40:40] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 5/75 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:42] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:42] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:42] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:42] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 183/258 variables, 75/95 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:48] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:48] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 1/259 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/259 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 128 constraints, problems are : Problem set: 0 solved, 179 unsolved in 21540 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 5/75 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 183/258 variables, 75/97 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 179/306 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:06] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:08] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:08] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:12] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:12] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:12] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:17] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 12 (OVERLAPS) 1/259 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 314 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51662ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 51663ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/1210 places, 190/1811 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52231 ms. Remains : 75/1210 places, 190/1811 transitions.
[2025-06-04 17:41:32] [INFO ] Flatten gal took : 7 ms
[2025-06-04 17:41:32] [INFO ] Flatten gal took : 7 ms
[2025-06-04 17:41:32] [INFO ] Input system was already deterministic with 190 transitions.
[2025-06-04 17:41:32] [INFO ] Flatten gal took : 7 ms
[2025-06-04 17:41:32] [INFO ] Flatten gal took : 7 ms
[2025-06-04 17:41:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality9385518668137653782.gal : 2 ms
[2025-06-04 17:41:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17880658181465983362.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9385518668137653782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17880658181465983362.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,671022,0.849056,25692,2,6453,5,71287,6,0,480,58117,0


Converting to forward existential form...Done !
original formula: EG(AF((p446==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p446==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t9, t11, t12, t13, t15, t16, t17, t19, t20, t24, t25, t26, t55, t57, t64, t72, t7...372
(forward)formula 0,0,19.9277,422880,1,0,586,2.31159e+06,400,278,5771,1.56894e+06,677
FORMULA StigmergyCommit-PT-04b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 1811/1811 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1169 transition count 1770
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1169 transition count 1770
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 114 place count 1137 transition count 1738
Iterating global reduction 0 with 32 rules applied. Total rules applied 146 place count 1137 transition count 1738
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 167 place count 1116 transition count 1717
Iterating global reduction 0 with 21 rules applied. Total rules applied 188 place count 1116 transition count 1717
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 207 place count 1097 transition count 1698
Iterating global reduction 0 with 19 rules applied. Total rules applied 226 place count 1097 transition count 1698
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 242 place count 1081 transition count 1682
Iterating global reduction 0 with 16 rules applied. Total rules applied 258 place count 1081 transition count 1682
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 274 place count 1065 transition count 1666
Iterating global reduction 0 with 16 rules applied. Total rules applied 290 place count 1065 transition count 1666
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 305 place count 1050 transition count 1651
Iterating global reduction 0 with 15 rules applied. Total rules applied 320 place count 1050 transition count 1651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 321 place count 1050 transition count 1650
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 333 place count 1038 transition count 1638
Iterating global reduction 1 with 12 rules applied. Total rules applied 345 place count 1038 transition count 1638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 346 place count 1038 transition count 1637
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 355 place count 1029 transition count 1628
Iterating global reduction 2 with 9 rules applied. Total rules applied 364 place count 1029 transition count 1628
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 366 place count 1029 transition count 1626
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 372 place count 1023 transition count 1620
Iterating global reduction 3 with 6 rules applied. Total rules applied 378 place count 1023 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 382 place count 1019 transition count 1616
Iterating global reduction 3 with 4 rules applied. Total rules applied 386 place count 1019 transition count 1616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 387 place count 1019 transition count 1615
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 390 place count 1016 transition count 1612
Iterating global reduction 4 with 3 rules applied. Total rules applied 393 place count 1016 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 396 place count 1013 transition count 1609
Iterating global reduction 4 with 3 rules applied. Total rules applied 399 place count 1013 transition count 1609
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 401 place count 1011 transition count 1607
Iterating global reduction 4 with 2 rules applied. Total rules applied 403 place count 1011 transition count 1607
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 405 place count 1009 transition count 1605
Iterating global reduction 4 with 2 rules applied. Total rules applied 407 place count 1009 transition count 1605
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 409 place count 1007 transition count 1603
Iterating global reduction 4 with 2 rules applied. Total rules applied 411 place count 1007 transition count 1603
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 413 place count 1005 transition count 1601
Iterating global reduction 4 with 2 rules applied. Total rules applied 415 place count 1005 transition count 1601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 416 place count 1005 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 417 place count 1004 transition count 1599
Iterating global reduction 5 with 1 rules applied. Total rules applied 418 place count 1004 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 419 place count 1003 transition count 1598
Iterating global reduction 5 with 1 rules applied. Total rules applied 420 place count 1003 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 421 place count 1002 transition count 1597
Iterating global reduction 5 with 1 rules applied. Total rules applied 422 place count 1002 transition count 1597
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 423 place count 1002 transition count 1596
Applied a total of 423 rules in 1332 ms. Remains 1002 /1210 variables (removed 208) and now considering 1596/1811 (removed 215) transitions.
// Phase 1: matrix 1596 rows 1002 cols
[2025-06-04 17:41:53] [INFO ] Computed 6 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:41:54] [INFO ] Implicit Places using invariants in 1203 ms returned []
[2025-06-04 17:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:41:56] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 3344 ms to find 0 implicit places.
Running 1595 sub problems to find dead transitions.
[2025-06-04 17:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/2598 variables, and 0 constraints, problems are : Problem set: 0 solved, 1595 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 1595/1595 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1595 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/2598 variables, and 0 constraints, problems are : Problem set: 0 solved, 1595 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/1595 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62268ms problems are : Problem set: 0 solved, 1595 unsolved
Search for dead transitions found 0 dead transitions in 62271ms
Starting structural reductions in LTL mode, iteration 1 : 1002/1210 places, 1596/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66953 ms. Remains : 1002/1210 places, 1596/1811 transitions.
[2025-06-04 17:42:59] [INFO ] Flatten gal took : 39 ms
[2025-06-04 17:42:59] [INFO ] Flatten gal took : 44 ms
[2025-06-04 17:42:59] [INFO ] Input system was already deterministic with 1596 transitions.
[2025-06-04 17:42:59] [INFO ] Flatten gal took : 43 ms
[2025-06-04 17:42:59] [INFO ] Flatten gal took : 44 ms
[2025-06-04 17:42:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6068311131498081418.gal : 9 ms
[2025-06-04 17:42:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality17924595033281853235.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6068311131498081418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17924595033281853235.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-04 17:43:29] [INFO ] Flatten gal took : 42 ms
[2025-06-04 17:43:29] [INFO ] Applying decomposition
[2025-06-04 17:43:29] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4872279826643249922.txt' '-o' '/tmp/graph4872279826643249922.bin' '-w' '/tmp/graph4872279826643249922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4872279826643249922.bin' '-l' '-1' '-v' '-w' '/tmp/graph4872279826643249922.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:43:29] [INFO ] Decomposing Gal with order
[2025-06-04 17:43:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:43:29] [INFO ] Removed a total of 2820 redundant transitions.
[2025-06-04 17:43:29] [INFO ] Flatten gal took : 99 ms
[2025-06-04 17:43:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2025-06-04 17:43:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality2365632062324915957.gal : 12 ms
[2025-06-04 17:43:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality17544341726176540925.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2365632062324915957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17544341726176540925.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 17:44:00] [INFO ] Flatten gal took : 44 ms
[2025-06-04 17:44:00] [INFO ] Flatten gal took : 44 ms
[2025-06-04 17:44:00] [INFO ] Applying decomposition
[2025-06-04 17:44:00] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2299528510617739661.txt' '-o' '/tmp/graph2299528510617739661.bin' '-w' '/tmp/graph2299528510617739661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2299528510617739661.bin' '-l' '-1' '-v' '-w' '/tmp/graph2299528510617739661.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:44:00] [INFO ] Decomposing Gal with order
[2025-06-04 17:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:44:00] [INFO ] Removed a total of 2862 redundant transitions.
[2025-06-04 17:44:00] [INFO ] Flatten gal took : 87 ms
[2025-06-04 17:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2025-06-04 17:44:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13311829660551180080.gal : 13 ms
[2025-06-04 17:44:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality2220043105586573399.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13311829660551180080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2220043105586573399.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 8 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.75323e+12,89.9369,2264500,6086,18,1.96324e+06,1615,2330,2.21059e+07,59,3836,0


Converting to forward existential form...Done !
original formula: AF((AX(AG(AX(((i6.u2.p6==0)&&(i2.i0.i1.u24.p58==1))))) + (i42.i0.i1.u186.p567==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(E(TRUE U !(!(EX(!(((i6.u2.p6==0)&&(i2.i0.i1.u24.p58==1))))))))))) + (i42.i0.i1.u186.p567=...170
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t89, t207, t208, t266, t267, t303, t418, t508, t670, t704, t781, t813, t814, t909, ...910
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
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Detected timeout of ITS tools.
[2025-06-04 18:12:41] [INFO ] Applying decomposition
[2025-06-04 18:12:41] [INFO ] Flatten gal took : 77 ms
[2025-06-04 18:12:41] [INFO ] Decomposing Gal with order
[2025-06-04 18:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 18:12:41] [INFO ] Removed a total of 2644 redundant transitions.
[2025-06-04 18:12:41] [INFO ] Flatten gal took : 224 ms
[2025-06-04 18:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 406 labels/synchronizations in 19 ms.
[2025-06-04 18:12:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality11895519933540302312.gal : 8 ms
[2025-06-04 18:12:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9386226906845040075.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11895519933540302312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9386226906845040075.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 8 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.75323e+12,7.09245,129288,150,8341,14936,274249,181,55137,2157,1.75327e+06,0


Converting to forward existential form...Done !
original formula: AF((AX(AG(AX(((i0.i0.i0.i0.u5.p6==0)&&(i0.i0.i0.i0.u5.p58==1))))) + (i0.i0.i0.i0.u6.p567==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(E(TRUE U !(!(EX(!(((i0.i0.i0.i0.u5.p6==0)&&(i0.i0.i0.i0.u5.p58==1))))))))))) + (i0.i0.i0....181
Reverse transition relation is NOT exact ! Due to transitions t1141, i0.u9.t89, i0.u9.t107, i0.u9.t121, i0.u9.t139, i0.u9.t147, i0.u9.t156, i0.u9.t207, i0....1316
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-04b"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-04b, 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 r226-smll-174903490600041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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