fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r184-tall-174889264100417
Last Updated
June 24, 2025

About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 337940.00 0.00 0.00 FTFTFFFTFTTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M May 29 14:32 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 RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-15
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749072336168

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 21:25:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 21:25:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:25:37] [INFO ] Load time of PNML (sax parser for PT used): 422 ms
[2025-06-04 21:25:37] [INFO ] Transformed 6690 places.
[2025-06-04 21:25:37] [INFO ] Transformed 11934 transitions.
[2025-06-04 21:25:37] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 574 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 4305 places in 28 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1090 places :
Symmetric choice reduction at 1 with 1090 rule applications. Total rules 1209 place count 1278 transition count 2441
Iterating global reduction 1 with 1090 rules applied. Total rules applied 2299 place count 1278 transition count 2441
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 2374 place count 1278 transition count 2366
Discarding 922 places :
Symmetric choice reduction at 2 with 922 rule applications. Total rules 3296 place count 356 transition count 1444
Iterating global reduction 2 with 922 rules applied. Total rules applied 4218 place count 356 transition count 1444
Ensure Unique test removed 876 transitions
Reduce isomorphic transitions removed 876 transitions.
Iterating post reduction 2 with 876 rules applied. Total rules applied 5094 place count 356 transition count 568
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 5223 place count 227 transition count 439
Iterating global reduction 3 with 129 rules applied. Total rules applied 5352 place count 227 transition count 439
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5450 place count 227 transition count 341
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 5457 place count 220 transition count 334
Iterating global reduction 4 with 7 rules applied. Total rules applied 5464 place count 220 transition count 334
Applied a total of 5464 rules in 341 ms. Remains 220 /2385 variables (removed 2165) and now considering 334/11934 (removed 11600) transitions.
// Phase 1: matrix 334 rows 220 cols
[2025-06-04 21:25:38] [INFO ] Computed 3 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:38] [INFO ] Implicit Places using invariants in 378 ms returned []
[2025-06-04 21:25:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:39] [INFO ] State equation strengthened by 127 read => feed constraints.
[2025-06-04 21:25:40] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2048 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2025-06-04 21:25:40] [INFO ] Invariant cache hit.
[2025-06-04 21:25:40] [INFO ] State equation strengthened by 127 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 4 (OVERLAPS) 334/554 variables, 220/223 constraints. Problems are: Problem set: 26 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 127/350 constraints. Problems are: Problem set: 26 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:55] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 10 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:55] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 5 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:58] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 6 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:58] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 6 ms to minimize.
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:59] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 24 ms to minimize.
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:59] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 21 ms to minimize.
Problem TDEAD273 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 6/356 constraints. Problems are: Problem set: 49 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:11] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/554 variables, and 357 constraints, problems are : Problem set: 49 solved, 284 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 220/220 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 49 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 28/202 variables, 2/2 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 3/5 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/5 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 18/220 variables, 1/6 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 4/10 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/10 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 334/554 variables, 220/230 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 127/357 constraints. Problems are: Problem set: 49 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 284/641 constraints. Problems are: Problem set: 49 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 641 constraints, problems are : Problem set: 49 solved, 284 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 220/220 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 284/333 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60586ms problems are : Problem set: 49 solved, 284 unsolved
Search for dead transitions found 49 dead transitions in 60599ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in LTL mode, iteration 1 : 220/2385 places, 285/11934 transitions.
Reduce places removed 44 places and 1 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 176 transition count 267
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 61 rules in 5 ms. Remains 176 /220 variables (removed 44) and now considering 267/285 (removed 18) transitions.
// Phase 1: matrix 267 rows 176 cols
[2025-06-04 21:26:41] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:41] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-04 21:26:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:41] [INFO ] State equation strengthened by 117 read => feed constraints.
[2025-06-04 21:26:42] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 176/2385 places, 267/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63969 ms. Remains : 176/2385 places, 267/11934 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 24 out of 175 places after structural reductions.
[2025-06-04 21:26:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-04 21:26:42] [INFO ] Flatten gal took : 41 ms
[2025-06-04 21:26:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 21:26:42] [INFO ] Flatten gal took : 19 ms
[2025-06-04 21:26:42] [INFO ] Input system was already deterministic with 267 transitions.
Support contains 18 out of 175 places (down from 24) after GAL structural reductions.
RANDOM walk for 40000 steps (7158 resets) in 2207 ms. (18 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40004 steps (1621 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1696 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1648 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1684 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1595 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1677 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1658 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1674 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1747 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
// Phase 1: matrix 267 rows 175 cols
[2025-06-04 21:26:43] [INFO ] Computed 2 invariants in 3 ms
[2025-06-04 21:26:43] [INFO ] State equation strengthened by 117 read => feed constraints.
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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/24 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 50/74 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 170/244 variables, 74/76 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 20/96 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 8 (OVERLAPS) 194/438 variables, 97/193 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 97/290 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/290 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/442 variables, 4/294 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/294 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/442 variables, 0/294 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 294 constraints, problems are : Problem set: 9 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/155 variables, 3/4 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/5 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/214 variables, 1/7 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 27/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/218 variables, 1/35 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 1/36 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 220/438 variables, 139/175 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 116/291 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 0/291 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/442 variables, 4/295 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 0/295 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/442 variables, 0/295 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 295 constraints, problems are : Problem set: 9 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 9 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 9 atomic propositions for a total of 8 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 21:26:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-04 21:26:43] [INFO ] Flatten gal took : 19 ms
[2025-06-04 21:26:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 21:26:43] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:26:43] [INFO ] Input system was already deterministic with 267 transitions.
Computed a total of 22 stabilizing places and 74 stable transitions
Graph (complete) has 625 edges and 175 vertex of which 173 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 267/267 transitions.
Graph (complete) has 625 edges and 175 vertex of which 174 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 174 transition count 266
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 156 transition count 248
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 156 transition count 248
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 156 transition count 245
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 56 place count 141 transition count 230
Iterating global reduction 2 with 15 rules applied. Total rules applied 71 place count 141 transition count 230
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 86 place count 141 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 140 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 140 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 139 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 139 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 139 transition count 200
Applied a total of 91 rules in 39 ms. Remains 139 /175 variables (removed 36) and now considering 200/267 (removed 67) transitions.
// Phase 1: matrix 200 rows 139 cols
[2025-06-04 21:26:44] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 21:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:44] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-04 21:26:44] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:26:44] [INFO ] Redundant transitions in 9 ms returned []
Running 199 sub problems to find dead transitions.
[2025-06-04 21:26:44] [INFO ] Invariant cache hit.
[2025-06-04 21:26:44] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/339 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 85/226 constraints. Problems are: Problem set: 0 solved, 199 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 226 constraints, problems are : Problem set: 0 solved, 199 unsolved in 11422 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/339 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 85/226 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 199/425 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:11] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 339/339 variables, and 426 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41585ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 41587ms
Starting structural reductions in SI_CTL mode, iteration 1 : 139/175 places, 200/267 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42257 ms. Remains : 139/175 places, 200/267 transitions.
[2025-06-04 21:27:26] [INFO ] Flatten gal took : 15 ms
[2025-06-04 21:27:26] [INFO ] Flatten gal took : 19 ms
[2025-06-04 21:27:26] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-04 21:27:26] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:27:26] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:27:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2461151558872288928.gal : 4 ms
[2025-06-04 21:27:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality1414476036516174369.ctl : 17 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/CTLCardinality2461151558872288928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1414476036516174369.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,1.50666e+08,0.807224,36016,2,8904,5,99405,6,0,756,81962,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(((p311<1)&&(l2574<4)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((p311<1)&&(l2574<4)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t28, t34, t35, t36, t39, t4...703
(forward)formula 0,1,15.7875,426840,1,0,629,1.69425e+06,428,315,5319,1.80083e+06,642
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 267/267 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 174 transition count 266
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 158 transition count 250
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 158 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 158 transition count 246
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 50 place count 146 transition count 234
Iterating global reduction 2 with 12 rules applied. Total rules applied 62 place count 146 transition count 234
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 74 place count 146 transition count 222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 145 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 145 transition count 209
Applied a total of 76 rules in 9 ms. Remains 145 /175 variables (removed 30) and now considering 209/267 (removed 58) transitions.
// Phase 1: matrix 209 rows 145 cols
[2025-06-04 21:27:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:42] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-04 21:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:42] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-04 21:27:43] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-04 21:27:43] [INFO ] Invariant cache hit.
[2025-06-04 21:27:43] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/354 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 88/235 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/354 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 235 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/354 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 88/235 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 208/443 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 443 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42818ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 42819ms
Starting structural reductions in LTL mode, iteration 1 : 145/175 places, 209/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43592 ms. Remains : 145/175 places, 209/267 transitions.
[2025-06-04 21:28:25] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:28:25] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:28:25] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-04 21:28:25] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:28:26] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:28:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3387162384990750162.gal : 2 ms
[2025-06-04 21:28:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality12857254600460413667.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/CTLCardinality3387162384990750162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12857254600460413667.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.54433e+08,2.60693,88088,2,16282,5,179434,6,0,789,168131,0


Converting to forward existential form...Done !
original formula: AF(!(E(AX(FALSE) U (EF((p1019<=p262)) + AF((p522>p916))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!(EX(!(FALSE))) U (E(TRUE U (p1019<=p262)) + !(EG(!((p522>p916)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t13, t15, t16, t17, t18, t19, t20, t21, t22, t31, t32, t33, t34, t35, ...681
Detected timeout of ITS tools.
[2025-06-04 21:28:56] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:28:56] [INFO ] Applying decomposition
[2025-06-04 21:28:56] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6144029697516096756.txt' '-o' '/tmp/graph6144029697516096756.bin' '-w' '/tmp/graph6144029697516096756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6144029697516096756.bin' '-l' '-1' '-v' '-w' '/tmp/graph6144029697516096756.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:28:56] [INFO ] Decomposing Gal with order
[2025-06-04 21:28:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:28:56] [INFO ] Removed a total of 3 redundant transitions.
[2025-06-04 21:28:56] [INFO ] Flatten gal took : 42 ms
[2025-06-04 21:28:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2025-06-04 21:28:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality14105626885136242835.gal : 4 ms
[2025-06-04 21:28:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality7213439809505591672.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/CTLCardinality14105626885136242835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7213439809505591672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.54433e+08,2.40124,80756,2,15825,5,187333,6,0,789,157368,0


Converting to forward existential form...Done !
original formula: AF(!(E(AX(FALSE) U (EF((gu1.p1019<=gu1.p262)) + AF((gu2.p522>gu2.p916))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!(EX(!(FALSE))) U (E(TRUE U (gu1.p1019<=gu1.p262)) + !(EG(!((gu2.p522>gu2.p916)))))))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions gu0.t1, gu0.t9, gu0.t10, gu0.t11, gu0.t12, gu0.t13, gu0.t15, gu0.t16, gu0.t17, gu0.t18, gu0.t...1025
(forward)formula 0,0,29.7719,809444,1,0,746,3.27185e+06,450,369,5643,3.16489e+06,797
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 267/267 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 174 transition count 266
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 154 transition count 246
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 154 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 154 transition count 242
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 62 place count 138 transition count 226
Iterating global reduction 2 with 16 rules applied. Total rules applied 78 place count 138 transition count 226
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 94 place count 138 transition count 210
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 135 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 135 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 133 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 133 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 133 transition count 168
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 109 place count 129 transition count 164
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 129 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 117 place count 129 transition count 160
Applied a total of 117 rules in 10 ms. Remains 129 /175 variables (removed 46) and now considering 160/267 (removed 107) transitions.
// Phase 1: matrix 160 rows 129 cols
[2025-06-04 21:29:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:29:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-04 21:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:29:26] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-04 21:29:26] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2025-06-04 21:29:26] [INFO ] Invariant cache hit.
[2025-06-04 21:29:26] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 9377 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:47] [INFO ] Deduced a trap along path composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 344 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39453ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 39454ms
Starting structural reductions in LTL mode, iteration 1 : 129/175 places, 160/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39944 ms. Remains : 129/175 places, 160/267 transitions.
[2025-06-04 21:30:06] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:30:06] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:30:06] [INFO ] Input system was already deterministic with 160 transitions.
[2025-06-04 21:30:06] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:30:06] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:30:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12336980348339227624.gal : 2 ms
[2025-06-04 21:30:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality16727886434856264787.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/CTLCardinality12336980348339227624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16727886434856264787.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,1.28116e+08,0.640718,27004,2,7617,5,80256,6,0,676,76140,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.644938,27004,1,0,6,80256,7,1,921,76140,1
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 267/267 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 248
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 248
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 156 transition count 245
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 140 transition count 229
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 140 transition count 229
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 89 place count 140 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 138 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 137 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 137 transition count 186
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 133 transition count 182
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 133 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 111 place count 133 transition count 174
Applied a total of 111 rules in 14 ms. Remains 133 /175 variables (removed 42) and now considering 174/267 (removed 93) transitions.
// Phase 1: matrix 174 rows 133 cols
[2025-06-04 21:30:07] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:30:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 21:30:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:30:07] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-04 21:30:07] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-04 21:30:07] [INFO ] Invariant cache hit.
[2025-06-04 21:30:08] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/306 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 1/307 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 199 constraints, problems are : Problem set: 0 solved, 173 unsolved in 23754 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/306 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 39/237 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 1/307 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 134/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:30:55] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 373 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53844ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 53846ms
Starting structural reductions in LTL mode, iteration 1 : 133/175 places, 174/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54783 ms. Remains : 133/175 places, 174/267 transitions.
[2025-06-04 21:31:01] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:31:01] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:31:01] [INFO ] Input system was already deterministic with 174 transitions.
[2025-06-04 21:31:01] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:31:01] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:31:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality13213898672136905416.gal : 2 ms
[2025-06-04 21:31:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality1658191176513858393.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/CTLCardinality13213898672136905416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1658191176513858393.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28825e+08,1.24612,41908,2,11457,5,104792,6,0,703,99576,0


Converting to forward existential form...Done !
original formula: AF(((p1078>=1) * EX((l2883<=0))))
=> equivalent forward existential formula: [FwdG(Init,!(((p1078>=1) * EX((l2883<=0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t23, t24, t25, t26, t27, t36, t37, t38, t39,...565
(forward)formula 0,0,11.8069,293972,1,0,391,934274,369,149,5025,899603,414
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 21:31:13] [INFO ] Flatten gal took : 12 ms
[2025-06-04 21:31:13] [INFO ] Flatten gal took : 9 ms
Total runtime 336560 ms.

BK_STOP 1749072674108

--------------------
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="RingSingleMessageInMbox-PT-d1m010"
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 RingSingleMessageInMbox-PT-d1m010, 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 r184-tall-174889264100417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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