Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994100297.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 ShieldRVt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994100297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 364K 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 ShieldRVt-PT-030B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-15
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-00
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-01
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-02
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-03
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-04
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-05
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-06
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-07
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-08
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-09
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-10
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749111937138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 08:25:38] [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-05 08:25:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 08:25:38] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2025-06-05 08:25:38] [INFO ] Transformed 1503 places.
[2025-06-05 08:25:38] [INFO ] Transformed 1503 transitions.
[2025-06-05 08:25:38] [INFO ] Found NUPN structural information;
[2025-06-05 08:25:38] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 130 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 283 places :
Symmetric choice reduction at 0 with 283 rule applications. Total rules 283 place count 1220 transition count 1220
Iterating global reduction 0 with 283 rules applied. Total rules applied 566 place count 1220 transition count 1220
Applied a total of 566 rules in 224 ms. Remains 1220 /1503 variables (removed 283) and now considering 1220/1503 (removed 283) transitions.
// Phase 1: matrix 1220 rows 1220 cols
[2025-06-05 08:25:39] [INFO ] Computed 121 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:25:39] [INFO ] Implicit Places using invariants in 824 ms returned []
[2025-06-05 08:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:25:40] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
Running 1219 sub problems to find dead transitions.
[2025-06-05 08:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1219/2440 variables, and 0 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1220 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1219/2440 variables, and 0 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1220 constraints, PredecessorRefiner: 0/1219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60325ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Starting structural reductions in LTL mode, iteration 1 : 1220/1503 places, 1220/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62295 ms. Remains : 1220/1503 places, 1220/1503 transitions.
Support contains 130 out of 1220 places after structural reductions.
[2025-06-05 08:26:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-05 08:26:41] [INFO ] Flatten gal took : 94 ms
FORMULA ShieldRVt-PT-030B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 08:26:41] [INFO ] Flatten gal took : 52 ms
[2025-06-05 08:26:41] [INFO ] Input system was already deterministic with 1220 transitions.
Support contains 121 out of 1220 places (down from 130) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1437 ms. (27 steps per ms) remains 22/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
[2025-06-05 08:26:42] [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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 373/415 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 805/1220 variables, 87/121 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1220/2440 variables, 1220/1341 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2440 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/2440 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2440/2440 variables, and 1341 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2329 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1220/1220 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 373/415 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 805/1220 variables, 87/121 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:45] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:45] [INFO ] Deduced a trap composed of 19 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-05 08:26:45] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:45] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:45] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:46] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:46] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:46] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:46] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:46] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 1220/2440 variables, 1220/1351 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2440 variables, 22/1373 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:48] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:48] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:49] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:49] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:49] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 9 ms to minimize.
SMT process timed out in 7466ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 1220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1220 transition count 914
Reduce places removed 306 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 308 rules applied. Total rules applied 614 place count 914 transition count 912
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 626 place count 913 transition count 901
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 637 place count 902 transition count 901
Performed 211 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 211 Pre rules applied. Total rules applied 637 place count 902 transition count 690
Deduced a syphon composed of 211 places in 2 ms
Reduce places removed 211 places and 0 transitions.
Iterating global reduction 4 with 422 rules applied. Total rules applied 1059 place count 691 transition count 690
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1084 place count 666 transition count 665
Iterating global reduction 4 with 25 rules applied. Total rules applied 1109 place count 666 transition count 665
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 1109 place count 666 transition count 648
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 1143 place count 649 transition count 648
Performed 265 Post agglomeration using F-continuation condition.Transition count delta: 265
Deduced a syphon composed of 265 places in 2 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 4 with 530 rules applied. Total rules applied 1673 place count 384 transition count 383
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 1827 place count 307 transition count 444
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1828 place count 307 transition count 443
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1832 place count 307 transition count 439
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1836 place count 303 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1838 place count 303 transition count 437
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1839 place count 303 transition count 437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1840 place count 302 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1841 place count 301 transition count 436
Applied a total of 1841 rules in 233 ms. Remains 301 /1220 variables (removed 919) and now considering 436/1220 (removed 784) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 301/1220 places, 436/1220 transitions.
RANDOM walk for 40000 steps (15 resets) in 576 ms. (69 steps per ms) remains 17/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
// Phase 1: matrix 436 rows 301 cols
[2025-06-05 08:26:50] [INFO ] Computed 120 invariants in 2 ms
[2025-06-05 08:26:50] [INFO ] State equation strengthened by 34 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, 17 unsolved
At refinement iteration 1 (OVERLAPS) 70/103 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/105 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 187/292 variables, 105/133 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 280/572 variables, 111/251 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 51/302 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 6/578 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 116/694 variables, 62/386 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/694 variables, 24/410 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/694 variables, 9/419 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/694 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 3/697 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/697 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/697 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 2/699 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/699 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 21/720 variables, 10/437 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/720 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/720 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/720 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 14/734 variables, 6/449 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/734 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/734 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 3/737 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/737 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/737 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (OVERLAPS) 0/737 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 737/737 variables, and 455 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1719 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 301/301 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 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, 17 unsolved
At refinement iteration 1 (OVERLAPS) 70/103 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/105 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 187/292 variables, 105/133 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 280/572 variables, 111/260 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 51/311 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 16/327 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 8/335 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:52] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/572 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 6/578 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/578 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/578 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 116/694 variables, 62/404 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/694 variables, 24/428 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/694 variables, 9/437 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:53] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/694 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:26:54] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/694 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 3/697 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/697 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/697 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (OVERLAPS) 2/699 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/699 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 21/720 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/720 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/720 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/720 variables, 12/474 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/720 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 14/734 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/734 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (OVERLAPS) 3/737 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/737 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/737 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (OVERLAPS) 0/737 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 737/737 variables, and 486 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5662 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 301/301 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 7393ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 743 ms.
Support contains 33 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 436/436 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 301 transition count 433
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 298 transition count 433
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 298 transition count 429
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 294 transition count 429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 292 transition count 427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 291 transition count 429
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 291 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 290 transition count 428
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 288 transition count 426
Applied a total of 24 rules in 37 ms. Remains 288 /301 variables (removed 13) and now considering 426/436 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 288/301 places, 426/436 transitions.
RANDOM walk for 40000 steps (14 resets) in 432 ms. (92 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
// Phase 1: matrix 426 rows 288 cols
[2025-06-05 08:26:58] [INFO ] Computed 120 invariants in 1 ms
[2025-06-05 08:26:58] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 65/95 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 9/104 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 186/290 variables, 104/132 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 273/563 variables, 110/249 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 55/304 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 111/674 variables, 56/373 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 28/401 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/674 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 23/697 variables, 10/411 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/697 variables, 5/416 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/697 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 14/711 variables, 6/422 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/711 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/711 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 3/714 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/714 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/714 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (OVERLAPS) 0/714 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 428 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 288/288 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 65/95 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 9/104 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 186/290 variables, 104/132 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 273/563 variables, 110/257 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 55/312 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 13/325 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 7/332 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:27:00] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:27:00] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 111/674 variables, 56/390 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/674 variables, 28/418 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/674 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 23/697 variables, 10/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/697 variables, 5/433 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/697 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 14/711 variables, 6/439 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/711 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/711 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (OVERLAPS) 3/714 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/714 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/714 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 0/714 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 714/714 variables, and 445 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3083 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 288/288 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4154ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 3907 ms.
Support contains 30 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 426/426 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 288 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 286 transition count 424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 286 transition count 423
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 285 transition count 423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 284 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 283 transition count 424
Applied a total of 10 rules in 23 ms. Remains 283 /288 variables (removed 5) and now considering 424/426 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 283/288 places, 424/426 transitions.
RANDOM walk for 40000 steps (15 resets) in 330 ms. (120 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 180512 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :6 out of 15
Probabilistic random walk after 180512 steps, saw 116354 distinct states, run finished after 3006 ms. (steps per millisecond=60 ) properties seen :6
// Phase 1: matrix 424 rows 283 cols
[2025-06-05 08:27:09] [INFO ] Computed 120 invariants in 1 ms
[2025-06-05 08:27:09] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 37/55 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 106/163 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 189/352 variables, 71/145 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 30/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 8/360 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 3/363 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 131/494 variables, 65/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 28/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 5/287 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 69/563 variables, 28/315 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/563 variables, 13/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/563 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 2/565 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/565 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 62/627 variables, 24/353 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/627 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/627 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/627 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 5/632 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/632 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/632 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 5/637 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/637 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 46/683 variables, 23/394 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/683 variables, 7/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/683 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/683 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 24/707 variables, 12/421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/707 variables, 6/427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/707 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 0/707 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 427 constraints, problems are : Problem set: 0 solved, 9 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 283/283 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 37/55 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 106/163 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 189/352 variables, 71/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 6/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 8/360 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:27:11] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:27:11] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:27:11] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:27:11] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:27:11] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 3/363 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/363 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 131/494 variables, 65/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 28/292 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/494 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/494 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/494 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 69/563 variables, 28/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/563 variables, 13/342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/563 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 2/565 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/565 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 62/627 variables, 24/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/627 variables, 8/375 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/627 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/627 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 5/632 variables, 3/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/632 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/632 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 5/637 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/637 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 46/683 variables, 23/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/683 variables, 7/415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/683 variables, 8/423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/683 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (OVERLAPS) 24/707 variables, 12/435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/707 variables, 6/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/707 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (OVERLAPS) 0/707 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 441 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2793 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 283/283 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 3775ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2375 ms.
Support contains 18 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 421
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 280 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 279 transition count 420
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 279 transition count 415
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 274 transition count 415
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 270 transition count 411
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 267 transition count 416
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 263 transition count 412
Applied a total of 36 rules in 25 ms. Remains 263 /283 variables (removed 20) and now considering 412/424 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 263/283 places, 412/424 transitions.
RANDOM walk for 40000 steps (15 resets) in 277 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 194345 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :6 out of 9
Probabilistic random walk after 194345 steps, saw 124178 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :6
// Phase 1: matrix 412 rows 263 cols
[2025-06-05 08:27:19] [INFO ] Computed 120 invariants in 4 ms
[2025-06-05 08:27:19] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/31 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 74/105 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 187/292 variables, 69/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/298 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 161/459 variables, 71/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 32/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/461 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/461 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 85/546 variables, 38/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 18/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 58/604 variables, 22/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/604 variables, 11/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/604 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 47/651 variables, 18/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/651 variables, 9/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/651 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 24/675 variables, 12/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/675 variables, 6/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/675 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/675 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 387 constraints, problems are : Problem set: 0 solved, 3 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 263/263 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/31 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 74/105 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 187/292 variables, 69/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 31/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/298 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/298 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 161/459 variables, 71/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 32/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/461 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/461 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 85/546 variables, 38/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 18/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 58/604 variables, 22/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/604 variables, 11/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/604 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 47/651 variables, 18/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/651 variables, 9/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/651 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 24/675 variables, 12/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/675 variables, 6/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/675 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/675 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 390 constraints, problems are : Problem set: 0 solved, 3 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 263/263 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1024ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 226 ms.
Support contains 9 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 412/412 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 263 transition count 406
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 257 transition count 406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 256 transition count 405
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 252 transition count 409
Applied a total of 22 rules in 14 ms. Remains 252 /263 variables (removed 11) and now considering 409/412 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 252/263 places, 409/412 transitions.
RANDOM walk for 40000 steps (18 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 520909 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :2 out of 3
Probabilistic random walk after 520909 steps, saw 329398 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :2
// Phase 1: matrix 409 rows 252 cols
[2025-06-05 08:27:23] [INFO ] Computed 120 invariants in 5 ms
[2025-06-05 08:27:24] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/47 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/171 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 168/339 variables, 65/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 31/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/340 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 138/478 variables, 52/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 24/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/478 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/481 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/481 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/481 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/485 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/485 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 96/581 variables, 44/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/581 variables, 19/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/581 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/581 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 56/637 variables, 24/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/637 variables, 12/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/637 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 24/661 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/661 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/661 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/661 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 252/252 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/47 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/171 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 168/339 variables, 65/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 31/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/340 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 138/478 variables, 52/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/478 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/481 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/481 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/481 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/485 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/485 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 96/581 variables, 44/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/581 variables, 19/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/581 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/581 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 56/637 variables, 24/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/637 variables, 12/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/637 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 24/661 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/661 variables, 6/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/661 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/661 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 252/252 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 536ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 409/409 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 252 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 251 transition count 408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 251 transition count 407
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 250 transition count 407
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 248 transition count 405
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 246 transition count 407
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 246 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 245 transition count 406
Applied a total of 14 rules in 26 ms. Remains 245 /252 variables (removed 7) and now considering 406/409 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 245/252 places, 406/409 transitions.
RANDOM walk for 40000 steps (11 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 667540 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 667540 steps, saw 420497 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
// Phase 1: matrix 406 rows 245 cols
[2025-06-05 08:27:27] [INFO ] Computed 120 invariants in 3 ms
[2025-06-05 08:27:27] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/47 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/172 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 167/339 variables, 64/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/476 variables, 52/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 26/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 95/571 variables, 40/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/571 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 56/627 variables, 24/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/627 variables, 12/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/627 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/651 variables, 12/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/651 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/651 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/651 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 245/245 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/47 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/172 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 167/339 variables, 64/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/476 variables, 52/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 26/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 95/571 variables, 40/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 56/627 variables, 24/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/627 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/627 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 24/651 variables, 12/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/651 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/651 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/651 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 245/245 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 245/245 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-05 08:27:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:27:28] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-05 08:27:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:27:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-05 08:27:28] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 08:27:28] [INFO ] Redundant transitions in 24 ms returned []
Running 403 sub problems to find dead transitions.
[2025-06-05 08:27:28] [INFO ] Invariant cache hit.
[2025-06-05 08:27:28] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 406/651 variables, 245/365 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/651 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/651 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (OVERLAPS) 0/651 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 367 constraints, problems are : Problem set: 0 solved, 403 unsolved in 16596 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 245/245 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 406/651 variables, 245/365 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/651 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/651 variables, 403/770 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 0/651 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 770 constraints, problems are : Problem set: 0 solved, 403 unsolved in 20823 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 245/245 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37494ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 37495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37916 ms. Remains : 245/245 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 245 vertex of which 4 / 245 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 828 edges and 243 vertex of which 241 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 108 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 237 transition count 397
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 107 edges and 235 vertex of which 6 / 235 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 232 transition count 388
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 105 edges and 229 vertex of which 8 / 229 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 225 transition count 377
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 101 edges and 221 vertex of which 6 / 221 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 218 transition count 363
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 98 edges and 215 vertex of which 6 / 215 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 16 rules applied. Total rules applied 70 place count 212 transition count 351
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 97 edges and 209 vertex of which 8 / 209 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 14 rules applied. Total rules applied 84 place count 205 transition count 341
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 94 edges and 201 vertex of which 10 / 201 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 103 place count 196 transition count 327
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 88 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 23 rules applied. Total rules applied 126 place count 187 transition count 310
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 84 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 145 place count 179 transition count 296
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 81 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 18 rules applied. Total rules applied 163 place count 171 transition count 283
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 77 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 10 with 17 rules applied. Total rules applied 180 place count 164 transition count 271
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 74 edges and 161 vertex of which 2 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 14 rules applied. Total rules applied 194 place count 160 transition count 261
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 73 edges and 159 vertex of which 2 / 159 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 12 with 7 rules applied. Total rules applied 201 place count 158 transition count 256
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 205 place count 157 transition count 253
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 3 Pre rules applied. Total rules applied 205 place count 157 transition count 250
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 213 place count 152 transition count 250
Graph (trivial) has 71 edges and 152 vertex of which 4 / 152 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 215 place count 149 transition count 250
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 68 edges and 149 vertex of which 2 / 149 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 221 place count 148 transition count 245
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 226 place count 147 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 226 place count 147 transition count 240
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 229 place count 145 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 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 232 place count 143 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 65 edges and 143 vertex of which 2 / 143 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 236 place count 142 transition count 236
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 65 edges and 141 vertex of which 2 / 141 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 17 with 4 rules applied. Total rules applied 240 place count 140 transition count 234
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Remove reverse transitions (loop back) rule discarded transition t171.t168.t184.t177.t182 and 2 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 244 place count 137 transition count 229
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 2 places and 0 transitions.
Iterating global reduction 19 with 3 rules applied. Total rules applied 247 place count 135 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 251 place count 135 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 253 place count 135 transition count 222
Applied a total of 253 rules in 73 ms. Remains 135 /245 variables (removed 110) and now considering 222/406 (removed 184) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 135 cols
[2025-06-05 08:28:06] [INFO ] Computed 66 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 08:28:06] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 08:28:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 7 ms returned sat
[2025-06-05 08:28:06] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 08:28:06] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 08:28:06] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 292 ms.
[2025-06-05 08:28:06] [INFO ] Flatten gal took : 53 ms
[2025-06-05 08:28:06] [INFO ] Flatten gal took : 75 ms
[2025-06-05 08:28:06] [INFO ] Input system was already deterministic with 1220 transitions.
Computed a total of 373 stabilizing places and 373 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1179 transition count 1179
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1179 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1178 transition count 1178
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1177 transition count 1177
Applied a total of 86 rules in 276 ms. Remains 1177 /1220 variables (removed 43) and now considering 1177/1220 (removed 43) transitions.
// Phase 1: matrix 1177 rows 1177 cols
[2025-06-05 08:28:07] [INFO ] Computed 121 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:28:07] [INFO ] Implicit Places using invariants in 380 ms returned []
[2025-06-05 08:28:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:28:08] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
Running 1176 sub problems to find dead transitions.
[2025-06-05 08:28:08] [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 1176/2354 variables, and 0 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1177 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 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 1176/2354 variables, and 0 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1177 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 1177/1220 places, 1177/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61853 ms. Remains : 1177/1220 places, 1177/1220 transitions.
[2025-06-05 08:29:08] [INFO ] Flatten gal took : 29 ms
[2025-06-05 08:29:08] [INFO ] Flatten gal took : 30 ms
[2025-06-05 08:29:08] [INFO ] Input system was already deterministic with 1177 transitions.
[2025-06-05 08:29:08] [INFO ] Flatten gal took : 25 ms
[2025-06-05 08:29:08] [INFO ] Flatten gal took : 26 ms
[2025-06-05 08:29:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality9541824164382287586.gal : 17 ms
[2025-06-05 08:29:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality15857431104863768444.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/CTLCardinality9541824164382287586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15857431104863768444.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-05 08:29:38] [INFO ] Flatten gal took : 23 ms
[2025-06-05 08:29:38] [INFO ] Applying decomposition
[2025-06-05 08:29:38] [INFO ] Flatten gal took : 24 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/graph5790657094772052488.txt' '-o' '/tmp/graph5790657094772052488.bin' '-w' '/tmp/graph5790657094772052488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5790657094772052488.bin' '-l' '-1' '-v' '-w' '/tmp/graph5790657094772052488.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:29:39] [INFO ] Decomposing Gal with order
[2025-06-05 08:29:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:29:39] [INFO ] Removed a total of 298 redundant transitions.
[2025-06-05 08:29:39] [INFO ] Flatten gal took : 103 ms
[2025-06-05 08:29:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-05 08:29:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality12462910045579885832.gal : 18 ms
[2025-06-05 08:29:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality1814724035876418324.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/CTLCardinality12462910045579885832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1814724035876418324.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 LTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1175 transition count 1175
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1173 transition count 1173
Applied a total of 94 rules in 164 ms. Remains 1173 /1220 variables (removed 47) and now considering 1173/1220 (removed 47) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2025-06-05 08:30:09] [INFO ] Computed 121 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:30:09] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-06-05 08:30:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:30:10] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Running 1172 sub problems to find dead transitions.
[2025-06-05 08:30:10] [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 1172/2346 variables, and 0 constraints, problems are : Problem set: 0 solved, 1172 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1173 constraints, PredecessorRefiner: 1172/1172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1172 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 1172/2346 variables, and 0 constraints, problems are : Problem set: 0 solved, 1172 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1173 constraints, PredecessorRefiner: 0/1172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 1172 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 1173/1220 places, 1173/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61435 ms. Remains : 1173/1220 places, 1173/1220 transitions.
[2025-06-05 08:31:10] [INFO ] Flatten gal took : 22 ms
[2025-06-05 08:31:10] [INFO ] Flatten gal took : 20 ms
[2025-06-05 08:31:10] [INFO ] Input system was already deterministic with 1173 transitions.
[2025-06-05 08:31:11] [INFO ] Flatten gal took : 20 ms
[2025-06-05 08:31:11] [INFO ] Flatten gal took : 20 ms
[2025-06-05 08:31:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15804711545864393992.gal : 5 ms
[2025-06-05 08:31:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13248453883436365863.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/CTLCardinality15804711545864393992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13248453883436365863.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-05 08:31:41] [INFO ] Flatten gal took : 21 ms
[2025-06-05 08:31:41] [INFO ] Applying decomposition
[2025-06-05 08:31:41] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18041966721871062137.txt' '-o' '/tmp/graph18041966721871062137.bin' '-w' '/tmp/graph18041966721871062137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18041966721871062137.bin' '-l' '-1' '-v' '-w' '/tmp/graph18041966721871062137.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:31:41] [INFO ] Decomposing Gal with order
[2025-06-05 08:31:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:31:41] [INFO ] Removed a total of 298 redundant transitions.
[2025-06-05 08:31:41] [INFO ] Flatten gal took : 47 ms
[2025-06-05 08:31:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 08:31:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality12243587254204057349.gal : 11 ms
[2025-06-05 08:31:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7368280462779690725.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/CTLCardinality12243587254204057349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7368280462779690725.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 : 1220/1220 places, 1220/1220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1219 transition count 893
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 654 place count 893 transition count 891
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 658 place count 892 transition count 888
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 661 place count 889 transition count 888
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 218 Pre rules applied. Total rules applied 661 place count 889 transition count 670
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 4 with 436 rules applied. Total rules applied 1097 place count 671 transition count 670
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 1124 place count 644 transition count 643
Iterating global reduction 4 with 27 rules applied. Total rules applied 1151 place count 644 transition count 643
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 1151 place count 644 transition count 622
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 1193 place count 623 transition count 622
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 4 with 476 rules applied. Total rules applied 1669 place count 385 transition count 384
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1671 place count 383 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1672 place count 382 transition count 382
Applied a total of 1672 rules in 99 ms. Remains 382 /1220 variables (removed 838) and now considering 382/1220 (removed 838) transitions.
// Phase 1: matrix 382 rows 382 cols
[2025-06-05 08:32:11] [INFO ] Computed 120 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:32:11] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-05 08:32:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:32:11] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 08:32:11] [INFO ] Redundant transitions in 6 ms returned []
Running 377 sub problems to find dead transitions.
[2025-06-05 08:32:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 4/382 variables, 92/120 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 382/764 variables, 382/502 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:28] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 503 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 4/382 variables, 92/120 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 382/764 variables, 382/502 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 377/879 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:58] [INFO ] Deduced a trap along path composed of 3 places in 97 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:58] [INFO ] Deduced a trap along path composed of 3 places in 75 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 75 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 74 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 115 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 83 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 75 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 63 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 68 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 93 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:32:59] [INFO ] Deduced a trap along path composed of 3 places in 87 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:00] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:00] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:00] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:00] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:00] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:00] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:00] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:00] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:01] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 20/900 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:09] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:33:09] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 902 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 23/23 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in SI_CTL mode, iteration 1 : 382/1220 places, 382/1220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60604 ms. Remains : 382/1220 places, 382/1220 transitions.
[2025-06-05 08:33:12] [INFO ] Flatten gal took : 10 ms
[2025-06-05 08:33:12] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:33:12] [INFO ] Input system was already deterministic with 382 transitions.
[2025-06-05 08:33:12] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:33:12] [INFO ] Flatten gal took : 10 ms
[2025-06-05 08:33:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality18236833818853490168.gal : 2 ms
[2025-06-05 08:33:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality16764210567048108434.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/CTLCardinality18236833818853490168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16764210567048108434.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,2.5536e+59,0.318379,15704,2,1760,5,45305,6,0,1909,68766,0


Converting to forward existential form...Done !
original formula: EG(E((EF((p386==0)) + (p969==0)) U (((EF(((p1478==0)||(p142==1))) * AG((p553==1))) * ((p1150!=0) * EF(!(((p1331==0)||(p508==1)))))) * (!(...239
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U (p386==0)) + (p969==0)) U (((E(TRUE U ((p1478==0)||(p142==1))) * !(E(TRUE U !((p553==1)))...324
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t11, t13, t16, t24, t26, t28, t30, t33, t36, t38, t41, t47, t50, t53, t56, t58, t...721
Detected timeout of ITS tools.
[2025-06-05 08:33:42] [INFO ] Flatten gal took : 10 ms
[2025-06-05 08:33:42] [INFO ] Applying decomposition
[2025-06-05 08:33:42] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8488420138615647843.txt' '-o' '/tmp/graph8488420138615647843.bin' '-w' '/tmp/graph8488420138615647843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8488420138615647843.bin' '-l' '-1' '-v' '-w' '/tmp/graph8488420138615647843.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:33:42] [INFO ] Decomposing Gal with order
[2025-06-05 08:33:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:33:42] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-05 08:33:42] [INFO ] Flatten gal took : 27 ms
[2025-06-05 08:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 08:33:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14386634744104861312.gal : 4 ms
[2025-06-05 08:33:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14265602869405870187.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/CTLCardinality14386634744104861312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14265602869405870187.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,2.5536e+59,0.168157,10872,319,33,12448,149,620,28745,54,414,0


Converting to forward existential form...Done !
original formula: EG(E((EF((i4.u31.p386==0)) + (i12.i1.u82.p969==0)) U (((EF(((i19.i0.u125.p1478==0)||(i1.i0.u11.p142==1))) * AG((i7.i0.u47.p553==1))) * ((...380
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U (i4.u31.p386==0)) + (i12.i1.u82.p969==0)) U (((E(TRUE U ((i19.i0.u125.p1478==0)||(i1.i0.u...465
Reverse transition relation is NOT exact ! Due to transitions t371, i0.i0.u2.t28, i0.i0.u3.t30, i0.i0.u4.t33, i0.i0.u5.t36, i0.i1.u6.t38, i0.i1.u7.t41, i0....1675
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1219 transition count 883
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 338 rules applied. Total rules applied 674 place count 883 transition count 881
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 677 place count 882 transition count 879
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 679 place count 880 transition count 879
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 218 Pre rules applied. Total rules applied 679 place count 880 transition count 661
Deduced a syphon composed of 218 places in 0 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 4 with 436 rules applied. Total rules applied 1115 place count 662 transition count 661
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 1146 place count 631 transition count 630
Iterating global reduction 4 with 31 rules applied. Total rules applied 1177 place count 631 transition count 630
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1177 place count 631 transition count 607
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1223 place count 608 transition count 607
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 4 with 478 rules applied. Total rules applied 1701 place count 369 transition count 368
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1702 place count 369 transition count 368
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1704 place count 367 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1705 place count 366 transition count 366
Applied a total of 1705 rules in 93 ms. Remains 366 /1220 variables (removed 854) and now considering 366/1220 (removed 854) transitions.
// Phase 1: matrix 366 rows 366 cols
[2025-06-05 08:34:12] [INFO ] Computed 120 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:34:12] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-05 08:34:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:34:12] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 08:34:12] [INFO ] Redundant transitions in 5 ms returned []
Running 364 sub problems to find dead transitions.
[2025-06-05 08:34:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/366 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 366/732 variables, 366/486 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (OVERLAPS) 0/732 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 732/732 variables, and 486 constraints, problems are : Problem set: 0 solved, 364 unsolved in 29448 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/366 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 366/732 variables, 366/486 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 364/850 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 0/732 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Int declared 732/732 variables, and 850 constraints, problems are : Problem set: 0 solved, 364 unsolved in 29647 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59125ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 59126ms
Starting structural reductions in SI_CTL mode, iteration 1 : 366/1220 places, 366/1220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59658 ms. Remains : 366/1220 places, 366/1220 transitions.
[2025-06-05 08:35:12] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:35:12] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:35:12] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-05 08:35:12] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:35:12] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:35:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4197491526690748537.gal : 2 ms
[2025-06-05 08:35:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality6688432863506184285.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/CTLCardinality4197491526690748537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6688432863506184285.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.
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,8.41399e+57,0.179144,10392,2,613,5,25833,6,0,1832,32507,0


Converting to forward existential form...Done !
original formula: EF(EG(A(((p787==0)||(p209==1)) U (EG((p1332==1)) + (((p114==0)&&(p1226==1))&&(p160==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!((EG((p1332==1)) + (((p114==0)&&(p1226==1))&&(p160==1)))) U (!(((p787==0)||(p209==1)...298
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-05 08:35:42] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:35:42] [INFO ] Applying decomposition
[2025-06-05 08:35:42] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17809645626802961181.txt' '-o' '/tmp/graph17809645626802961181.bin' '-w' '/tmp/graph17809645626802961181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17809645626802961181.bin' '-l' '-1' '-v' '-w' '/tmp/graph17809645626802961181.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:35:42] [INFO ] Decomposing Gal with order
[2025-06-05 08:35:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:35:42] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-05 08:35:42] [INFO ] Flatten gal took : 12 ms
[2025-06-05 08:35:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-05 08:35:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17274958419276235178.gal : 2 ms
[2025-06-05 08:35:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality1253492202168206223.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/CTLCardinality17274958419276235178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1253492202168206223.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.
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,8.41399e+57,0.102454,7568,52,8,6523,99,449,12106,42,237,0


Converting to forward existential form...Done !
original formula: EF(EG(A(((i10.i0.u63.p787==0)||(i3.u15.p209==1)) U (EG((i16.u108.p1332==1)) + (((i1.u7.p114==0)&&(i15.i0.u99.p1226==1))&&(i2.u11.p160==1)...160
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!((EG((i16.u108.p1332==1)) + (((i1.u7.p114==0)&&(i15.i0.u99.p1226==1))&&(i2.u11.p160=...415
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an 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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1178 transition count 1178
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1177 transition count 1177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1176 transition count 1176
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1176 transition count 1176
Applied a total of 88 rules in 157 ms. Remains 1176 /1220 variables (removed 44) and now considering 1176/1220 (removed 44) transitions.
// Phase 1: matrix 1176 rows 1176 cols
[2025-06-05 08:36:12] [INFO ] Computed 121 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:36:12] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-06-05 08:36:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:36:13] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Running 1175 sub problems to find dead transitions.
[2025-06-05 08:36:13] [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 1175/2352 variables, and 0 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1176 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 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 1175/2352 variables, and 0 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1176 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 1176/1220 places, 1176/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61470 ms. Remains : 1176/1220 places, 1176/1220 transitions.
[2025-06-05 08:37:13] [INFO ] Flatten gal took : 22 ms
[2025-06-05 08:37:13] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:37:13] [INFO ] Input system was already deterministic with 1176 transitions.
[2025-06-05 08:37:13] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:37:13] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:37:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2397444358712940744.gal : 4 ms
[2025-06-05 08:37:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality16981215339966724935.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/CTLCardinality2397444358712940744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16981215339966724935.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-05 08:37:43] [INFO ] Flatten gal took : 27 ms
[2025-06-05 08:37:43] [INFO ] Applying decomposition
[2025-06-05 08:37:43] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4672500292828820668.txt' '-o' '/tmp/graph4672500292828820668.bin' '-w' '/tmp/graph4672500292828820668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4672500292828820668.bin' '-l' '-1' '-v' '-w' '/tmp/graph4672500292828820668.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:37:44] [INFO ] Decomposing Gal with order
[2025-06-05 08:37:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:37:44] [INFO ] Removed a total of 294 redundant transitions.
[2025-06-05 08:37:44] [INFO ] Flatten gal took : 41 ms
[2025-06-05 08:37:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 08:37:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4727144928261108284.gal : 10 ms
[2025-06-05 08:37:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality2523396485690791310.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/CTLCardinality4727144928261108284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2523396485690791310.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 : 1220/1220 places, 1220/1220 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1176 transition count 1176
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1174 transition count 1174
Applied a total of 92 rules in 162 ms. Remains 1174 /1220 variables (removed 46) and now considering 1174/1220 (removed 46) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2025-06-05 08:38:14] [INFO ] Computed 121 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:38:14] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-06-05 08:38:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:38:15] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 1173 sub problems to find dead transitions.
[2025-06-05 08:38:15] [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 1173/2348 variables, and 0 constraints, problems are : Problem set: 0 solved, 1173 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1174 constraints, PredecessorRefiner: 1173/1173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1173/2348 variables, and 0 constraints, problems are : Problem set: 0 solved, 1173 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1174 constraints, PredecessorRefiner: 0/1173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 1173 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 1174/1220 places, 1174/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61438 ms. Remains : 1174/1220 places, 1174/1220 transitions.
[2025-06-05 08:39:15] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:39:15] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:39:15] [INFO ] Input system was already deterministic with 1174 transitions.
[2025-06-05 08:39:15] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:39:15] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:39:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality10327617775381053693.gal : 5 ms
[2025-06-05 08:39:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality12188605639673482734.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/CTLCardinality10327617775381053693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12188605639673482734.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-05 08:39:45] [INFO ] Flatten gal took : 22 ms
[2025-06-05 08:39:45] [INFO ] Applying decomposition
[2025-06-05 08:39:45] [INFO ] Flatten gal took : 18 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/graph458943272751518386.txt' '-o' '/tmp/graph458943272751518386.bin' '-w' '/tmp/graph458943272751518386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph458943272751518386.bin' '-l' '-1' '-v' '-w' '/tmp/graph458943272751518386.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:39:45] [INFO ] Decomposing Gal with order
[2025-06-05 08:39:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:39:46] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-05 08:39:46] [INFO ] Flatten gal took : 55 ms
[2025-06-05 08:39:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 08:39:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality7457688202066559798.gal : 10 ms
[2025-06-05 08:39:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality13651061871504790378.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/CTLCardinality7457688202066559798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13651061871504790378.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 : 1220/1220 places, 1220/1220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 1219 transition count 881
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 340 rules applied. Total rules applied 678 place count 881 transition count 879
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 681 place count 880 transition count 877
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 683 place count 878 transition count 877
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 216 Pre rules applied. Total rules applied 683 place count 878 transition count 661
Deduced a syphon composed of 216 places in 0 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 4 with 432 rules applied. Total rules applied 1115 place count 662 transition count 661
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1149 place count 628 transition count 627
Iterating global reduction 4 with 34 rules applied. Total rules applied 1183 place count 628 transition count 627
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 1183 place count 628 transition count 601
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 1235 place count 602 transition count 601
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 237
Deduced a syphon composed of 237 places in 0 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 4 with 474 rules applied. Total rules applied 1709 place count 365 transition count 364
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1711 place count 363 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1712 place count 362 transition count 362
Applied a total of 1712 rules in 86 ms. Remains 362 /1220 variables (removed 858) and now considering 362/1220 (removed 858) transitions.
// Phase 1: matrix 362 rows 362 cols
[2025-06-05 08:40:16] [INFO ] Computed 120 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:40:16] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-05 08:40:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:40:16] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 08:40:16] [INFO ] Redundant transitions in 2 ms returned []
Running 360 sub problems to find dead transitions.
[2025-06-05 08:40:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 362/724 variables, 362/482 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/724 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 0/724 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 724/724 variables, and 482 constraints, problems are : Problem set: 0 solved, 360 unsolved in 27785 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 362/724 variables, 362/482 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/724 variables, 360/842 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/724 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 724/724 variables, and 842 constraints, problems are : Problem set: 0 solved, 360 unsolved in 28001 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55809ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 55810ms
Starting structural reductions in SI_CTL mode, iteration 1 : 362/1220 places, 362/1220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56315 ms. Remains : 362/1220 places, 362/1220 transitions.
[2025-06-05 08:41:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 08:41:12] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:41:12] [INFO ] Input system was already deterministic with 362 transitions.
[2025-06-05 08:41:12] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:41:12] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:41:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality14757763753538940028.gal : 1 ms
[2025-06-05 08:41:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality1207531495969208972.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/CTLCardinality14757763753538940028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1207531495969208972.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,2.83972e+57,0.178076,10112,2,605,5,24726,6,0,1813,30522,0


Converting to forward existential form...Done !
original formula: A(EF(AG(AF(((p103==0)||(p1106==1))))) U (p362==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p362==1))))) * !(E(!((p362==1)) U (!(E(TRUE U !(E(TRUE U !(!(EG(!(((p103==0)||(p1106==1)))))))...187
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-05 08:41:42] [INFO ] Flatten gal took : 14 ms
[2025-06-05 08:41:42] [INFO ] Applying decomposition
[2025-06-05 08:41:42] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8255114830371675118.txt' '-o' '/tmp/graph8255114830371675118.bin' '-w' '/tmp/graph8255114830371675118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8255114830371675118.bin' '-l' '-1' '-v' '-w' '/tmp/graph8255114830371675118.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:41:42] [INFO ] Decomposing Gal with order
[2025-06-05 08:41:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:41:42] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-05 08:41:42] [INFO ] Flatten gal took : 12 ms
[2025-06-05 08:41:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-05 08:41:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16967252623016754084.gal : 2 ms
[2025-06-05 08:41:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17204196111840757782.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/CTLCardinality16967252623016754084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17204196111840757782.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,2.83972e+57,0.093148,7180,40,8,5838,79,402,10472,40,170,0


Converting to forward existential form...Done !
original formula: A(EF(AG(AF(((i1.i0.u6.p103==0)||(i11.u88.p1106==1))))) U (i3.i1.u27.p362==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i3.i1.u27.p362==1))))) * !(E(!((i3.i1.u27.p362==1)) U (!(E(TRUE U !(E(TRUE U !(!(EG(!(((i1.i0....234
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an 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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 1219 transition count 886
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 335 rules applied. Total rules applied 668 place count 886 transition count 884
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 670 place count 885 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 671 place count 884 transition count 883
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 217 Pre rules applied. Total rules applied 671 place count 884 transition count 666
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 4 with 434 rules applied. Total rules applied 1105 place count 667 transition count 666
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1138 place count 634 transition count 633
Iterating global reduction 4 with 33 rules applied. Total rules applied 1171 place count 634 transition count 633
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 1171 place count 634 transition count 608
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1221 place count 609 transition count 608
Performed 232 Post agglomeration using F-continuation condition.Transition count delta: 232
Deduced a syphon composed of 232 places in 0 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 4 with 464 rules applied. Total rules applied 1685 place count 377 transition count 376
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1687 place count 375 transition count 374
Applied a total of 1687 rules in 73 ms. Remains 375 /1220 variables (removed 845) and now considering 374/1220 (removed 846) transitions.
// Phase 1: matrix 374 rows 375 cols
[2025-06-05 08:42:12] [INFO ] Computed 121 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:42:12] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-05 08:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:42:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-05 08:42:13] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 08:42:13] [INFO ] Redundant transitions in 1 ms returned []
Running 369 sub problems to find dead transitions.
[2025-06-05 08:42:13] [INFO ] Invariant cache hit.
[2025-06-05 08:42:13] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 4/375 variables, 88/121 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 374/749 variables, 375/496 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/749 variables, and 498 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 375/375 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 4/375 variables, 88/121 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 374/749 variables, 375/496 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 369/867 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:57] [INFO ] Deduced a trap along path composed of 3 places in 76 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:57] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:57] [INFO ] Deduced a trap along path composed of 4 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:57] [INFO ] Deduced a trap along path composed of 3 places in 74 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:57] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:57] [INFO ] Deduced a trap along path composed of 3 places in 73 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 62 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 4 places in 49 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 7 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:42:58] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:43:05] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:43:06] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 20/887 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/749 variables, and 887 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 375/375 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_CTL mode, iteration 1 : 375/1220 places, 374/1220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60564 ms. Remains : 375/1220 places, 374/1220 transitions.
[2025-06-05 08:43:13] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:43:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:43:13] [INFO ] Input system was already deterministic with 374 transitions.
[2025-06-05 08:43:13] [INFO ] Flatten gal took : 15 ms
[2025-06-05 08:43:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:43:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality7894739397108211143.gal : 1 ms
[2025-06-05 08:43:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality9065856481953553371.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/CTLCardinality7894739397108211143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9065856481953553371.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.
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.62937e+58,0.281036,13824,2,1459,5,38112,6,0,1871,55128,0


Converting to forward existential form...Done !
original formula: AG((EF((((((p10==1)||((p1468==0)&&(p289==1)))&&(p1132==0))&&(p1197==1)) + !(A((p257==1) U (p673==1))))) * ((p434==0)||(p1175==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((((p10==1)||((p1468==0)&&(p289==1)))&&(p1132==0))&&(p1197==1)) + !(!((E(!((p67...289
(forward)formula 0,0,0.283652,14080,1,0,8,38112,9,2,1882,55128,1
FORMULA ShieldRVt-PT-030B-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1176 transition count 1176
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1174 transition count 1174
Applied a total of 92 rules in 161 ms. Remains 1174 /1220 variables (removed 46) and now considering 1174/1220 (removed 46) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2025-06-05 08:43:13] [INFO ] Computed 121 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:43:14] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-05 08:43:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:43:14] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Running 1173 sub problems to find dead transitions.
[2025-06-05 08:43:14] [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 1173/2348 variables, and 0 constraints, problems are : Problem set: 0 solved, 1173 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1174 constraints, PredecessorRefiner: 1173/1173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1173 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 1173/2348 variables, and 0 constraints, problems are : Problem set: 0 solved, 1173 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1174 constraints, PredecessorRefiner: 0/1173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 1173 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 1174/1220 places, 1174/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61424 ms. Remains : 1174/1220 places, 1174/1220 transitions.
[2025-06-05 08:44:15] [INFO ] Flatten gal took : 19 ms
[2025-06-05 08:44:15] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:44:15] [INFO ] Input system was already deterministic with 1174 transitions.
[2025-06-05 08:44:15] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:44:15] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:44:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality2774480679090290784.gal : 4 ms
[2025-06-05 08:44:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality13854607512580561070.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/CTLCardinality2774480679090290784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13854607512580561070.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-05 08:44:45] [INFO ] Flatten gal took : 23 ms
[2025-06-05 08:44:45] [INFO ] Applying decomposition
[2025-06-05 08:44:45] [INFO ] Flatten gal took : 18 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/graph14455442412332237680.txt' '-o' '/tmp/graph14455442412332237680.bin' '-w' '/tmp/graph14455442412332237680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14455442412332237680.bin' '-l' '-1' '-v' '-w' '/tmp/graph14455442412332237680.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:44:45] [INFO ] Decomposing Gal with order
[2025-06-05 08:44:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:44:45] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-05 08:44:45] [INFO ] Flatten gal took : 35 ms
[2025-06-05 08:44:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 08:44:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8750965263211010519.gal : 9 ms
[2025-06-05 08:44:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality2499246789893463367.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/CTLCardinality8750965263211010519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2499246789893463367.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 SI_CTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 1219 transition count 881
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 340 rules applied. Total rules applied 678 place count 881 transition count 879
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 680 place count 880 transition count 878
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 681 place count 879 transition count 878
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 219 Pre rules applied. Total rules applied 681 place count 879 transition count 659
Deduced a syphon composed of 219 places in 1 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 4 with 438 rules applied. Total rules applied 1119 place count 660 transition count 659
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 1151 place count 628 transition count 627
Iterating global reduction 4 with 32 rules applied. Total rules applied 1183 place count 628 transition count 627
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 1183 place count 628 transition count 603
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1231 place count 604 transition count 603
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 237
Deduced a syphon composed of 237 places in 0 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 4 with 474 rules applied. Total rules applied 1705 place count 367 transition count 366
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1707 place count 365 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1708 place count 364 transition count 364
Applied a total of 1708 rules in 73 ms. Remains 364 /1220 variables (removed 856) and now considering 364/1220 (removed 856) transitions.
// Phase 1: matrix 364 rows 364 cols
[2025-06-05 08:45:15] [INFO ] Computed 120 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:45:15] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-05 08:45:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:45:16] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 08:45:16] [INFO ] Redundant transitions in 1 ms returned []
Running 361 sub problems to find dead transitions.
[2025-06-05 08:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/364 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 364/728 variables, 364/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 0/728 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 484 constraints, problems are : Problem set: 0 solved, 361 unsolved in 24073 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/364 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 364/728 variables, 364/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 361/845 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:45:51] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 08:45:51] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 847 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54111ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 54112ms
Starting structural reductions in SI_CTL mode, iteration 1 : 364/1220 places, 364/1220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54629 ms. Remains : 364/1220 places, 364/1220 transitions.
[2025-06-05 08:46:10] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:46:10] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:46:10] [INFO ] Input system was already deterministic with 364 transitions.
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-030B-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 08:46:10] [INFO ] Flatten gal took : 12 ms
[2025-06-05 08:46:10] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:46:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12671194695139253921.gal : 2 ms
[2025-06-05 08:46:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13813827843417547810.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12671194695139253921.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13813827843417547810.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1175 transition count 1175
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1173 transition count 1173
Applied a total of 94 rules in 154 ms. Remains 1173 /1220 variables (removed 47) and now considering 1173/1220 (removed 47) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2025-06-05 08:46:10] [INFO ] Computed 121 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:46:10] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-05 08:46:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:46:12] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
Running 1172 sub problems to find dead transitions.
[2025-06-05 08:46:12] [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 1172/2346 variables, and 0 constraints, problems are : Problem set: 0 solved, 1172 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1173 constraints, PredecessorRefiner: 1172/1172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1172 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 1172/2346 variables, and 0 constraints, problems are : Problem set: 0 solved, 1172 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1173 constraints, PredecessorRefiner: 0/1172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 1172 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in LTL mode, iteration 1 : 1173/1220 places, 1173/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62035 ms. Remains : 1173/1220 places, 1173/1220 transitions.
[2025-06-05 08:47:12] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:47:12] [INFO ] Flatten gal took : 27 ms
[2025-06-05 08:47:12] [INFO ] Input system was already deterministic with 1173 transitions.
[2025-06-05 08:47:12] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:47:12] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:47:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6382950394625350932.gal : 6 ms
[2025-06-05 08:47:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality12922664158183162737.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/CTLCardinality6382950394625350932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12922664158183162737.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-05 08:47:42] [INFO ] Flatten gal took : 22 ms
[2025-06-05 08:47:42] [INFO ] Applying decomposition
[2025-06-05 08:47:42] [INFO ] Flatten gal took : 18 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/graph1454275089340258005.txt' '-o' '/tmp/graph1454275089340258005.bin' '-w' '/tmp/graph1454275089340258005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1454275089340258005.bin' '-l' '-1' '-v' '-w' '/tmp/graph1454275089340258005.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:47:42] [INFO ] Decomposing Gal with order
[2025-06-05 08:47:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:47:42] [INFO ] Removed a total of 296 redundant transitions.
[2025-06-05 08:47:42] [INFO ] Flatten gal took : 36 ms
[2025-06-05 08:47:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 08:47:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17829480355564400528.gal : 8 ms
[2025-06-05 08:47:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4614424479714249652.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/CTLCardinality17829480355564400528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4614424479714249652.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 LTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1173 transition count 1173
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 1171 transition count 1171
Applied a total of 98 rules in 161 ms. Remains 1171 /1220 variables (removed 49) and now considering 1171/1220 (removed 49) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2025-06-05 08:48:12] [INFO ] Computed 121 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:48:13] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-05 08:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:48:13] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2025-06-05 08:48:13] [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 1170/2342 variables, and 0 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1171 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 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 1170/2342 variables, and 0 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1171 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 1171/1220 places, 1171/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61406 ms. Remains : 1171/1220 places, 1171/1220 transitions.
[2025-06-05 08:49:14] [INFO ] Flatten gal took : 16 ms
[2025-06-05 08:49:14] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:49:14] [INFO ] Input system was already deterministic with 1171 transitions.
[2025-06-05 08:49:14] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:49:14] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:49:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3052833097643749649.gal : 5 ms
[2025-06-05 08:49:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality15112978667979607948.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/CTLCardinality3052833097643749649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15112978667979607948.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-05 08:49:44] [INFO ] Flatten gal took : 24 ms
[2025-06-05 08:49:44] [INFO ] Applying decomposition
[2025-06-05 08:49:44] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8014082729372401802.txt' '-o' '/tmp/graph8014082729372401802.bin' '-w' '/tmp/graph8014082729372401802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8014082729372401802.bin' '-l' '-1' '-v' '-w' '/tmp/graph8014082729372401802.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:49:44] [INFO ] Decomposing Gal with order
[2025-06-05 08:49:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:49:44] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-05 08:49:44] [INFO ] Flatten gal took : 33 ms
[2025-06-05 08:49:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 08:49:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality10348610726820327975.gal : 8 ms
[2025-06-05 08:49:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17528800714984632713.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/CTLCardinality10348610726820327975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17528800714984632713.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 LTL mode, iteration 0 : 1220/1220 places, 1220/1220 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1176 transition count 1176
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1174 transition count 1174
Applied a total of 92 rules in 154 ms. Remains 1174 /1220 variables (removed 46) and now considering 1174/1220 (removed 46) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2025-06-05 08:50:14] [INFO ] Computed 121 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:50:15] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-06-05 08:50:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:50:15] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
Running 1173 sub problems to find dead transitions.
[2025-06-05 08:50:15] [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 1173/2348 variables, and 0 constraints, problems are : Problem set: 0 solved, 1173 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1174 constraints, PredecessorRefiner: 1173/1173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1173 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 1173/2348 variables, and 0 constraints, problems are : Problem set: 0 solved, 1173 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1174 constraints, PredecessorRefiner: 0/1173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 1173 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 1174/1220 places, 1174/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61370 ms. Remains : 1174/1220 places, 1174/1220 transitions.
[2025-06-05 08:51:16] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:51:16] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:51:16] [INFO ] Input system was already deterministic with 1174 transitions.
[2025-06-05 08:51:16] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:51:16] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:51:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6886003353587670501.gal : 4 ms
[2025-06-05 08:51:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality6213252477959300620.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/CTLCardinality6886003353587670501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6213252477959300620.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-05 08:51:46] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:51:46] [INFO ] Applying decomposition
[2025-06-05 08:51:46] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph514627995954808018.txt' '-o' '/tmp/graph514627995954808018.bin' '-w' '/tmp/graph514627995954808018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph514627995954808018.bin' '-l' '-1' '-v' '-w' '/tmp/graph514627995954808018.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:51:46] [INFO ] Decomposing Gal with order
[2025-06-05 08:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:51:46] [INFO ] Removed a total of 298 redundant transitions.
[2025-06-05 08:51:46] [INFO ] Flatten gal took : 34 ms
[2025-06-05 08:51:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 08:51:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality921884805228882330.gal : 7 ms
[2025-06-05 08:51:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality15005408857033993668.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/CTLCardinality921884805228882330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15005408857033993668.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 : 1220/1220 places, 1220/1220 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1179 transition count 1179
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1179 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1178 transition count 1178
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1177 transition count 1177
Applied a total of 86 rules in 152 ms. Remains 1177 /1220 variables (removed 43) and now considering 1177/1220 (removed 43) transitions.
// Phase 1: matrix 1177 rows 1177 cols
[2025-06-05 08:52:16] [INFO ] Computed 121 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:52:16] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-06-05 08:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:52:17] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
Running 1176 sub problems to find dead transitions.
[2025-06-05 08:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1176/2354 variables, and 0 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1177 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1176/2354 variables, and 0 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/121 constraints, State Equation: 0/1177 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 1177/1220 places, 1177/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61318 ms. Remains : 1177/1220 places, 1177/1220 transitions.
[2025-06-05 08:53:17] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:53:17] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:53:17] [INFO ] Input system was already deterministic with 1177 transitions.
[2025-06-05 08:53:17] [INFO ] Flatten gal took : 17 ms
[2025-06-05 08:53:17] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:53:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality14251413726366507600.gal : 4 ms
[2025-06-05 08:53:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality7215021420437941881.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/CTLCardinality14251413726366507600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7215021420437941881.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-05 08:53:47] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:53:47] [INFO ] Applying decomposition
[2025-06-05 08:53:47] [INFO ] Flatten gal took : 18 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/graph15181183014476820710.txt' '-o' '/tmp/graph15181183014476820710.bin' '-w' '/tmp/graph15181183014476820710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15181183014476820710.bin' '-l' '-1' '-v' '-w' '/tmp/graph15181183014476820710.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:53:47] [INFO ] Decomposing Gal with order
[2025-06-05 08:53:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:53:48] [INFO ] Removed a total of 296 redundant transitions.
[2025-06-05 08:53:48] [INFO ] Flatten gal took : 33 ms
[2025-06-05 08:53:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 08:53:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality8942885200567369693.gal : 7 ms
[2025-06-05 08:53:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality12181065989372082429.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/CTLCardinality8942885200567369693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12181065989372082429.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 : 1220/1220 places, 1220/1220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1219 transition count 880
Reduce places removed 339 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 341 rules applied. Total rules applied 680 place count 880 transition count 878
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 682 place count 879 transition count 877
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 683 place count 878 transition count 877
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 218 Pre rules applied. Total rules applied 683 place count 878 transition count 659
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 4 with 436 rules applied. Total rules applied 1119 place count 660 transition count 659
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 1151 place count 628 transition count 627
Iterating global reduction 4 with 32 rules applied. Total rules applied 1183 place count 628 transition count 627
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 1183 place count 628 transition count 603
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1231 place count 604 transition count 603
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 4 with 478 rules applied. Total rules applied 1709 place count 365 transition count 364
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1711 place count 363 transition count 362
Applied a total of 1711 rules in 80 ms. Remains 363 /1220 variables (removed 857) and now considering 362/1220 (removed 858) transitions.
// Phase 1: matrix 362 rows 363 cols
[2025-06-05 08:54:18] [INFO ] Computed 121 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:54:18] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-05 08:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:54:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-05 08:54:18] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 08:54:18] [INFO ] Redundant transitions in 1 ms returned []
Running 360 sub problems to find dead transitions.
[2025-06-05 08:54:18] [INFO ] Invariant cache hit.
[2025-06-05 08:54:18] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/363 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 362/725 variables, 363/484 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/725 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 486 constraints, problems are : Problem set: 0 solved, 360 unsolved in 21540 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 363/363 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/363 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 362/725 variables, 363/484 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 360/846 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 0/725 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 725/725 variables, and 846 constraints, problems are : Problem set: 0 solved, 360 unsolved in 27908 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 363/363 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49470ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 49471ms
Starting structural reductions in SI_CTL mode, iteration 1 : 363/1220 places, 362/1220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49975 ms. Remains : 363/1220 places, 362/1220 transitions.
[2025-06-05 08:55:08] [INFO ] Flatten gal took : 12 ms
[2025-06-05 08:55:08] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:55:08] [INFO ] Input system was already deterministic with 362 transitions.
[2025-06-05 08:55:08] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:55:08] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:55:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13322216563182949972.gal : 1 ms
[2025-06-05 08:55:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality1241897099762376688.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/CTLCardinality13322216563182949972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1241897099762376688.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,4.79203e+57,0.177275,10100,2,606,5,24276,6,0,1814,30122,0


Converting to forward existential form...Done !
original formula: EF((EF(EG((p1250==0))) * (p1469==1)))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * (p1469==1)),TRUE),(p1250==0))] != FALSE
Hit Full ! (commute/partial/dont) 360/0/2
(forward)formula 0,1,0.544577,22388,1,0,11,124012,21,5,9233,30122,11
FORMULA ShieldRVt-PT-030B-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-05 08:55:08] [INFO ] Flatten gal took : 24 ms
[2025-06-05 08:55:08] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:55:08] [INFO ] Applying decomposition
[2025-06-05 08:55:08] [INFO ] Flatten gal took : 23 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/graph11493292312109994006.txt' '-o' '/tmp/graph11493292312109994006.bin' '-w' '/tmp/graph11493292312109994006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11493292312109994006.bin' '-l' '-1' '-v' '-w' '/tmp/graph11493292312109994006.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:55:08] [INFO ] Decomposing Gal with order
[2025-06-05 08:55:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:55:08] [INFO ] Removed a total of 260 redundant transitions.
[2025-06-05 08:55:08] [INFO ] Flatten gal took : 34 ms
[2025-06-05 08:55:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 08:55:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality3232508744548708323.gal : 8 ms
[2025-06-05 08:55:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality7462288546897157486.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/CTLCardinality3232508744548708323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7462288546897157486.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 12 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 09:25:01] [INFO ] Applying decomposition
[2025-06-05 09:25:01] [INFO ] Flatten gal took : 298 ms
[2025-06-05 09:25:01] [INFO ] Decomposing Gal with order
[2025-06-05 09:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 09:25:02] [INFO ] Removed a total of 73 redundant transitions.
[2025-06-05 09:25:02] [INFO ] Flatten gal took : 159 ms
[2025-06-05 09:25:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-06-05 09:25:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality7520486770974667543.gal : 27 ms
[2025-06-05 09:25:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality16645703089793585716.ctl : 18 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/CTLCardinality7520486770974667543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16645703089793585716.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 12 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r212-tall-174901994100297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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