Execution Chart

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

Trace from the execution

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

--------------------
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-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749176009017

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
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
CTLFireability PT
Running Version 202505121319
[2025-06-06 02:13:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 02:13:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:13:30] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-06-06 02:13:30] [INFO ] Transformed 2398 places.
[2025-06-06 02:13:30] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:13:30] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 1984 places in 26 ms
Reduce places removed 1984 places and 0 transitions.
Support contains 67 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 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 929 place count 313 transition count 976
Iterating global reduction 1 with 76 rules applied. Total rules applied 1005 place count 313 transition count 976
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 1017 place count 313 transition count 964
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1063 place count 267 transition count 918
Iterating global reduction 2 with 46 rules applied. Total rules applied 1109 place count 267 transition count 918
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 1134 place count 267 transition count 893
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1154 place count 247 transition count 871
Iterating global reduction 3 with 20 rules applied. Total rules applied 1174 place count 247 transition count 871
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 1286 place count 247 transition count 759
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1287 place count 246 transition count 757
Iterating global reduction 4 with 1 rules applied. Total rules applied 1288 place count 246 transition count 757
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1289 place count 245 transition count 756
Iterating global reduction 4 with 1 rules applied. Total rules applied 1290 place count 245 transition count 756
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1291 place count 244 transition count 755
Iterating global reduction 4 with 1 rules applied. Total rules applied 1292 place count 244 transition count 755
Applied a total of 1292 rules in 115 ms. Remains 244 /414 variables (removed 170) and now considering 755/1954 (removed 1199) transitions.
// Phase 1: matrix 755 rows 244 cols
[2025-06-06 02:13:30] [INFO ] Computed 5 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:31] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-06-06 02:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:13:31] [INFO ] State equation strengthened by 573 read => feed constraints.
[2025-06-06 02:13:33] [INFO ] Implicit Places using invariants and state equation in 2024 ms returned []
Implicit Place search using SMT with State Equation took 2460 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2025-06-06 02:13:33] [INFO ] Invariant cache hit.
[2025-06-06 02:13:33] [INFO ] State equation strengthened by 573 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:41] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:41] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 1/244 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:56] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:57] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:58] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:13:58] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/999 variables, and 20 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/244 constraints, ReadFeed: 0/573 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 1/244 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:14:13] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:14:13] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:14:17] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:14:17] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:14:21] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:14:22] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
At refinement iteration 10 (OVERLAPS) 755/999 variables, 244/270 constraints. Problems are: Problem set: 51 solved, 703 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/999 variables, 573/843 constraints. Problems are: Problem set: 51 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/999 variables, and 1546 constraints, problems are : Problem set: 51 solved, 703 unsolved in 30448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 244/244 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 703/754 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61664ms problems are : Problem set: 51 solved, 703 unsolved
Search for dead transitions found 51 dead transitions in 61682ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in LTL mode, iteration 1 : 244/414 places, 704/1954 transitions.
Reduce places removed 61 places and 501 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 183 transition count 175
Reduce places removed 15 places and 18 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 104 place count 168 transition count 157
Reduce places removed 10 places and 11 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 114 place count 158 transition count 146
Reduce places removed 6 places and 20 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 120 place count 152 transition count 126
Reduce places removed 12 places and 16 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 132 place count 140 transition count 110
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 135 place count 137 transition count 107
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 138 place count 137 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 140 place count 137 transition count 105
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 141 place count 136 transition count 104
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 136 transition count 104
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 142 rules in 8 ms. Remains 136 /244 variables (removed 108) and now considering 104/704 (removed 600) transitions.
// Phase 1: matrix 104 rows 136 cols
[2025-06-06 02:14:34] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:34] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 02:14:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:34] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-06 02:14:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 136/414 places, 104/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64489 ms. Remains : 136/414 places, 104/1954 transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Support contains 5 out of 90 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:14:35] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2025-06-06 02:14:35] [INFO ] Flatten gal took : 28 ms
[2025-06-06 02:14:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:14:35] [INFO ] Flatten gal took : 14 ms
[2025-06-06 02:14:35] [INFO ] Input system was already deterministic with 104 transitions.
Support contains 4 out of 90 places (down from 5) after GAL structural reductions.
RANDOM walk for 40000 steps (8922 resets) in 1120 ms. (35 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1861 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1858 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1863 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Probably explored full state space saw : 995 states, properties seen :1
Probabilistic random walk after 2410 steps, saw 995 distinct states, run finished after 24 ms. (steps per millisecond=100 ) properties seen :1
Explored full state space saw : 995 states, properties seen :0
Exhaustive walk after 2410 steps, saw 995 distinct states, run finished after 16 ms. (steps per millisecond=150 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:14:35] [INFO ] Flatten gal took : 8 ms
[2025-06-06 02:14:35] [INFO ] Flatten gal took : 8 ms
[2025-06-06 02:14:35] [INFO ] Input system was already deterministic with 104 transitions.
Computed a total of 90 stabilizing places and 104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 104
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 104/104 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 88 transition count 103
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 79 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 79 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 79 transition count 85
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 73 transition count 78
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 73 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 73 transition count 77
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 44 place count 67 transition count 70
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 67 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 67 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 55 place count 64 transition count 65
Iterating global reduction 4 with 3 rules applied. Total rules applied 58 place count 64 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 64 transition count 64
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 63 transition count 63
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 63 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 62 place count 62 transition count 61
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 62 transition count 61
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 64 place count 61 transition count 60
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 61 transition count 60
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 66 place count 60 transition count 59
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 60 transition count 59
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 59 transition count 58
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 59 transition count 58
Applied a total of 69 rules in 9 ms. Remains 59 /90 variables (removed 31) and now considering 58/104 (removed 46) transitions.
// Phase 1: matrix 58 rows 59 cols
[2025-06-06 02:14:35] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 02:14:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-06 02:14:36] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 02:14:36] [INFO ] Invariant cache hit.
[2025-06-06 02:14:36] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 4 (OVERLAPS) 58/117 variables, 59/62 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 20/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 82 constraints, problems are : Problem set: 4 solved, 53 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 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, 1/1 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 58/115 variables, 57/60 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 20/80 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 7/87 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 2/117 variables, 2/89 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 46/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/117 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 135 constraints, problems are : Problem set: 4 solved, 53 unsolved in 5137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 53/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6953ms problems are : Problem set: 4 solved, 53 unsolved
Search for dead transitions found 4 dead transitions in 6954ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 59/90 places, 54/104 transitions.
Reduce places removed 5 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 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 11 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 13 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 15 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 18 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 19 place count 43 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 20 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 42 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 41 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 41 transition count 40
Applied a total of 24 rules in 9 ms. Remains 41 /59 variables (removed 18) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-06 02:14:42] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 02:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:43] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-06 02:14:43] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/90 places, 40/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7204 ms. Remains : 41/90 places, 40/104 transitions.
[2025-06-06 02:14:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:14:43] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:14:43] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-06 02:14:43] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:14:43] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:14:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2033800130645770914.gal : 2 ms
[2025-06-06 02:14:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13906328647282266435.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/CTLFireability2033800130645770914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13906328647282266435.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.024003,4336,2,483,5,2079,6,0,206,1574,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.0245,4336,1,0,6,2079,7,1,278,1574,1
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 104/104 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 88 transition count 103
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 79 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 79 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 79 transition count 85
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 73 transition count 78
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 73 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 73 transition count 77
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 44 place count 67 transition count 70
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 67 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 67 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 55 place count 64 transition count 65
Iterating global reduction 4 with 3 rules applied. Total rules applied 58 place count 64 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 64 transition count 64
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 63 transition count 63
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 63 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 62 place count 62 transition count 61
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 62 transition count 61
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 64 place count 61 transition count 60
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 61 transition count 60
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 66 place count 60 transition count 59
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 60 transition count 59
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 59 transition count 58
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 59 transition count 58
Applied a total of 69 rules in 15 ms. Remains 59 /90 variables (removed 31) and now considering 58/104 (removed 46) transitions.
// Phase 1: matrix 58 rows 59 cols
[2025-06-06 02:14:43] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 02:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-06 02:14:43] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 02:14:43] [INFO ] Invariant cache hit.
[2025-06-06 02:14:43] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 4 (OVERLAPS) 58/117 variables, 59/62 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 20/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 82 constraints, problems are : Problem set: 4 solved, 53 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 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, 1/1 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 58/115 variables, 57/60 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 20/80 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 7/87 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 2/117 variables, 2/89 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 46/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/117 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 135 constraints, problems are : Problem set: 4 solved, 53 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 53/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6819ms problems are : Problem set: 4 solved, 53 unsolved
Search for dead transitions found 4 dead transitions in 6819ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 59/90 places, 54/104 transitions.
Reduce places removed 5 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 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 11 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 13 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 15 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 18 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 19 place count 43 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 20 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 42 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 41 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 41 transition count 40
Applied a total of 24 rules in 2 ms. Remains 41 /59 variables (removed 18) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-06 02:14:50] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 02:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-06 02:14:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/90 places, 40/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7067 ms. Remains : 41/90 places, 40/104 transitions.
[2025-06-06 02:14:50] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:14:50] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:14:50] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-06 02:14:50] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:14:50] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:14:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1919358792328033268.gal : 1 ms
[2025-06-06 02:14:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16189967873793219442.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/CTLFireability1919358792328033268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16189967873793219442.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.013973,4380,2,483,5,2079,6,0,206,1574,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.014425,4380,1,0,6,2079,7,1,278,1574,1
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 104/104 transitions.
Graph (complete) has 278 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 103
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 80 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 80 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 80 transition count 87
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 74 transition count 80
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 74 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 74 transition count 79
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 40 place count 69 transition count 73
Iterating global reduction 3 with 5 rules applied. Total rules applied 45 place count 69 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 69 transition count 71
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 49 place count 67 transition count 69
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 67 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 66 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 66 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 65 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 65 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 64 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 64 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 63 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 63 transition count 64
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 62 transition count 63
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 62 transition count 63
Applied a total of 61 rules in 20 ms. Remains 62 /90 variables (removed 28) and now considering 63/104 (removed 41) transitions.
// Phase 1: matrix 63 rows 62 cols
[2025-06-06 02:14:50] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:50] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 02:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:50] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-06 02:14:50] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:14:50] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2025-06-06 02:14:50] [INFO ] Invariant cache hit.
[2025-06-06 02:14:50] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 4 (OVERLAPS) 63/125 variables, 62/65 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 24/89 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/89 constraints. Problems are: Problem set: 4 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 89 constraints, problems are : Problem set: 4 solved, 58 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 2/60 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 63/123 variables, 60/63 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 24/87 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 7/94 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/94 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 2/125 variables, 2/96 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 51/147 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/147 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/147 constraints. Problems are: Problem set: 4 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 147 constraints, problems are : Problem set: 4 solved, 58 unsolved in 6171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 58/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8143ms problems are : Problem set: 4 solved, 58 unsolved
Search for dead transitions found 4 dead transitions in 8144ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 62/90 places, 59/104 transitions.
Graph (complete) has 173 edges and 62 vertex of which 58 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 53 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 51 transition count 51
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 138 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 47 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 47 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 14 place count 46 transition count 47
Iterating global reduction 4 with 1 rules applied. Total rules applied 15 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 45 transition count 46
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 45 transition count 46
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 44 transition count 45
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 44 transition count 45
Applied a total of 19 rules in 15 ms. Remains 44 /62 variables (removed 18) and now considering 45/59 (removed 14) transitions.
// Phase 1: matrix 45 rows 44 cols
[2025-06-06 02:14:58] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:58] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 02:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:58] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-06 02:14:58] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/90 places, 45/104 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8404 ms. Remains : 44/90 places, 45/104 transitions.
[2025-06-06 02:14:58] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:14:58] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:14:58] [INFO ] Input system was already deterministic with 45 transitions.
[2025-06-06 02:14:58] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:14:58] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:14:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5577520607842525550.gal : 1 ms
[2025-06-06 02:14:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6434969564171770222.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/CTLFireability5577520607842525550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6434969564171770222.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,587,0.016486,4464,2,560,5,2496,6,0,223,2051,0


Converting to forward existential form...Done !
original formula: AF(((s1>=1)&&(l2252>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((s1>=1)&&(l2252>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/45
(forward)formula 0,0,0.100386,9072,1,0,48,21747,19,4,1127,17816,45
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 104/104 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 88 transition count 103
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 79 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 79 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 79 transition count 85
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 73 transition count 78
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 73 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 73 transition count 77
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 44 place count 67 transition count 70
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 67 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 67 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 55 place count 64 transition count 65
Iterating global reduction 4 with 3 rules applied. Total rules applied 58 place count 64 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 64 transition count 64
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 63 transition count 63
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 63 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 62 place count 62 transition count 61
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 62 transition count 61
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 64 place count 61 transition count 60
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 61 transition count 60
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 66 place count 60 transition count 59
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 60 transition count 59
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 59 transition count 58
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 59 transition count 58
Applied a total of 69 rules in 8 ms. Remains 59 /90 variables (removed 31) and now considering 58/104 (removed 46) transitions.
// Phase 1: matrix 58 rows 59 cols
[2025-06-06 02:14:58] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 02:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:14:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-06 02:14:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 02:14:58] [INFO ] Invariant cache hit.
[2025-06-06 02:14:58] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 4 (OVERLAPS) 58/117 variables, 59/62 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 20/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/82 constraints. Problems are: Problem set: 4 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 82 constraints, problems are : Problem set: 4 solved, 53 unsolved in 1799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 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, 1/1 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 58/115 variables, 57/60 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 20/80 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 7/87 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 2/117 variables, 2/89 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 46/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/117 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 135 constraints, problems are : Problem set: 4 solved, 53 unsolved in 5112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 53/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6925ms problems are : Problem set: 4 solved, 53 unsolved
Search for dead transitions found 4 dead transitions in 6925ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 59/90 places, 54/104 transitions.
Reduce places removed 5 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 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 11 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 13 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 15 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 18 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 19 place count 43 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 20 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 42 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 41 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 41 transition count 40
Applied a total of 24 rules in 3 ms. Remains 41 /59 variables (removed 18) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-06 02:15:05] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:15:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 02:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:15:05] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-06 02:15:05] [INFO ] Implicit Places using invariants and state equation in 67 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/90 places, 40/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7179 ms. Remains : 41/90 places, 40/104 transitions.
[2025-06-06 02:15:05] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:15:05] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:15:05] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-06 02:15:05] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:15:05] [INFO ] Flatten gal took : 2 ms
[2025-06-06 02:15:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8162138464303021554.gal : 1 ms
[2025-06-06 02:15:05] [INFO ] Time to serialize properties into /tmp/CTLFireability9175696887987001855.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/CTLFireability8162138464303021554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9175696887987001855.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.014874,4388,2,483,5,2079,6,0,206,1574,0


Converting to forward existential form...Done !
original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 0,1,0.015467,4388,1,0,7,2079,7,1,284,1574,2
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 02:15:06] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:15:06] [INFO ] Flatten gal took : 5 ms
Total runtime 95857 ms.

BK_STOP 1749176106079

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="CTLFireability"
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 CTLFireability"
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-174901994400450"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;