Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 1.1M 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-d2m04-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749175881487

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-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 02:11:22] [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-06 02:11:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:11:23] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2025-06-06 02:11:23] [INFO ] Transformed 2398 places.
[2025-06-06 02:11:23] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:11:23] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Deduced a syphon composed of 1984 places in 33 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 113 places :
Symmetric choice reduction at 1 with 113 rule applications. Total rules 966 place count 276 transition count 399
Iterating global reduction 1 with 113 rules applied. Total rules applied 1079 place count 276 transition count 399
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 1092 place count 276 transition count 386
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1167 place count 201 transition count 311
Iterating global reduction 2 with 75 rules applied. Total rules applied 1242 place count 201 transition count 311
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 1265 place count 201 transition count 288
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1309 place count 157 transition count 233
Iterating global reduction 3 with 44 rules applied. Total rules applied 1353 place count 157 transition count 233
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1377 place count 157 transition count 209
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1384 place count 150 transition count 190
Iterating global reduction 4 with 7 rules applied. Total rules applied 1391 place count 150 transition count 190
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1398 place count 143 transition count 183
Iterating global reduction 4 with 7 rules applied. Total rules applied 1405 place count 143 transition count 183
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1408 place count 140 transition count 179
Iterating global reduction 4 with 3 rules applied. Total rules applied 1411 place count 140 transition count 179
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1414 place count 137 transition count 176
Iterating global reduction 4 with 3 rules applied. Total rules applied 1417 place count 137 transition count 176
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1420 place count 134 transition count 173
Iterating global reduction 4 with 3 rules applied. Total rules applied 1423 place count 134 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1424 place count 133 transition count 172
Iterating global reduction 4 with 1 rules applied. Total rules applied 1425 place count 133 transition count 172
Applied a total of 1425 rules in 109 ms. Remains 133 /414 variables (removed 281) and now considering 172/1954 (removed 1782) transitions.
// Phase 1: matrix 172 rows 133 cols
[2025-06-06 02:11:23] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:11:23] [INFO ] Implicit Places using invariants in 389 ms returned []
[2025-06-06 02:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:11:24] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-06 02:11:24] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2025-06-06 02:11:24] [INFO ] Invariant cache hit.
[2025-06-06 02:11:24] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:25] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:26] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 1/133 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:28] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:28] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:28] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:28] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:28] [INFO ] Deduced a trap composed of 40 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-06 02:11:28] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:28] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Problem TDEAD134 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 7 (OVERLAPS) 172/305 variables, 133/147 constraints. Problems are: Problem set: 3 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 76/223 constraints. Problems are: Problem set: 3 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:33] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 4 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/224 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/224 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/305 variables, 0/224 constraints. Problems are: Problem set: 17 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 224 constraints, problems are : Problem set: 17 solved, 154 unsolved in 26742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 2/2 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 6/117 variables, 2/4 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/6 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/8 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 11/128 variables, 1/9 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 6/15 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 171/299 variables, 128/143 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 75/218 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 16/234 constraints. Problems are: Problem set: 17 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:11:56] [INFO ] Deduced a trap along path composed of 5 places in 42 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 1/235 constraints. Problems are: Problem set: 17 solved, 154 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/235 constraints. Problems are: Problem set: 17 solved, 154 unsolved
Problem TDEAD133 is UNSAT
At refinement iteration 14 (OVERLAPS) 6/305 variables, 5/240 constraints. Problems are: Problem set: 18 solved, 153 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/305 variables, 1/241 constraints. Problems are: Problem set: 18 solved, 153 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/305 variables, 138/379 constraints. Problems are: Problem set: 18 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 379 constraints, problems are : Problem set: 18 solved, 153 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 154/171 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56999ms problems are : Problem set: 18 solved, 153 unsolved
Search for dead transitions found 18 dead transitions in 57012ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 133/414 places, 154/1954 transitions.
Reduce places removed 26 places and 33 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 107 transition count 116
Reduce places removed 13 places and 14 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 44 place count 94 transition count 102
Reduce places removed 6 places and 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 88 transition count 96
Reduce places removed 3 places and 6 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 85 transition count 90
Reduce places removed 3 places and 4 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 56 place count 82 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 81 transition count 85
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 81 transition count 85
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 58 rules in 5 ms. Remains 81 /133 variables (removed 52) and now considering 85/154 (removed 69) transitions.
// Phase 1: matrix 85 rows 81 cols
[2025-06-06 02:12:21] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 02:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:21] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-06 02:12:21] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 81/414 places, 85/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58274 ms. Remains : 81/414 places, 85/1954 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Support contains 5 out of 76 places after structural reductions.
[2025-06-06 02:12:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-06 02:12:21] [INFO ] Flatten gal took : 27 ms
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:12:21] [INFO ] Flatten gal took : 10 ms
[2025-06-06 02:12:21] [INFO ] Input system was already deterministic with 85 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8982 resets) in 941 ms. (42 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4136 resets) in 394 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4092 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4102 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4126 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4172 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
Probably explored full state space saw : 1207 states, properties seen :3
Probabilistic random walk after 2899 steps, saw 1207 distinct states, run finished after 32 ms. (steps per millisecond=90 ) properties seen :3
Explored full state space saw : 1207 states, properties seen :0
Exhaustive walk after 2899 steps, saw 1207 distinct states, run finished after 13 ms. (steps per millisecond=223 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:12:22] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:12:22] [INFO ] Flatten gal took : 7 ms
[2025-06-06 02:12:22] [INFO ] Input system was already deterministic with 85 transitions.
Computed a total of 76 stabilizing places and 85 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 85
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 85/85 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 69 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 69 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 65 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 65 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 63 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 63 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 61 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 61 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 61 transition count 62
Applied a total of 37 rules in 6 ms. Remains 61 /76 variables (removed 15) and now considering 62/85 (removed 23) transitions.
// Phase 1: matrix 62 rows 61 cols
[2025-06-06 02:12:22] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:22] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 02:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:22] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-06 02:12:22] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-06 02:12:22] [INFO ] Invariant cache hit.
[2025-06-06 02:12:22] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 4 (OVERLAPS) 62/123 variables, 61/63 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 21/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 84 constraints, problems are : Problem set: 8 solved, 53 unsolved in 1950 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 61/118 variables, 57/59 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/79 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 6/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 5/123 variables, 4/89 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/90 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 47/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 137 constraints, problems are : Problem set: 8 solved, 53 unsolved in 4951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 53/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6927ms problems are : Problem set: 8 solved, 53 unsolved
Search for dead transitions found 8 dead transitions in 6928ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 61/76 places, 54/85 transitions.
Reduce places removed 7 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 51
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 50 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 48 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 46 transition count 44
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 20 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 43 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 42 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 25 place count 41 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 41 transition count 40
Applied a total of 26 rules in 13 ms. Remains 41 /61 variables (removed 20) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-06 02:12:29] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 02:12:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-06 02:12:29] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/76 places, 40/85 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7188 ms. Remains : 41/76 places, 40/85 transitions.
[2025-06-06 02:12:29] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:12:29] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:12:29] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-06 02:12:29] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:12:29] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:12:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12168311484449089784.gal : 2 ms
[2025-06-06 02:12:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9424028775109272300.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/CTLCardinality12168311484449089784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9424028775109272300.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,445,0.021325,4248,2,470,5,2074,6,0,206,1596,0


Converting to forward existential form...Done !
original formula: AG(AX(FALSE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(FALSE))] = FALSE
(forward)formula 0,0,0.02436,4248,1,0,6,2074,7,1,366,1596,1
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 85/85 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 69 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 69 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 65 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 65 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 63 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 63 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 61 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 61 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 61 transition count 62
Applied a total of 37 rules in 14 ms. Remains 61 /76 variables (removed 15) and now considering 62/85 (removed 23) transitions.
// Phase 1: matrix 62 rows 61 cols
[2025-06-06 02:12:29] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 02:12:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-06 02:12:29] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-06 02:12:29] [INFO ] Invariant cache hit.
[2025-06-06 02:12:29] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 4 (OVERLAPS) 62/123 variables, 61/63 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 21/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 84 constraints, problems are : Problem set: 8 solved, 53 unsolved in 1847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 61/118 variables, 57/59 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/79 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 6/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 5/123 variables, 4/89 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/90 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 47/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 137 constraints, problems are : Problem set: 8 solved, 53 unsolved in 4897 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 53/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6768ms problems are : Problem set: 8 solved, 53 unsolved
Search for dead transitions found 8 dead transitions in 6769ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 61/76 places, 54/85 transitions.
Reduce places removed 7 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 51
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 50 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 48 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 46 transition count 44
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 20 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 43 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 42 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 25 place count 41 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 41 transition count 40
Applied a total of 26 rules in 8 ms. Remains 41 /61 variables (removed 20) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-06 02:12:36] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 02:12:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-06 02:12:36] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/76 places, 40/85 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7038 ms. Remains : 41/76 places, 40/85 transitions.
[2025-06-06 02:12:36] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:12:36] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:12:36] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-06 02:12:36] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:12:36] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:12:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality12284021676476325139.gal : 1 ms
[2025-06-06 02:12:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4963542473229408592.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/CTLCardinality12284021676476325139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4963542473229408592.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,445,0.014077,4380,2,470,5,2074,6,0,206,1596,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.014576,4380,1,0,6,2074,7,1,277,1596,1
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 85/85 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 69 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 69 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 65 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 65 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 63 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 63 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 61 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 61 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 61 transition count 62
Applied a total of 37 rules in 3 ms. Remains 61 /76 variables (removed 15) and now considering 62/85 (removed 23) transitions.
// Phase 1: matrix 62 rows 61 cols
[2025-06-06 02:12:36] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 02:12:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-06 02:12:37] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-06 02:12:37] [INFO ] Invariant cache hit.
[2025-06-06 02:12:37] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 4 (OVERLAPS) 62/123 variables, 61/63 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 21/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 84 constraints, problems are : Problem set: 8 solved, 53 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 61/118 variables, 57/59 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/79 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 6/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 5/123 variables, 4/89 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/90 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 47/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 137 constraints, problems are : Problem set: 8 solved, 53 unsolved in 4898 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 53/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6781ms problems are : Problem set: 8 solved, 53 unsolved
Search for dead transitions found 8 dead transitions in 6781ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 61/76 places, 54/85 transitions.
Reduce places removed 7 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 51
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 50 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 48 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 46 transition count 44
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 20 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 43 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 42 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 25 place count 41 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 41 transition count 40
Applied a total of 26 rules in 10 ms. Remains 41 /61 variables (removed 20) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-06 02:12:43] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 02:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:43] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-06 02:12:43] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/76 places, 40/85 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7023 ms. Remains : 41/76 places, 40/85 transitions.
[2025-06-06 02:12:43] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:12:43] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:12:43] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-06 02:12:43] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:12:43] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:12:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3725667735404619013.gal : 1 ms
[2025-06-06 02:12:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality18410235322702244620.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/CTLCardinality3725667735404619013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18410235322702244620.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,445,0.013861,4384,2,470,5,2074,6,0,206,1596,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U EX(TRUE))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t15, t17, t26, t28, t31, t32, t33, t34, t35, t37, t38, Intersection with reachable ...224
(forward)formula 0,0,0.080732,8096,1,0,134,18916,105,54,1334,16939,139
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 85/85 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 69 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 69 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 65 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 65 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 63 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 63 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 61 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 61 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 61 transition count 62
Applied a total of 37 rules in 11 ms. Remains 61 /76 variables (removed 15) and now considering 62/85 (removed 23) transitions.
// Phase 1: matrix 62 rows 61 cols
[2025-06-06 02:12:44] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-06 02:12:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-06 02:12:44] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-06 02:12:44] [INFO ] Invariant cache hit.
[2025-06-06 02:12:44] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 4 (OVERLAPS) 62/123 variables, 61/63 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 21/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 84 constraints, problems are : Problem set: 8 solved, 53 unsolved in 1902 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 61/118 variables, 57/59 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/79 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 6/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 5/123 variables, 4/89 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/90 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 47/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 137 constraints, problems are : Problem set: 8 solved, 53 unsolved in 4924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 53/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6844ms problems are : Problem set: 8 solved, 53 unsolved
Search for dead transitions found 8 dead transitions in 6845ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 61/76 places, 54/85 transitions.
Reduce places removed 7 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 51
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 50 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 48 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 46 transition count 44
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 20 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 43 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 42 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 25 place count 41 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 41 transition count 40
Applied a total of 26 rules in 5 ms. Remains 41 /61 variables (removed 20) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-06 02:12:51] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:51] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 02:12:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:51] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-06 02:12:51] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/76 places, 40/85 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7113 ms. Remains : 41/76 places, 40/85 transitions.
[2025-06-06 02:12:51] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:12:51] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:12:51] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-06 02:12:51] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:12:51] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:12:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13208506970400201977.gal : 1 ms
[2025-06-06 02:12:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2261840720120597224.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/CTLCardinality13208506970400201977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2261840720120597224.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,445,0.013853,4388,2,470,5,2074,6,0,206,1596,0


Converting to forward existential form...Done !
original formula: EG((AX(FALSE) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(FALSE))) * EX(TRUE)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t15, t17, t26, t28, t31, t32, t33, t34, t35, t37, t38, Intersection with reachable ...224
dead was empty
(forward)formula 0,0,0.070481,7332,1,0,126,15735,97,46,1294,14095,126
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2025-11 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 : 76/76 places, 85/85 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 71 transition count 80
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 71 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 71 transition count 79
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 68 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 68 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 68 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 67 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 67 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 66 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 66 transition count 69
Applied a total of 25 rules in 2 ms. Remains 66 /76 variables (removed 10) and now considering 69/85 (removed 16) transitions.
// Phase 1: matrix 69 rows 66 cols
[2025-06-06 02:12:51] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:51] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 02:12:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:12:51] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-06 02:12:51] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2025-06-06 02:12:51] [INFO ] Invariant cache hit.
[2025-06-06 02:12:51] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/134 variables, 65/67 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 25/92 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/92 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/135 variables, 1/93 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/93 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/93 constraints. Problems are: Problem set: 8 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 93 constraints, problems are : Problem set: 8 solved, 60 unsolved in 3755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/61 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 68/129 variables, 61/63 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 24/87 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 6/93 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 6/135 variables, 5/98 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 1/99 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 54/153 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/153 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 13 (OVERLAPS) 0/135 variables, 0/153 constraints. Problems are: Problem set: 8 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 153 constraints, problems are : Problem set: 8 solved, 60 unsolved in 7849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11632ms problems are : Problem set: 8 solved, 60 unsolved
Search for dead transitions found 8 dead transitions in 11633ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 66/76 places, 61/85 transitions.
Reduce places removed 7 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 59 transition count 58
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 55 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 53 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 51 transition count 51
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 20 place count 49 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 48 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 48 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 47 transition count 48
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 47 transition count 48
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 25 place count 46 transition count 47
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 46 transition count 47
Applied a total of 26 rules in 5 ms. Remains 46 /66 variables (removed 20) and now considering 47/61 (removed 14) transitions.
// Phase 1: matrix 47 rows 46 cols
[2025-06-06 02:13:03] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 02:13:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-06 02:13:03] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/76 places, 47/85 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11943 ms. Remains : 46/76 places, 47/85 transitions.
[2025-06-06 02:13:03] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:13:03] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:13:03] [INFO ] Input system was already deterministic with 47 transitions.
[2025-06-06 02:13:03] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:13:03] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:13:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality16373541873533747299.gal : 0 ms
[2025-06-06 02:13:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality16133716150112185509.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/CTLCardinality16373541873533747299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16133716150112185509.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,653,0.019137,4604,2,589,5,2983,6,0,230,2283,0


Converting to forward existential form...Done !
original formula: EF(AG(((p135>0) * AX(FALSE))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p135>0) * !(EX(!(FALSE))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t13, t16, t18, t29, t31, t34, t36, t38, t39, t40, t41, t42, t44, t45, Intersection ...239
(forward)formula 0,1,0.075962,7420,1,0,104,16797,115,56,1484,13748,107
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 85/85 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 69 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 69 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 65 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 65 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 63 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 63 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 61 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 61 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 61 transition count 62
Applied a total of 37 rules in 6 ms. Remains 61 /76 variables (removed 15) and now considering 62/85 (removed 23) transitions.
// Phase 1: matrix 62 rows 61 cols
[2025-06-06 02:13:03] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 02:13:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-06 02:13:03] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-06 02:13:03] [INFO ] Invariant cache hit.
[2025-06-06 02:13:03] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 4 (OVERLAPS) 62/123 variables, 61/63 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 21/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 84 constraints, problems are : Problem set: 8 solved, 53 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 61/118 variables, 57/59 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/79 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 6/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/85 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 5/123 variables, 4/89 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/90 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 47/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/123 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 137 constraints, problems are : Problem set: 8 solved, 53 unsolved in 4827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 53/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6704ms problems are : Problem set: 8 solved, 53 unsolved
Search for dead transitions found 8 dead transitions in 6704ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 61/76 places, 54/85 transitions.
Reduce places removed 7 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 51
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 50 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 48 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 46 transition count 44
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 20 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 43 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 42 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 25 place count 41 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 41 transition count 40
Applied a total of 26 rules in 4 ms. Remains 41 /61 variables (removed 20) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-06 02:13:10] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 02:13:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-06 02:13:10] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/76 places, 40/85 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6961 ms. Remains : 41/76 places, 40/85 transitions.
[2025-06-06 02:13:10] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:13:10] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:13:10] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-06 02:13:10] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:13:10] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:13:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7150879805910897354.gal : 0 ms
[2025-06-06 02:13:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality2621088626919379378.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/CTLCardinality7150879805910897354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2621088626919379378.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,445,0.013712,4380,2,470,5,2074,6,0,206,1596,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.014171,4380,1,0,6,2074,7,1,277,1596,1
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 85/85 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 70 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 70 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 70 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 67 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 67 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 67 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 65 transition count 68
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 63 transition count 66
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 63 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 63 transition count 65
Applied a total of 31 rules in 2 ms. Remains 63 /76 variables (removed 13) and now considering 65/85 (removed 20) transitions.
// Phase 1: matrix 65 rows 63 cols
[2025-06-06 02:13:10] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 02:13:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:10] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-06 02:13:10] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-06 02:13:10] [INFO ] Invariant cache hit.
[2025-06-06 02:13:10] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 4 (OVERLAPS) 65/128 variables, 63/65 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 23/88 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/88 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/88 constraints. Problems are: Problem set: 8 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 88 constraints, problems are : Problem set: 8 solved, 56 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 64/123 variables, 59/61 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 22/83 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/89 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/89 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 5/128 variables, 4/93 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/94 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 50/144 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 8 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/128 variables, 0/144 constraints. Problems are: Problem set: 8 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 144 constraints, problems are : Problem set: 8 solved, 56 unsolved in 5157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 56/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7350ms problems are : Problem set: 8 solved, 56 unsolved
Search for dead transitions found 8 dead transitions in 7351ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 63/76 places, 57/85 transitions.
Reduce places removed 7 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 56 transition count 54
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 52 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 50 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 48 transition count 47
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 20 place count 46 transition count 46
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 45 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 45 transition count 45
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 44 transition count 44
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 25 place count 43 transition count 43
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 43 transition count 43
Applied a total of 26 rules in 6 ms. Remains 43 /63 variables (removed 20) and now considering 43/57 (removed 14) transitions.
// Phase 1: matrix 43 rows 43 cols
[2025-06-06 02:13:17] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 02:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:17] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-06 02:13:17] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/76 places, 43/85 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7587 ms. Remains : 43/76 places, 43/85 transitions.
[2025-06-06 02:13:17] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:13:17] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:13:17] [INFO ] Input system was already deterministic with 43 transitions.
[2025-06-06 02:13:17] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:13:17] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:13:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality15990642005236734911.gal : 0 ms
[2025-06-06 02:13:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality16113261912209691772.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/CTLCardinality15990642005236734911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16113261912209691772.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,539,0.016052,4356,2,521,5,2445,6,0,217,1795,0


Converting to forward existential form...Done !
original formula: AX(EX(AF((l272>0))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!((l272>0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t13, t16, t18, t22, t29, t31, t34, t35, t36, t37, t38, t40, t41, Intersection with ...234
(forward)formula 0,0,0.09309,8836,1,0,153,22488,108,61,1382,20885,158
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-06 02:13:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:13:17] [INFO ] Flatten gal took : 4 ms
Total runtime 115172 ms.

BK_STOP 1749175998028

--------------------
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-d2m04"
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-d2m04, 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-174901994400449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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