Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 450K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749156728041

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 20:52:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 20:52:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:52:09] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2025-06-05 20:52:09] [INFO ] Transformed 1295 places.
[2025-06-05 20:52:09] [INFO ] Transformed 749 transitions.
[2025-06-05 20:52:09] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 1036 places in 10 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 315 place count 184 transition count 248
Iterating global reduction 1 with 58 rules applied. Total rules applied 373 place count 184 transition count 248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 380 place count 184 transition count 241
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 416 place count 148 transition count 205
Iterating global reduction 2 with 36 rules applied. Total rules applied 452 place count 148 transition count 205
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 460 place count 148 transition count 197
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 484 place count 124 transition count 172
Iterating global reduction 3 with 24 rules applied. Total rules applied 508 place count 124 transition count 172
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 523 place count 124 transition count 157
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 527 place count 120 transition count 151
Iterating global reduction 4 with 4 rules applied. Total rules applied 531 place count 120 transition count 151
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 535 place count 116 transition count 147
Iterating global reduction 4 with 4 rules applied. Total rules applied 539 place count 116 transition count 147
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 541 place count 114 transition count 144
Iterating global reduction 4 with 2 rules applied. Total rules applied 543 place count 114 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 545 place count 114 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 547 place count 112 transition count 140
Iterating global reduction 5 with 2 rules applied. Total rules applied 549 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 550 place count 111 transition count 139
Iterating global reduction 5 with 1 rules applied. Total rules applied 551 place count 111 transition count 139
Applied a total of 551 rules in 79 ms. Remains 111 /259 variables (removed 148) and now considering 139/749 (removed 610) transitions.
// Phase 1: matrix 139 rows 111 cols
[2025-06-05 20:52:09] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:52:09] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-06-05 20:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:52:09] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 20:52:10] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-05 20:52:10] [INFO ] Invariant cache hit.
[2025-06-05 20:52:10] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:12] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:12] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:12] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:12] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:12] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:12] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:13] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 139/250 variables, 111/123 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 61/184 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:14] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:15] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:15] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:15] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:15] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:15] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:15] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:16] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:16] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:16] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 10/194 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:52:20] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 8 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 195 constraints, problems are : Problem set: 0 solved, 138 unsolved in 16372 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 139/250 variables, 111/134 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 61/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 138/333 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/250 variables, and 333 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46571ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 46585ms
Starting structural reductions in LTL mode, iteration 1 : 111/259 places, 139/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47319 ms. Remains : 111/259 places, 139/749 transitions.
Support contains 13 out of 111 places after structural reductions.
[2025-06-05 20:52:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-05 20:52:56] [INFO ] Flatten gal took : 30 ms
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:52:57] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:52:57] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 11 out of 111 places (down from 13) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8980 resets) in 2078 ms. (19 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4117 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4156 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4152 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4162 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4240 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4297 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4111 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4198 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4045 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4126 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
Probably explored full state space saw : 127471 states, properties seen :4
Probabilistic random walk after 340705 steps, saw 127471 distinct states, run finished after 1757 ms. (steps per millisecond=193 ) properties seen :4
Explored full state space saw : 127471 states, properties seen :0
Exhaustive walk after 340705 steps, saw 127471 distinct states, run finished after 1431 ms. (steps per millisecond=238 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:53:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-05 20:53:01] [INFO ] Flatten gal took : 10 ms
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:53:01] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:53:01] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 3 out of 111 places (down from 4) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 39 stable transitions
Graph (complete) has 364 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 139/139 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 103 transition count 118
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 98 transition count 111
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 98 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 98 transition count 108
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 94 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 94 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 94 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 46 place count 90 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 90 transition count 97
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 87 transition count 94
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 87 transition count 94
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 84 transition count 91
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 84 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 82 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 68 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 79 transition count 84
Applied a total of 73 rules in 31 ms. Remains 79 /111 variables (removed 32) and now considering 84/139 (removed 55) transitions.
// Phase 1: matrix 84 rows 79 cols
[2025-06-05 20:53:01] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:53:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-05 20:53:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:53:01] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 20:53:01] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:53:01] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2025-06-05 20:53:01] [INFO ] Invariant cache hit.
[2025-06-05 20:53:01] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:02] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:02] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:02] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 84/163 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:03] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:04] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 125 constraints, problems are : Problem set: 0 solved, 83 unsolved in 6502 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 1/79 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 84/163 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 83/208 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 208 constraints, problems are : Problem set: 0 solved, 83 unsolved in 16634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23169ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 23170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/111 places, 84/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23413 ms. Remains : 79/111 places, 84/139 transitions.
[2025-06-05 20:53:24] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:53:24] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:53:24] [INFO ] Input system was already deterministic with 84 transitions.
[2025-06-05 20:53:24] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:53:24] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:53:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1838514947076820043.gal : 2 ms
[2025-06-05 20:53:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12508109745786556026.ctl : 4 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/CTLCardinality1838514947076820043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12508109745786556026.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,65185,0.189043,11756,2,2377,5,30644,6,0,400,18389,0


Converting to forward existential form...Done !
original formula: EG(EF((l202>0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (l202>0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t14, t27, t55, t62, t63, t64, t65, t66, t67, t68, t69, t72, t73, t76, t77, t79, t80, t81...265
(forward)formula 0,1,1.60536,63708,1,0,590,291993,195,336,2683,254709,512
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 139/139 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 103 transition count 118
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 98 transition count 111
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 98 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 98 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 95 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 95 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 95 transition count 103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 92 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 92 transition count 100
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 90 transition count 98
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 88 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 88 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 87 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 87 transition count 94
Applied a total of 58 rules in 10 ms. Remains 87 /111 variables (removed 24) and now considering 94/139 (removed 45) transitions.
// Phase 1: matrix 94 rows 87 cols
[2025-06-05 20:53:26] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:53:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-05 20:53:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:53:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 20:53:26] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-05 20:53:26] [INFO ] Invariant cache hit.
[2025-06-05 20:53:26] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:27] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:27] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:27] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:27] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:27] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:28] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:28] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/181 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:29] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:29] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:29] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:29] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:29] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:29] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/181 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 142 constraints, problems are : Problem set: 0 solved, 93 unsolved in 6153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/87 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 94/181 variables, 87/105 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 37/142 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 93/235 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:53:36] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/181 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 236 constraints, problems are : Problem set: 0 solved, 93 unsolved in 26705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32887ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 32888ms
Starting structural reductions in LTL mode, iteration 1 : 87/111 places, 94/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33229 ms. Remains : 87/111 places, 94/139 transitions.
[2025-06-05 20:53:59] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:53:59] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:53:59] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-05 20:53:59] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:53:59] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:53:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality160837892872861505.gal : 2 ms
[2025-06-05 20:53:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality4550788701246487042.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/CTLCardinality160837892872861505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4550788701246487042.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 -...282
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,52233,0.139206,10960,2,2826,5,24528,6,0,442,16095,0


Converting to forward existential form...Done !
original formula: AF(AX((p19>0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((p19>0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t19, t23, t25, t27, t28, t29, t61, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t80,...299
(forward)formula 0,0,1.23359,51672,1,0,577,204752,211,329,2952,184168,483
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 139/139 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 103 transition count 119
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 98 transition count 112
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 98 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 33 place count 98 transition count 108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 95 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 95 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 95 transition count 103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 92 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 89 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 87 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 87 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 86 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 85 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 84 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 83 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 83 transition count 90
Applied a total of 64 rules in 11 ms. Remains 83 /111 variables (removed 28) and now considering 90/139 (removed 49) transitions.
// Phase 1: matrix 90 rows 83 cols
[2025-06-05 20:54:01] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:54:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 20:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:54:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-05 20:54:01] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-06-05 20:54:01] [INFO ] Invariant cache hit.
[2025-06-05 20:54:01] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:02] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:02] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:02] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:02] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:02] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:03] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:03] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:03] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:04] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 133 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5812 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/83 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:07] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/173 variables, 83/98 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 36/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 223 constraints, problems are : Problem set: 0 solved, 89 unsolved in 17158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22994ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 22995ms
Starting structural reductions in LTL mode, iteration 1 : 83/111 places, 90/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23227 ms. Remains : 83/111 places, 90/139 transitions.
[2025-06-05 20:54:24] [INFO ] Flatten gal took : 11 ms
[2025-06-05 20:54:24] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:54:24] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-05 20:54:24] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:54:24] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:54:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1189941276459353944.gal : 1 ms
[2025-06-05 20:54:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality8153748592948199142.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1189941276459353944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8153748592948199142.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,66041,0.217652,14088,2,2535,5,40516,6,0,422,22872,0


Converting to forward existential form...Done !
original formula: AF((AX(FALSE) + AG((p73>0))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) + !(E(TRUE U !((p73>0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t38, t47, t49, t59, t66, t67, t68, t69, t70, t71, t72, t73, t76, t77, t80, t81, t83, t84...270
(forward)formula 0,0,1.41997,58164,1,0,606,255964,208,356,2887,233793,511
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 139/139 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 102 transition count 117
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 96 transition count 109
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 96 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 39 place count 96 transition count 104
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 92 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 92 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 92 transition count 98
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 88 transition count 94
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 88 transition count 94
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 85 transition count 91
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 85 transition count 91
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 82 transition count 88
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 82 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 82 transition count 87
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 71 place count 80 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 77 transition count 81
Applied a total of 79 rules in 12 ms. Remains 77 /111 variables (removed 34) and now considering 81/139 (removed 58) transitions.
// Phase 1: matrix 81 rows 77 cols
[2025-06-05 20:54:25] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:54:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 20:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:54:25] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 20:54:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-06-05 20:54:26] [INFO ] Invariant cache hit.
[2025-06-05 20:54:26] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:26] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:26] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:26] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:26] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:26] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:27] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:27] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:27] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/158 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:29] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:29] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/158 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:31] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/158 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 125 constraints, problems are : Problem set: 0 solved, 80 unsolved in 9012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/158 variables, 77/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 80/205 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 205 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19814ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 19815ms
Starting structural reductions in LTL mode, iteration 1 : 77/111 places, 81/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20019 ms. Remains : 77/111 places, 81/139 transitions.
[2025-06-05 20:54:45] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:54:45] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:54:45] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-05 20:54:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:54:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:54:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality10668642538216641540.gal : 1 ms
[2025-06-05 20:54:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13084112654940774034.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/CTLCardinality10668642538216641540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13084112654940774034.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,52143,0.175854,13056,2,2284,5,34925,6,0,389,19677,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t59, t60, t61, t62, t63, t64, t65, t66, t69, t70, t73, t74, t76, t77, t78, t79, t80, In...250
(forward)formula 0,1,0.573395,26044,1,0,188,91002,183,76,2579,57444,218
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 20:54:46] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:54:46] [INFO ] Flatten gal took : 7 ms
Total runtime 157306 ms.

BK_STOP 1749156886534

--------------------
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="SieveSingleMsgMbox-PT-d1m06"
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 SieveSingleMsgMbox-PT-d1m06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901994300409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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