Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 4.0K 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-d1m36-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749161414144

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-d1m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 22:10:15] [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 22:10:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 22:10:15] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2025-06-05 22:10:15] [INFO ] Transformed 1295 places.
[2025-06-05 22:10:15] [INFO ] Transformed 749 transitions.
[2025-06-05 22:10:15] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 1036 places in 12 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 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 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 316 place count 183 transition count 247
Iterating global reduction 1 with 59 rules applied. Total rules applied 375 place count 183 transition count 247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 382 place count 183 transition count 240
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 423 place count 142 transition count 199
Iterating global reduction 2 with 41 rules applied. Total rules applied 464 place count 142 transition count 199
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 477 place count 142 transition count 186
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 497 place count 122 transition count 164
Iterating global reduction 3 with 20 rules applied. Total rules applied 517 place count 122 transition count 164
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 530 place count 122 transition count 151
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 534 place count 118 transition count 145
Iterating global reduction 4 with 4 rules applied. Total rules applied 538 place count 118 transition count 145
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 542 place count 114 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 546 place count 114 transition count 141
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 547 place count 113 transition count 140
Iterating global reduction 4 with 1 rules applied. Total rules applied 548 place count 113 transition count 140
Applied a total of 548 rules in 80 ms. Remains 113 /259 variables (removed 146) and now considering 140/749 (removed 609) transitions.
// Phase 1: matrix 140 rows 113 cols
[2025-06-05 22:10:15] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:15] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-05 22:10:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:16] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-05 22:10:16] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-05 22:10:16] [INFO ] Invariant cache hit.
[2025-06-05 22:10:16] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:18] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:18] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 140/253 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 63/183 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:21] [INFO ] Deduced a trap composed of 23 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 22:10:21] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:21] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 10 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 3/186 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/253 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 186 constraints, problems are : Problem set: 3 solved, 136 unsolved in 10608 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/113 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/10 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 140/253 variables, 113/123 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 63/186 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 136/322 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/322 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/253 variables, 0/322 constraints. Problems are: Problem set: 3 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 322 constraints, problems are : Problem set: 3 solved, 136 unsolved in 21293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 136/139 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32138ms problems are : Problem set: 3 solved, 136 unsolved
Search for dead transitions found 3 dead transitions in 32152ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 113/259 places, 137/749 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 110 transition count 137
Applied a total of 3 rules in 2 ms. Remains 110 /113 variables (removed 3) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 110 cols
[2025-06-05 22:10:48] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:48] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 22:10:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:48] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-05 22:10:48] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 110/259 places, 137/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33329 ms. Remains : 110/259 places, 137/749 transitions.
Support contains 9 out of 110 places after structural reductions.
[2025-06-05 22:10:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-05 22:10:49] [INFO ] Flatten gal took : 38 ms
[2025-06-05 22:10:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 22:10:49] [INFO ] Flatten gal took : 14 ms
[2025-06-05 22:10:49] [INFO ] Input system was already deterministic with 137 transitions.
Support contains 4 out of 110 places (down from 9) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8995 resets) in 1123 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4212 resets) in 626 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4048 resets) in 411 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4160 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4135 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 821238 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 4
Probabilistic random walk after 821238 steps, saw 347856 distinct states, run finished after 3008 ms. (steps per millisecond=273 ) properties seen :0
[2025-06-05 22:10:53] [INFO ] Invariant cache hit.
[2025-06-05 22:10:53] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:53] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 121/207 variables, 86/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 247/247 variables, and 161 constraints, problems are : Problem set: 4 solved, 0 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 46/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 22:10:53] [INFO ] Flatten gal took : 8 ms
[2025-06-05 22:10:53] [INFO ] Flatten gal took : 9 ms
[2025-06-05 22:10:53] [INFO ] Input system was already deterministic with 137 transitions.
Computed a total of 26 stabilizing places and 32 stable transitions
Graph (complete) has 357 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 137/137 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 102 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 102 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 21 place count 102 transition count 113
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 96 transition count 107
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 96 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 92 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 89 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 89 transition count 97
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 86 transition count 94
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 86 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 86 transition count 93
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 83 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 66 place count 81 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 80 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 80 transition count 85
Applied a total of 70 rules in 27 ms. Remains 80 /110 variables (removed 30) and now considering 85/137 (removed 52) transitions.
// Phase 1: matrix 85 rows 80 cols
[2025-06-05 22:10:53] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:53] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-05 22:10:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 22:10:53] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-05 22:10:53] [INFO ] Invariant cache hit.
[2025-06-05 22:10:53] [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/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/165 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 34/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 119 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4874 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/165 variables, 80/85 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 84/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:11:03] [INFO ] Deduced a trap along path composed of 17 places in 33 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 204 constraints, problems are : Problem set: 0 solved, 84 unsolved in 15050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19974ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 19975ms
Starting structural reductions in LTL mode, iteration 1 : 80/110 places, 85/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20275 ms. Remains : 80/110 places, 85/137 transitions.
[2025-06-05 22:11:13] [INFO ] Flatten gal took : 11 ms
[2025-06-05 22:11:13] [INFO ] Flatten gal took : 4 ms
[2025-06-05 22:11:13] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-05 22:11:13] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:11:13] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:11:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11481422650565158183.gal : 2 ms
[2025-06-05 22:11:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality9898674177775119862.ctl : 2 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/CTLCardinality11481422650565158183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9898674177775119862.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75129e+12,25.705,586060,2,23141,5,2.44494e+06,6,0,405,2.08558e+06,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,25.7077,586060,1,0,6,2.44494e+06,7,1,544,2.08558e+06,1
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 137/137 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 102 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 102 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 21 place count 102 transition count 113
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 96 transition count 107
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 96 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 92 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 89 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 89 transition count 97
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 86 transition count 94
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 86 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 86 transition count 93
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 83 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 66 place count 81 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 80 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 80 transition count 85
Applied a total of 70 rules in 18 ms. Remains 80 /110 variables (removed 30) and now considering 85/137 (removed 52) transitions.
[2025-06-05 22:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:11:39] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 22:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:11:39] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 22:11:39] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-05 22:11:39] [INFO ] Invariant cache hit.
[2025-06-05 22:11:39] [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/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/165 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 34/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:11:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 119 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/165 variables, 80/85 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 84/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:11:49] [INFO ] Deduced a trap along path composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 204 constraints, problems are : Problem set: 0 solved, 84 unsolved in 15223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20012ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 20012ms
Starting structural reductions in LTL mode, iteration 1 : 80/110 places, 85/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20330 ms. Remains : 80/110 places, 85/137 transitions.
[2025-06-05 22:11:59] [INFO ] Flatten gal took : 8 ms
[2025-06-05 22:11:59] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:11:59] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-05 22:11:59] [INFO ] Flatten gal took : 7 ms
[2025-06-05 22:11:59] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:11:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality13488114059623533551.gal : 1 ms
[2025-06-05 22:11:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13078863317873179084.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/CTLCardinality13488114059623533551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13078863317873179084.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75129e+12,25.562,585608,2,23141,5,2.44494e+06,6,0,405,2.08558e+06,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,25.565,585608,1,0,6,2.44494e+06,7,1,544,2.08558e+06,1
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 137/137 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 102 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 102 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 21 place count 102 transition count 113
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 96 transition count 107
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 96 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 92 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 89 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 89 transition count 97
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 86 transition count 94
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 86 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 86 transition count 93
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 83 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 66 place count 81 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 80 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 80 transition count 85
Applied a total of 70 rules in 16 ms. Remains 80 /110 variables (removed 30) and now considering 85/137 (removed 52) transitions.
[2025-06-05 22:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:12:25] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 22:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:12:25] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 22:12:25] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-05 22:12:25] [INFO ] Invariant cache hit.
[2025-06-05 22:12:25] [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/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/165 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 34/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:12:27] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 119 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4928 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/165 variables, 80/85 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 84/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:12:35] [INFO ] Deduced a trap along path composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 204 constraints, problems are : Problem set: 0 solved, 84 unsolved in 15290 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20244ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 20244ms
Starting structural reductions in LTL mode, iteration 1 : 80/110 places, 85/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20481 ms. Remains : 80/110 places, 85/137 transitions.
[2025-06-05 22:12:46] [INFO ] Flatten gal took : 8 ms
[2025-06-05 22:12:46] [INFO ] Flatten gal took : 4 ms
[2025-06-05 22:12:46] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-05 22:12:46] [INFO ] Flatten gal took : 4 ms
[2025-06-05 22:12:46] [INFO ] Flatten gal took : 4 ms
[2025-06-05 22:12:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality17594805039471944598.gal : 1 ms
[2025-06-05 22:12:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6298766075749619050.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/CTLCardinality17594805039471944598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6298766075749619050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75129e+12,26.3201,584404,2,23141,5,2.44494e+06,6,0,405,2.08558e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 22:13:16] [INFO ] Flatten gal took : 10 ms
[2025-06-05 22:13:16] [INFO ] Applying decomposition
[2025-06-05 22:13:16] [INFO ] Flatten gal took : 4 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/graph8440473688156910565.txt' '-o' '/tmp/graph8440473688156910565.bin' '-w' '/tmp/graph8440473688156910565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8440473688156910565.bin' '-l' '-1' '-v' '-w' '/tmp/graph8440473688156910565.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:13:16] [INFO ] Decomposing Gal with order
[2025-06-05 22:13:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:13:16] [INFO ] Removed a total of 77 redundant transitions.
[2025-06-05 22:13:16] [INFO ] Flatten gal took : 40 ms
[2025-06-05 22:13:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 8 ms.
[2025-06-05 22:13:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality8404504427901300668.gal : 3 ms
[2025-06-05 22:13:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17214593705501259307.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/CTLCardinality8404504427901300668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17214593705501259307.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 22:13:46] [INFO ] Flatten gal took : 7 ms
[2025-06-05 22:13:46] [INFO ] Flatten gal took : 7 ms
[2025-06-05 22:13:46] [INFO ] Applying decomposition
[2025-06-05 22:13:46] [INFO ] Flatten gal took : 6 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/graph10299915238163349088.txt' '-o' '/tmp/graph10299915238163349088.bin' '-w' '/tmp/graph10299915238163349088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10299915238163349088.bin' '-l' '-1' '-v' '-w' '/tmp/graph10299915238163349088.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:13:46] [INFO ] Decomposing Gal with order
[2025-06-05 22:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:13:46] [INFO ] Removed a total of 127 redundant transitions.
[2025-06-05 22:13:46] [INFO ] Flatten gal took : 24 ms
[2025-06-05 22:13:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 14 ms.
[2025-06-05 22:13:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality9455717798327296160.gal : 3 ms
[2025-06-05 22:13:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality14688230380122848047.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/CTLCardinality9455717798327296160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14688230380122848047.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 22:34:57] [INFO ] Flatten gal took : 8 ms
[2025-06-05 22:34:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality16764540538563117013.gal : 1 ms
[2025-06-05 22:34:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality12913987792183844348.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/CTLCardinality16764540538563117013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12913987792183844348.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21535e+15,203.235,3157620,2,40884,5,1.39742e+07,6,0,577,1.50937e+07,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t13, t25, t26, t27, t28, t32, t34, t39, t41, t45, t47, t48, t51, t52, t53, t54, t62,...425
(forward)formula 0,1,215.737,3162736,1,0,304,1.39742e+07,295,121,4311,1.50937e+07,334
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1698383 ms.

BK_STOP 1749163113733

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-d1m36"
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-d1m36, 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-174901994300425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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