Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 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-d2m06-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749176639068

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 02:24:00] [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:24:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:24:00] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2025-06-06 02:24:00] [INFO ] Transformed 2398 places.
[2025-06-06 02:24:00] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:24:00] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 1984 places in 25 ms
Reduce places removed 1984 places and 0 transitions.
Support contains 59 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 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 930 place count 312 transition count 964
Iterating global reduction 1 with 77 rules applied. Total rules applied 1007 place count 312 transition count 964
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 1022 place count 312 transition count 949
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 1066 place count 268 transition count 905
Iterating global reduction 2 with 44 rules applied. Total rules applied 1110 place count 268 transition count 905
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 1135 place count 268 transition count 880
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1159 place count 244 transition count 854
Iterating global reduction 3 with 24 rules applied. Total rules applied 1183 place count 244 transition count 854
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 1223 place count 244 transition count 814
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1229 place count 238 transition count 800
Iterating global reduction 4 with 6 rules applied. Total rules applied 1235 place count 238 transition count 800
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1241 place count 232 transition count 794
Iterating global reduction 4 with 6 rules applied. Total rules applied 1247 place count 232 transition count 794
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1249 place count 230 transition count 792
Iterating global reduction 4 with 2 rules applied. Total rules applied 1251 place count 230 transition count 792
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1252 place count 229 transition count 791
Iterating global reduction 4 with 1 rules applied. Total rules applied 1253 place count 229 transition count 791
Applied a total of 1253 rules in 127 ms. Remains 229 /414 variables (removed 185) and now considering 791/1954 (removed 1163) transitions.
// Phase 1: matrix 791 rows 229 cols
[2025-06-06 02:24:00] [INFO ] Computed 5 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:24:01] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-06-06 02:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:24:01] [INFO ] State equation strengthened by 618 read => feed constraints.
[2025-06-06 02:24:03] [INFO ] Implicit Places using invariants and state equation in 2579 ms returned []
Implicit Place search using SMT with State Equation took 2963 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2025-06-06 02:24:03] [INFO ] Invariant cache hit.
[2025-06-06 02:24:03] [INFO ] State equation strengthened by 618 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:12] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:12] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:12] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:12] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:17] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:24] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:24] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:28] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 228/1020 variables, and 12 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/229 constraints, ReadFeed: 0/618 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (OVERLAPS) 1/229 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:46] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:46] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:46] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:46] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:47] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:47] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:47] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:47] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:47] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:24:47] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 7 (OVERLAPS) 791/1020 variables, 229/252 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 618/870 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1660 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 229/229 constraints, ReadFeed: 618/618 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61542ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 61558ms
Starting structural reductions in LTL mode, iteration 1 : 229/414 places, 791/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64678 ms. Remains : 229/414 places, 791/1954 transitions.
Support contains 59 out of 229 places after structural reductions.
[2025-06-06 02:25:05] [INFO ] Flatten gal took : 65 ms
[2025-06-06 02:25:05] [INFO ] Flatten gal took : 41 ms
[2025-06-06 02:25:05] [INFO ] Input system was already deterministic with 791 transitions.
Reduction of identical properties reduced properties to check from 66 to 60
RANDOM walk for 40000 steps (8930 resets) in 2450 ms. (16 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (199 resets) in 71 ms. (55 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (183 resets) in 78 ms. (50 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (173 resets) in 62 ms. (63 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (191 resets) in 76 ms. (51 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (179 resets) in 68 ms. (58 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (204 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (173 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (186 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (193 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (203 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (179 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (197 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (183 resets) in 49 ms. (80 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (210 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (188 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (186 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (183 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (424 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (196 resets) in 55 ms. (71 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (191 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (179 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (185 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (190 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (382 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (202 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (202 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (184 resets) in 45 ms. (87 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (205 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (170 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (172 resets) in 64 ms. (61 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (181 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (209 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (199 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (176 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (191 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (189 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (185 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (203 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (176 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (174 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (191 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (200 resets) in 43 ms. (90 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (194 resets) in 27 ms. (143 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (199 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (436 resets) in 47 ms. (83 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (186 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (197 resets) in 52 ms. (75 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4002 steps (183 resets) in 56 ms. (70 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (192 resets) in 57 ms. (68 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (181 resets) in 55 ms. (71 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (200 resets) in 56 ms. (70 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (180 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (186 resets) in 42 ms. (93 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (206 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (197 resets) in 37 ms. (105 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (179 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (190 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (195 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (381 resets) in 43 ms. (91 steps per ms) remains 59/59 properties
Interrupted probabilistic random walk after 241828 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :37 out of 59
Probabilistic random walk after 241828 steps, saw 99829 distinct states, run finished after 3005 ms. (steps per millisecond=80 ) properties seen :37
[2025-06-06 02:25:10] [INFO ] Invariant cache hit.
[2025-06-06 02:25:10] [INFO ] State equation strengthened by 618 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 79/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 16/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 5 (OVERLAPS) 61/185 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 496/681 variables, 185/190 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 323/513 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 0/513 constraints. Problems are: Problem set: 3 solved, 19 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 10 (OVERLAPS) 339/1020 variables, 44/557 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1020 variables, 295/852 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1020 variables, 0/852 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/1020 variables, 0/852 constraints. Problems are: Problem set: 9 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 852 constraints, problems are : Problem set: 9 solved, 13 unsolved in 2699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 229/229 constraints, ReadFeed: 618/618 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 84/100 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 16/116 variables, 1/2 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 62/178 variables, 3/5 constraints. Problems are: Problem set: 9 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:13] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:13] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:13] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 3/8 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 400/578 variables, 178/186 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 227/413 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/413 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 442/1020 variables, 51/464 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1020 variables, 391/855 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1020 variables, 13/868 constraints. Problems are: Problem set: 9 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:17] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:17] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 870 constraints, problems are : Problem set: 9 solved, 13 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 229/229 constraints, ReadFeed: 618/618 constraints, PredecessorRefiner: 13/22 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7766ms problems are : Problem set: 9 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 791/791 transitions.
Graph (complete) has 1135 edges and 229 vertex of which 228 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 228 transition count 789
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 192 transition count 402
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 192 transition count 402
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 86 place count 192 transition count 391
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 119 place count 159 transition count 358
Iterating global reduction 2 with 33 rules applied. Total rules applied 152 place count 159 transition count 358
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 164 place count 159 transition count 346
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 175 place count 148 transition count 329
Iterating global reduction 3 with 11 rules applied. Total rules applied 186 place count 148 transition count 329
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 212 place count 148 transition count 303
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 214 place count 146 transition count 301
Iterating global reduction 4 with 2 rules applied. Total rules applied 216 place count 146 transition count 301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 145 transition count 300
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 145 transition count 300
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 219 place count 144 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 144 transition count 299
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 221 place count 143 transition count 298
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 143 transition count 298
Applied a total of 222 rules in 77 ms. Remains 143 /229 variables (removed 86) and now considering 298/791 (removed 493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 143/229 places, 298/791 transitions.
RANDOM walk for 40000 steps (8868 resets) in 443 ms. (90 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1931 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1853 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (4177 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1916 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1960 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1861 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1924 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1872 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1954 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
Probably explored full state space saw : 233604 states, properties seen :11
Probabilistic random walk after 628197 steps, saw 233604 distinct states, run finished after 2719 ms. (steps per millisecond=231 ) properties seen :11
Explored full state space saw : 233725 states, properties seen :0
Exhaustive walk after 628552 steps, saw 233725 distinct states, run finished after 1924 ms. (steps per millisecond=326 ) properties seen :0
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2025-06-06 02:25:23] [INFO ] Flatten gal took : 31 ms
[2025-06-06 02:25:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:25:23] [INFO ] Flatten gal took : 31 ms
[2025-06-06 02:25:23] [INFO ] Input system was already deterministic with 791 transitions.
Support contains 43 out of 229 places (down from 46) after GAL structural reductions.
Computed a total of 40 stabilizing places and 83 stable transitions
Graph (complete) has 1220 edges and 229 vertex of which 228 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 184 transition count 272
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 184 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 184 transition count 268
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 135 place count 143 transition count 227
Iterating global reduction 1 with 41 rules applied. Total rules applied 176 place count 143 transition count 227
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 190 place count 143 transition count 213
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 206 place count 127 transition count 186
Iterating global reduction 2 with 16 rules applied. Total rules applied 222 place count 127 transition count 186
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 235 place count 127 transition count 173
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 239 place count 123 transition count 169
Iterating global reduction 3 with 4 rules applied. Total rules applied 243 place count 123 transition count 169
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 246 place count 120 transition count 166
Iterating global reduction 3 with 3 rules applied. Total rules applied 249 place count 120 transition count 166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 118 transition count 164
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 118 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 256 place count 118 transition count 161
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 258 place count 116 transition count 159
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 116 transition count 159
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 261 place count 115 transition count 156
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 115 transition count 156
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 263 place count 114 transition count 155
Iterating global reduction 4 with 1 rules applied. Total rules applied 264 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 265 place count 113 transition count 154
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 113 transition count 154
Applied a total of 266 rules in 72 ms. Remains 113 /229 variables (removed 116) and now considering 154/791 (removed 637) transitions.
// Phase 1: matrix 154 rows 113 cols
[2025-06-06 02:25:23] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:25:23] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 02:25:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:25:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-06 02:25:24] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:25:24] [INFO ] Redundant transitions in 7 ms returned []
Running 153 sub problems to find dead transitions.
[2025-06-06 02:25:24] [INFO ] Invariant cache hit.
[2025-06-06 02:25:24] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:25] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:25] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:25] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:27] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:27] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:27] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:27] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 154/267 variables, 113/125 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 75/200 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:30] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/201 constraints. Problems are: Problem set: 3 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:25:32] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 1/202 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 202 constraints, problems are : Problem set: 3 solved, 150 unsolved in 15422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 4/113 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 5/14 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 154/267 variables, 113/127 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 75/202 constraints. Problems are: Problem set: 3 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 150/352 constraints. Problems are: Problem set: 3 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:09] [INFO ] Deduced a trap along path composed of 10 places in 32 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 353 constraints, problems are : Problem set: 3 solved, 150 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 150/153 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45495ms problems are : Problem set: 3 solved, 150 unsolved
Search for dead transitions found 3 dead transitions in 45495ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 113/229 places, 151/791 transitions.
Graph (complete) has 375 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 110 /113 variables (removed 3) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 110 cols
[2025-06-06 02:26:09] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:26:10] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-06 02:26:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:26:10] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 02:26:10] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 110/229 places, 151/791 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 46893 ms. Remains : 110/229 places, 151/791 transitions.
[2025-06-06 02:26:10] [INFO ] Flatten gal took : 8 ms
[2025-06-06 02:26:10] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:26:10] [INFO ] Input system was already deterministic with 151 transitions.
[2025-06-06 02:26:10] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:26:10] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3417324232657055575.gal : 2 ms
[2025-06-06 02:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9146814468090702071.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3417324232657055575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9146814468090702071.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,125605,1.3071,55096,2,4281,5,206595,6,0,591,80712,0


Converting to forward existential form...Done !
original formula: AG((E(AF(!(((s1>=1)&&(l2225>=1)))) U EF(((s1>=1)&&(l1688>=1)))) + ((s1>=1)&&(l2231>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((s1>=1)&&(l2231>=1)))) * !(E(!(EG(!(!(((s1>=1)&&(l2225>=1)))))) U E(TRUE U ((s1>=1)&&(l1...176
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t53, t59, t63, t65, t67, t69, t71, t73, t87, t88, t89, t90, t91,...499
(forward)formula 0,0,2.9568,84868,1,0,369,364501,329,154,4052,198180,469
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 192 transition count 401
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 192 transition count 401
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 85 place count 192 transition count 390
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 118 place count 159 transition count 357
Iterating global reduction 1 with 33 rules applied. Total rules applied 151 place count 159 transition count 357
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 160 place count 159 transition count 348
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 170 place count 149 transition count 334
Iterating global reduction 2 with 10 rules applied. Total rules applied 180 place count 149 transition count 334
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 207 place count 149 transition count 307
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 147 transition count 305
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 147 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 146 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 146 transition count 304
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 214 place count 145 transition count 303
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 145 transition count 303
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 216 place count 144 transition count 302
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 144 transition count 302
Applied a total of 217 rules in 19 ms. Remains 144 /229 variables (removed 85) and now considering 302/791 (removed 489) transitions.
// Phase 1: matrix 302 rows 144 cols
[2025-06-06 02:26:13] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:26:13] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-06 02:26:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:26:13] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-06-06 02:26:16] [INFO ] Implicit Places using invariants and state equation in 2558 ms returned []
Implicit Place search using SMT with State Equation took 2653 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2025-06-06 02:26:16] [INFO ] Invariant cache hit.
[2025-06-06 02:26:16] [INFO ] State equation strengthened by 188 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:18] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 1/144 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:21] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:21] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:21] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:21] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/446 variables, 144/155 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 188/343 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/446 variables, and 343 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 1/144 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/446 variables, 144/155 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 188/343 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 301/644 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 644 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 144/229 places, 302/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62872 ms. Remains : 144/229 places, 302/791 transitions.
[2025-06-06 02:27:16] [INFO ] Flatten gal took : 9 ms
[2025-06-06 02:27:16] [INFO ] Flatten gal took : 9 ms
[2025-06-06 02:27:16] [INFO ] Input system was already deterministic with 302 transitions.
[2025-06-06 02:27:16] [INFO ] Flatten gal took : 10 ms
[2025-06-06 02:27:16] [INFO ] Flatten gal took : 10 ms
[2025-06-06 02:27:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3996158542905466159.gal : 5 ms
[2025-06-06 02:27:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10519868303332362266.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/CTLFireability3996158542905466159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10519868303332362266.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,264353,6.23536,201264,2,7028,5,703924,6,0,878,185641,0


Converting to forward existential form...Done !
original formula: A(AG(E(E((((s1>=1)&&(l2247>=1))&&(l2223>=1)) U EX(((s1>=1)&&(l2238>=1)))) U EF(AG(((p97>=1)&&(l452>=1)))))) U E(!((!(((EF(((s1>=1)&&(l223...405
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((!(((E(TRUE U ((s1>=1)&&(l2235>=1))) + ((s1>=1)&&(l2224>=1))) + ((s1>=1)&&(l1705>=1)))) + (...1331
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t18, t20, t23, t25, t53, t54, t55, t56, t68, t71, t72, t73, t75, t83, t85, t86, t88,...1051
(forward)formula 0,0,19.3733,503688,1,0,679,2.66182e+06,652,296,6173,970660,1042
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 182 transition count 255
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 182 transition count 255
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 182 transition count 252
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 140 place count 139 transition count 209
Iterating global reduction 1 with 43 rules applied. Total rules applied 183 place count 139 transition count 209
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 198 place count 139 transition count 194
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 216 place count 121 transition count 164
Iterating global reduction 2 with 18 rules applied. Total rules applied 234 place count 121 transition count 164
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 249 place count 121 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 116 transition count 144
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 263 place count 112 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 267 place count 112 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 269 place count 110 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 110 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 273 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 275 place count 108 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 277 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 278 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 279 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 280 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 281 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 282 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 283 place count 105 transition count 129
Applied a total of 283 rules in 36 ms. Remains 105 /229 variables (removed 124) and now considering 129/791 (removed 662) transitions.
// Phase 1: matrix 129 rows 105 cols
[2025-06-06 02:27:36] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:27:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-06 02:27:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:27:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-06 02:27:36] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:27:36] [INFO ] Redundant transitions in 4 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-06 02:27:36] [INFO ] Invariant cache hit.
[2025-06-06 02:27:36] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:37] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:37] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 1/105 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:38] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:38] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 129/234 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 57/172 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:42] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/234 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:44] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 1/174 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 14 (OVERLAPS) 0/234 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 174 constraints, problems are : Problem set: 3 solved, 125 unsolved in 12481 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 4/12 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 129/234 variables, 105/117 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 57/174 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 125/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/234 variables, and 299 constraints, problems are : Problem set: 3 solved, 125 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42536ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 42537ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 105/229 places, 126/791 transitions.
Graph (complete) has 335 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 02:28:19] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:19] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 02:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 02:28:19] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/229 places, 126/791 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 43781 ms. Remains : 102/229 places, 126/791 transitions.
[2025-06-06 02:28:19] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:28:19] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:28:19] [INFO ] Input system was already deterministic with 126 transitions.
[2025-06-06 02:28:19] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:28:19] [INFO ] Flatten gal took : 25 ms
[2025-06-06 02:28:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12202182221717535105.gal : 2 ms
[2025-06-06 02:28:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4474928817517745139.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12202182221717535105.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4474928817517745139.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (8962 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1891 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Finished probabilistic random walk after 6958 steps, run visited all 1 properties in 12 ms. (steps per millisecond=579 )
Probabilistic random walk after 6958 steps, saw 3377 distinct states, run finished after 15 ms. (steps per millisecond=463 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality4474928817517745139.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 181 transition count 239
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 181 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 181 transition count 237
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 141 place count 138 transition count 194
Iterating global reduction 1 with 43 rules applied. Total rules applied 184 place count 138 transition count 194
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 200 place count 138 transition count 178
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 218 place count 120 transition count 148
Iterating global reduction 2 with 18 rules applied. Total rules applied 236 place count 120 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 249 place count 120 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 115 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 115 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 263 place count 111 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 267 place count 111 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 269 place count 109 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 109 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 109 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 274 place count 107 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 107 transition count 121
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 277 place count 106 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 278 place count 106 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 279 place count 105 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 280 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 104 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 104 transition count 116
Applied a total of 282 rules in 32 ms. Remains 104 /229 variables (removed 125) and now considering 116/791 (removed 675) transitions.
// Phase 1: matrix 116 rows 104 cols
[2025-06-06 02:28:19] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:19] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 02:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-06 02:28:20] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:28:20] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-06 02:28:20] [INFO ] Invariant cache hit.
[2025-06-06 02:28:20] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:20] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:21] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:21] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:22] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:22] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 116/220 variables, 104/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 45/161 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:24] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 1/162 constraints. Problems are: Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:27] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:27] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 2/164 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 0/220 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 164 constraints, problems are : Problem set: 3 solved, 112 unsolved in 11745 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 116/220 variables, 104/119 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 45/164 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 112/276 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/276 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/220 variables, 0/276 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 276 constraints, problems are : Problem set: 3 solved, 112 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 112/115 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41792ms problems are : Problem set: 3 solved, 112 unsolved
Search for dead transitions found 3 dead transitions in 41792ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/229 places, 113/791 transitions.
Graph (complete) has 321 edges and 104 vertex of which 101 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 101 /104 variables (removed 3) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 101 cols
[2025-06-06 02:29:02] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:02] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:29:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 02:29:02] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 101/229 places, 113/791 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 42397 ms. Remains : 101/229 places, 113/791 transitions.
[2025-06-06 02:29:02] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:29:02] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:29:02] [INFO ] Input system was already deterministic with 113 transitions.
[2025-06-06 02:29:02] [INFO ] Flatten gal took : 7 ms
[2025-06-06 02:29:02] [INFO ] Flatten gal took : 7 ms
[2025-06-06 02:29:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16699703777761192714.gal : 1 ms
[2025-06-06 02:29:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16974269199203609540.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16699703777761192714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16974269199203609540.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16974269199203609540.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 41
RANDOM walk for 40000 steps (8876 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 153
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :153 after 226
BEST_FIRST walk for 40004 steps (4113 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :226 after 722
Finished probabilistic random walk after 15123 steps, run visited all 1 properties in 20 ms. (steps per millisecond=756 )
Probabilistic random walk after 15123 steps, saw 7529 distinct states, run finished after 36 ms. (steps per millisecond=420 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 185 transition count 288
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 185 transition count 288
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 93 place count 185 transition count 283
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 133 place count 145 transition count 243
Iterating global reduction 1 with 40 rules applied. Total rules applied 173 place count 145 transition count 243
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 188 place count 145 transition count 228
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 129 transition count 201
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 129 transition count 201
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 234 place count 129 transition count 187
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 238 place count 125 transition count 183
Iterating global reduction 3 with 4 rules applied. Total rules applied 242 place count 125 transition count 183
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 122 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 122 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 121 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 121 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 120 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 120 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 119 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 119 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 255 place count 118 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 256 place count 118 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 117 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 117 transition count 173
Applied a total of 258 rules in 27 ms. Remains 117 /229 variables (removed 112) and now considering 173/791 (removed 618) transitions.
// Phase 1: matrix 173 rows 117 cols
[2025-06-06 02:29:02] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:02] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-06 02:29:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:02] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-06-06 02:29:03] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:29:03] [INFO ] Redundant transitions in 7 ms returned []
Running 172 sub problems to find dead transitions.
[2025-06-06 02:29:03] [INFO ] Invariant cache hit.
[2025-06-06 02:29:03] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:03] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:04] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:05] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:05] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:05] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:05] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/290 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 93/221 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:08] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:09] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Problem TDEAD157 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:09] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 3/224 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/290 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 224 constraints, problems are : Problem set: 3 solved, 169 unsolved in 14484 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 4/117 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 6/14 constraints. Problems are: Problem set: 3 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:18] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 173/290 variables, 117/132 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 93/225 constraints. Problems are: Problem set: 3 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 169/394 constraints. Problems are: Problem set: 3 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:41] [INFO ] Deduced a trap along path composed of 10 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 1/395 constraints. Problems are: Problem set: 3 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 395 constraints, problems are : Problem set: 3 solved, 169 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 169/172 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44558ms problems are : Problem set: 3 solved, 169 unsolved
Search for dead transitions found 3 dead transitions in 44559ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/229 places, 170/791 transitions.
Graph (complete) has 400 edges and 117 vertex of which 114 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 114 /117 variables (removed 3) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 114 cols
[2025-06-06 02:29:47] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 02:29:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:47] [INFO ] State equation strengthened by 92 read => feed constraints.
[2025-06-06 02:29:48] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 114/229 places, 170/791 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 45753 ms. Remains : 114/229 places, 170/791 transitions.
[2025-06-06 02:29:48] [INFO ] Flatten gal took : 10 ms
[2025-06-06 02:29:48] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:29:48] [INFO ] Input system was already deterministic with 170 transitions.
[2025-06-06 02:29:48] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:29:48] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:29:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16990773779033768266.gal : 1 ms
[2025-06-06 02:29:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15558835658044605850.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/CTLFireability16990773779033768266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15558835658044605850.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,132243,1.62646,60752,2,3834,5,247082,6,0,626,79821,0


Converting to forward existential form...Done !
original formula: A(!(((!(AF(E(((s1>=1)&&(l2238>=1)) U ((s1>=1)&&(l2231>=1))))) * (s1>=1)) * (l2219>=1))) U AG(EF(AG(((s1>=1)&&(l1686>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U !(E(TRUE U !(((s1>=1)&&(l1686>=1))))))))))))) * !(E(!(!(E(TRUE U !(E(TRUE...381
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t49, t54, t66, t67, t70, t74, t89, t90, t91, t92, t93, t94, t95,...575
Using saturation style SCC detection
(forward)formula 0,0,6.77754,178904,1,0,704,928467,375,360,4365,511822,872
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-05 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 : 229/229 places, 791/791 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 184 transition count 287
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 184 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 95 place count 184 transition count 282
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 136 place count 143 transition count 241
Iterating global reduction 1 with 41 rules applied. Total rules applied 177 place count 143 transition count 241
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 191 place count 143 transition count 227
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 208 place count 126 transition count 199
Iterating global reduction 2 with 17 rules applied. Total rules applied 225 place count 126 transition count 199
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 243 place count 126 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 247 place count 122 transition count 177
Iterating global reduction 3 with 4 rules applied. Total rules applied 251 place count 122 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 254 place count 119 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 257 place count 119 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 118 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 118 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 260 place count 117 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 261 place count 117 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 116 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 116 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 115 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 115 transition count 168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 114 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 114 transition count 167
Applied a total of 267 rules in 20 ms. Remains 114 /229 variables (removed 115) and now considering 167/791 (removed 624) transitions.
// Phase 1: matrix 167 rows 114 cols
[2025-06-06 02:29:55] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 02:29:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:55] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-06 02:29:55] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-06-06 02:29:55] [INFO ] Invariant cache hit.
[2025-06-06 02:29:55] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:56] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:56] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:57] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 1/114 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:59] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:59] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:59] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:59] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 167/281 variables, 114/126 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 88/214 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:04] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:05] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:05] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:05] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 9 ms to minimize.
Problem TDEAD152 is UNSAT
At refinement iteration 12 (OVERLAPS) 0/281 variables, 4/218 constraints. Problems are: Problem set: 3 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:09] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 1/219 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:14] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 10 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/281 variables, 1/220 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 17 (OVERLAPS) 0/281 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 220 constraints, problems are : Problem set: 3 solved, 163 unsolved in 25038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 4/114 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 8/18 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 167/281 variables, 114/132 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 88/220 constraints. Problems are: Problem set: 3 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 163/383 constraints. Problems are: Problem set: 3 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 281/281 variables, and 383 constraints, problems are : Problem set: 3 solved, 163 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 163/166 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55101ms problems are : Problem set: 3 solved, 163 unsolved
Search for dead transitions found 3 dead transitions in 55101ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 114/229 places, 164/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 164
Applied a total of 3 rules in 1 ms. Remains 111 /114 variables (removed 3) and now considering 164/164 (removed 0) transitions.
// Phase 1: matrix 164 rows 111 cols
[2025-06-06 02:30:50] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:30:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 02:30:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:30:50] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-06 02:30:51] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/229 places, 164/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56213 ms. Remains : 111/229 places, 164/791 transitions.
[2025-06-06 02:30:51] [INFO ] Flatten gal took : 8 ms
[2025-06-06 02:30:51] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:30:51] [INFO ] Input system was already deterministic with 164 transitions.
[2025-06-06 02:30:51] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:30:51] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:30:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14974902483978372711.gal : 1 ms
[2025-06-06 02:30:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1247251654693923991.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/CTLFireability14974902483978372711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1247251654693923991.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,122336,1.66752,63136,2,3927,5,244348,6,0,608,79966,0


Converting to forward existential form...Done !
original formula: AF((AX(((EF(((s1>=1)&&(l2209>=1))) * (s1>=1)) * (l2209>=1))) + ((AF(((s1<1)||(l2219<1))) * AX(AX(FALSE))) * ((s1>=1)&&(l2233>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(((E(TRUE U ((s1>=1)&&(l2209>=1))) * (s1>=1)) * (l2209>=1))))) + ((!(EG(!(((s1<1)||(l2219<1)...225
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t49, t59, t63, t69, t72, t73, t87, t100, t101, t102, t103, t104,...490
(forward)formula 0,0,5.22798,144832,1,0,768,646299,361,426,4189,467650,761
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 184 transition count 287
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 184 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 95 place count 184 transition count 282
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 136 place count 143 transition count 241
Iterating global reduction 1 with 41 rules applied. Total rules applied 177 place count 143 transition count 241
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 190 place count 143 transition count 228
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 206 place count 127 transition count 202
Iterating global reduction 2 with 16 rules applied. Total rules applied 222 place count 127 transition count 202
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 239 place count 127 transition count 185
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 243 place count 123 transition count 181
Iterating global reduction 3 with 4 rules applied. Total rules applied 247 place count 123 transition count 181
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 250 place count 120 transition count 178
Iterating global reduction 3 with 3 rules applied. Total rules applied 253 place count 120 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 254 place count 119 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 255 place count 119 transition count 177
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 256 place count 118 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 118 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 117 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 117 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 260 place count 116 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 261 place count 116 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 115 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 115 transition count 171
Applied a total of 263 rules in 18 ms. Remains 115 /229 variables (removed 114) and now considering 171/791 (removed 620) transitions.
// Phase 1: matrix 171 rows 115 cols
[2025-06-06 02:30:56] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:30:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 02:30:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:30:56] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-06-06 02:30:57] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-06 02:30:57] [INFO ] Invariant cache hit.
[2025-06-06 02:30:57] [INFO ] State equation strengthened by 89 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:58] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:58] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 1/115 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:59] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:59] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:00] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:00] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 171/286 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:05] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/286 variables, 1/216 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/216 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 13 (OVERLAPS) 0/286 variables, 0/216 constraints. Problems are: Problem set: 3 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 216 constraints, problems are : Problem set: 3 solved, 167 unsolved in 19301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 4/115 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 5/12 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 171/286 variables, 115/127 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 89/216 constraints. Problems are: Problem set: 3 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 167/383 constraints. Problems are: Problem set: 3 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 383 constraints, problems are : Problem set: 3 solved, 167 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 167/170 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49377ms problems are : Problem set: 3 solved, 167 unsolved
Search for dead transitions found 3 dead transitions in 49378ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 115/229 places, 168/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 168
Applied a total of 3 rules in 2 ms. Remains 112 /115 variables (removed 3) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 112 cols
[2025-06-06 02:31:46] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:31:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:46] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-06 02:31:46] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/229 places, 168/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50340 ms. Remains : 112/229 places, 168/791 transitions.
[2025-06-06 02:31:46] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:31:46] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:31:46] [INFO ] Input system was already deterministic with 168 transitions.
[2025-06-06 02:31:46] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:31:46] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:31:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11940670648540741660.gal : 2 ms
[2025-06-06 02:31:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14110554923743387037.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/CTLFireability11940670648540741660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14110554923743387037.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,133239,1.57786,64480,2,4079,5,247016,6,0,616,75486,0


Converting to forward existential form...Done !
original formula: AG(AF(((EX(((s1>=1)&&(l2228>=1))) + EG(((s1>=1)&&(l2211>=1)))) + ((s1>=1)&&(l2227>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((EX(((s1>=1)&&(l2228>=1))) + EG(((s1>=1)&&(l2211>=1)))) + ((s1>=1)&&(l2227>=1)))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t49, t63, t65, t66, t68, t71, t73, t74, t76, t91, t92, t93, t94,...425
(forward)formula 0,0,2.44918,64480,1,0,317,247016,361,132,4202,120152,435
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 183 transition count 257
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 183 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 183 transition count 254
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 137 place count 141 transition count 212
Iterating global reduction 1 with 42 rules applied. Total rules applied 179 place count 141 transition count 212
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 194 place count 141 transition count 197
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 211 place count 124 transition count 168
Iterating global reduction 2 with 17 rules applied. Total rules applied 228 place count 124 transition count 168
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 243 place count 124 transition count 153
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 247 place count 120 transition count 149
Iterating global reduction 3 with 4 rules applied. Total rules applied 251 place count 120 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 255 place count 116 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 259 place count 116 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 114 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 114 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 265 place count 114 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 267 place count 112 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 269 place count 112 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 270 place count 111 transition count 136
Iterating global reduction 4 with 1 rules applied. Total rules applied 271 place count 111 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 272 place count 110 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 273 place count 110 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 274 place count 109 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 109 transition count 134
Applied a total of 275 rules in 11 ms. Remains 109 /229 variables (removed 120) and now considering 134/791 (removed 657) transitions.
// Phase 1: matrix 134 rows 109 cols
[2025-06-06 02:31:49] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:49] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 02:31:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 02:31:49] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-06 02:31:49] [INFO ] Invariant cache hit.
[2025-06-06 02:31:49] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:50] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:52] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:52] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:52] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:52] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 134/243 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 59/179 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:56] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 3 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/243 variables, 1/180 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 180 constraints, problems are : Problem set: 3 solved, 130 unsolved in 11757 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 130 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 4/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 5/12 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 134/243 variables, 109/121 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 59/180 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 130/310 constraints. Problems are: Problem set: 3 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:19] [INFO ] Deduced a trap along path composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/311 constraints. Problems are: Problem set: 3 solved, 130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/243 variables, and 311 constraints, problems are : Problem set: 3 solved, 130 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 130/133 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41808ms problems are : Problem set: 3 solved, 130 unsolved
Search for dead transitions found 3 dead transitions in 41809ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/229 places, 131/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 131
Applied a total of 3 rules in 1 ms. Remains 106 /109 variables (removed 3) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 106 cols
[2025-06-06 02:32:31] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:32:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:32:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-06 02:32:32] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/229 places, 131/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42658 ms. Remains : 106/229 places, 131/791 transitions.
[2025-06-06 02:32:32] [INFO ] Flatten gal took : 12 ms
[2025-06-06 02:32:32] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:32:32] [INFO ] Input system was already deterministic with 131 transitions.
[2025-06-06 02:32:32] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:32:32] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:32:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6085762746219304580.gal : 1 ms
[2025-06-06 02:32:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8037066413600023147.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/CTLFireability6085762746219304580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8037066413600023147.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,98482,0.603746,31612,2,3720,5,96795,6,0,555,47756,0


Converting to forward existential form...Done !
original formula: E(((s1>=1)&&(l509>=1)) U AX(AF(((s1>=1)&&(l2227>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,((s1>=1)&&(l509>=1))) * !(EX(!(!(EG(!(((s1>=1)&&(l2227>=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t41, t42, t43, t44, t46, t50, t51, t52, t67, t68, t70, t80, t82, t83, t92, t94, t95,...369
Hit Full ! (commute/partial/dont) 2/126/129
(forward)formula 0,0,2.90343,96980,1,0,448,481415,289,184,3855,309578,549
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 181 transition count 239
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 181 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 181 transition count 237
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 142 place count 137 transition count 193
Iterating global reduction 1 with 44 rules applied. Total rules applied 186 place count 137 transition count 193
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 202 place count 137 transition count 177
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 221 place count 118 transition count 145
Iterating global reduction 2 with 19 rules applied. Total rules applied 240 place count 118 transition count 145
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 254 place count 118 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 260 place count 112 transition count 125
Iterating global reduction 3 with 6 rules applied. Total rules applied 266 place count 112 transition count 125
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 271 place count 107 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 276 place count 107 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 279 place count 104 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 282 place count 104 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 284 place count 104 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 287 place count 101 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 290 place count 101 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 291 place count 100 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 100 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 293 place count 99 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 98 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 98 transition count 107
Applied a total of 296 rules in 11 ms. Remains 98 /229 variables (removed 131) and now considering 107/791 (removed 684) transitions.
// Phase 1: matrix 107 rows 98 cols
[2025-06-06 02:32:35] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:32:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:32:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:32:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 02:32:35] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 02:32:35] [INFO ] Invariant cache hit.
[2025-06-06 02:32:35] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:35] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:36] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:37] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:37] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 107/205 variables, 98/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 41/149 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:39] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/150 constraints. Problems are: Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:41] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/205 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 151 constraints, problems are : Problem set: 3 solved, 103 unsolved in 11025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/12 constraints. Problems are: Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:46] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 107/205 variables, 98/111 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 41/152 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 103/255 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 255 constraints, problems are : Problem set: 3 solved, 103 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 103/106 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41065ms problems are : Problem set: 3 solved, 103 unsolved
Search for dead transitions found 3 dead transitions in 41066ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 98/229 places, 104/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 95 transition count 104
Applied a total of 3 rules in 1 ms. Remains 95 /98 variables (removed 3) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 02:33:16] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:16] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 02:33:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 02:33:16] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/229 places, 104/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41775 ms. Remains : 95/229 places, 104/791 transitions.
[2025-06-06 02:33:16] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:33:16] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:33:16] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-06 02:33:16] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:33:16] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:33:16] [INFO ] Time to serialize gal into /tmp/CTLFireability120278424760909230.gal : 0 ms
[2025-06-06 02:33:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13166544747545918407.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/CTLFireability120278424760909230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13166544747545918407.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,75566,0.372423,21072,2,2858,5,55068,6,0,484,34129,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.374514,21072,1,0,6,55068,7,1,649,34129,1
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 188 transition count 336
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 188 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 83 place count 188 transition count 335
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 121 place count 150 transition count 297
Iterating global reduction 1 with 38 rules applied. Total rules applied 159 place count 150 transition count 297
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 171 place count 150 transition count 285
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 185 place count 136 transition count 263
Iterating global reduction 2 with 14 rules applied. Total rules applied 199 place count 136 transition count 263
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 220 place count 136 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 223 place count 133 transition count 239
Iterating global reduction 3 with 3 rules applied. Total rules applied 226 place count 133 transition count 239
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 228 place count 131 transition count 237
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 131 transition count 237
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 231 place count 130 transition count 236
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 130 transition count 236
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 233 place count 129 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 234 place count 129 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 235 place count 128 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 128 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 237 place count 127 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 127 transition count 231
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 239 place count 126 transition count 230
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 126 transition count 230
Applied a total of 240 rules in 28 ms. Remains 126 /229 variables (removed 103) and now considering 230/791 (removed 561) transitions.
// Phase 1: matrix 230 rows 126 cols
[2025-06-06 02:33:17] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 02:33:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:17] [INFO ] State equation strengthened by 138 read => feed constraints.
[2025-06-06 02:33:17] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-06-06 02:33:17] [INFO ] Invariant cache hit.
[2025-06-06 02:33:17] [INFO ] State equation strengthened by 138 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:18] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:19] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:19] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 1/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:21] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:22] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:22] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:22] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:22] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 230/356 variables, 126/139 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 138/277 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:31] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:33] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 11 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/356 variables, 2/279 constraints. Problems are: Problem set: 3 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:37] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:37] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:37] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 3/282 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 14 (OVERLAPS) 0/356 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 282 constraints, problems are : Problem set: 3 solved, 226 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 126/126 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 4/126 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 9/18 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 230/356 variables, 126/144 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 138/282 constraints. Problems are: Problem set: 3 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 226/508 constraints. Problems are: Problem set: 3 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 508 constraints, problems are : Problem set: 3 solved, 226 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 126/126 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 226/229 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 3 solved, 226 unsolved
Search for dead transitions found 3 dead transitions in 60130ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 126/229 places, 227/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 227
Applied a total of 3 rules in 2 ms. Remains 123 /126 variables (removed 3) and now considering 227/227 (removed 0) transitions.
// Phase 1: matrix 227 rows 123 cols
[2025-06-06 02:34:17] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:34:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 02:34:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:34:18] [INFO ] State equation strengthened by 137 read => feed constraints.
[2025-06-06 02:34:18] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 123/229 places, 227/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61643 ms. Remains : 123/229 places, 227/791 transitions.
[2025-06-06 02:34:18] [INFO ] Flatten gal took : 8 ms
[2025-06-06 02:34:18] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:34:18] [INFO ] Input system was already deterministic with 227 transitions.
[2025-06-06 02:34:18] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:34:18] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:34:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11073377060849312913.gal : 1 ms
[2025-06-06 02:34:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5623756633258227517.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/CTLFireability11073377060849312913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5623756633258227517.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,171914,3.94018,138788,2,4697,5,533214,6,0,719,134257,0


Converting to forward existential form...Done !
original formula: ((AF((((s1<1)||(l2215<1)) * EG(((s1>=1)&&(l2216>=1))))) + EG(EX(((s1>=1)&&(l2223>=1))))) + (A(!((((s1>=1)&&(l2235>=1))||((s1>=1)&&(l1685>...224
=> equivalent forward existential formula: [FwdG(EY(((Init * !((!(EG(!((((s1<1)||(l2215<1)) * EG(((s1>=1)&&(l2216>=1))))))) + EG(EX(((s1>=1)&&(l2223>=1))))...378
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t49, t60, t63, t67, t69, t73, t74, t76, t80, t81, t83, t84, t86,...718
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,14.9983,375180,1,0,916,2.12929e+06,500,478,5069,938232,1151
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 182 transition count 255
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 182 transition count 255
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 182 transition count 252
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 140 place count 139 transition count 209
Iterating global reduction 1 with 43 rules applied. Total rules applied 183 place count 139 transition count 209
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 198 place count 139 transition count 194
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 216 place count 121 transition count 164
Iterating global reduction 2 with 18 rules applied. Total rules applied 234 place count 121 transition count 164
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 249 place count 121 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 116 transition count 144
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 263 place count 112 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 267 place count 112 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 269 place count 110 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 110 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 273 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 275 place count 108 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 277 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 278 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 279 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 280 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 281 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 282 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 283 place count 105 transition count 129
Applied a total of 283 rules in 24 ms. Remains 105 /229 variables (removed 124) and now considering 129/791 (removed 662) transitions.
// Phase 1: matrix 129 rows 105 cols
[2025-06-06 02:34:34] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:34:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 02:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:34:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-06 02:34:34] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:34:34] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-06 02:34:34] [INFO ] Invariant cache hit.
[2025-06-06 02:34:34] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:35] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:35] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:35] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 1/105 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:36] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:36] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 129/234 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 128 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 57/172 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:39] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/234 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 173 constraints, problems are : Problem set: 3 solved, 125 unsolved in 10345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 3/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 129/234 variables, 105/116 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 57/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 125/298 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:56] [INFO ] Deduced a trap along path composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/234 variables, and 299 constraints, problems are : Problem set: 3 solved, 125 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40395ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 40396ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 105/229 places, 126/791 transitions.
Graph (complete) has 335 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 02:35:14] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:14] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 02:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 02:35:15] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/229 places, 126/791 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41229 ms. Remains : 102/229 places, 126/791 transitions.
[2025-06-06 02:35:15] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:35:15] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:35:15] [INFO ] Input system was already deterministic with 126 transitions.
[2025-06-06 02:35:15] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:35:15] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:35:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17570283176395641353.gal : 1 ms
[2025-06-06 02:35:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6856950556076578726.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17570283176395641353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6856950556076578726.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6856950556076578726.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
RANDOM walk for 40000 steps (8940 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 41
BEST_FIRST walk for 40004 steps (1835 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3036 steps, run visited all 1 properties in 7 ms. (steps per millisecond=433 )
Probabilistic random walk after 3036 steps, saw 1527 distinct states, run finished after 7 ms. (steps per millisecond=433 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 186 transition count 304
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 186 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 186 transition count 298
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 131 place count 147 transition count 259
Iterating global reduction 1 with 39 rules applied. Total rules applied 170 place count 147 transition count 259
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 181 place count 147 transition count 248
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 194 place count 134 transition count 228
Iterating global reduction 2 with 13 rules applied. Total rules applied 207 place count 134 transition count 228
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 224 place count 134 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 226 place count 132 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 132 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 229 place count 131 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 131 transition count 208
Applied a total of 230 rules in 8 ms. Remains 131 /229 variables (removed 98) and now considering 208/791 (removed 583) transitions.
// Phase 1: matrix 208 rows 131 cols
[2025-06-06 02:35:15] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 02:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:15] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-06-06 02:35:16] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-06-06 02:35:16] [INFO ] Invariant cache hit.
[2025-06-06 02:35:16] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:17] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:17] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 1/131 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:19] [INFO ] Deduced a trap composed of 39 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:35:19] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:19] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:19] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:19] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:19] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 208/339 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 110/255 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:23] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 3 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:23] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:25] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 8 ms to minimize.
Problem TDEAD191 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 4/259 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 11 (OVERLAPS) 0/339 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 259 constraints, problems are : Problem set: 3 solved, 204 unsolved in 25940 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 131/131 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 9/18 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 208/339 variables, 131/149 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 110/259 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 204/463 constraints. Problems are: Problem set: 3 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 339/339 variables, and 463 constraints, problems are : Problem set: 3 solved, 204 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 131/131 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 204/207 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56046ms problems are : Problem set: 3 solved, 204 unsolved
Search for dead transitions found 3 dead transitions in 56048ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 131/229 places, 205/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 128 transition count 205
Applied a total of 3 rules in 2 ms. Remains 128 /131 variables (removed 3) and now considering 205/205 (removed 0) transitions.
// Phase 1: matrix 205 rows 128 cols
[2025-06-06 02:36:12] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:36:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 02:36:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:36:12] [INFO ] State equation strengthened by 109 read => feed constraints.
[2025-06-06 02:36:13] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/229 places, 205/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57678 ms. Remains : 128/229 places, 205/791 transitions.
[2025-06-06 02:36:13] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:36:13] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:36:13] [INFO ] Input system was already deterministic with 205 transitions.
[2025-06-06 02:36:13] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:36:13] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:36:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16518167145617449510.gal : 1 ms
[2025-06-06 02:36:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7154122023758447813.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/CTLFireability16518167145617449510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7154122023758447813.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,174067,3.12184,106216,2,6047,5,346866,6,0,717,123673,0


Converting to forward existential form...Done !
original formula: AF((AF(((s1>=1)&&(l2208>=1))) + ((((s1>=1)&&(l2218>=1)) * (A(EX(((s1>=1)&&(l2213>=1))) U EG(((s1>=1)&&(l2214>=1)))) * (l1715>=1))) * ((p4...171
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((s1>=1)&&(l2208>=1))))) + ((((s1>=1)&&(l2218>=1)) * (!((E(!(EG(((s1>=1)&&(l2214>=1)))) U (...301
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t20, t21, t25, t26, t29, t30, t31, t32, t53, t56, t57, t58, t59, t69, t71, t72, t76,...606
(forward)formula 0,0,14.1614,371776,1,0,1048,1.57029e+06,446,574,4976,1.06605e+06,1159
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 186 transition count 304
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 186 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 186 transition count 298
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 131 place count 147 transition count 259
Iterating global reduction 1 with 39 rules applied. Total rules applied 170 place count 147 transition count 259
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 184 place count 147 transition count 245
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 199 place count 132 transition count 221
Iterating global reduction 2 with 15 rules applied. Total rules applied 214 place count 132 transition count 221
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 232 place count 132 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 235 place count 129 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 238 place count 129 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 240 place count 127 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 127 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 243 place count 126 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 126 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 125 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 125 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 247 place count 124 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 124 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 123 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 123 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 122 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 122 transition count 191
Applied a total of 252 rules in 29 ms. Remains 122 /229 variables (removed 107) and now considering 191/791 (removed 600) transitions.
// Phase 1: matrix 191 rows 122 cols
[2025-06-06 02:36:27] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:36:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-06 02:36:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:36:27] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-06 02:36:28] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-06-06 02:36:28] [INFO ] Invariant cache hit.
[2025-06-06 02:36:28] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:29] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:29] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:31] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:32] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:32] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:32] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 191/313 variables, 122/134 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 105/239 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:40] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD174 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/313 variables, 1/240 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 0/313 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 240 constraints, problems are : Problem set: 3 solved, 187 unsolved in 24193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 4/122 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/13 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 191/313 variables, 122/135 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 105/240 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 187/427 constraints. Problems are: Problem set: 3 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:08] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 1/428 constraints. Problems are: Problem set: 3 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 428 constraints, problems are : Problem set: 3 solved, 187 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 187/190 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54279ms problems are : Problem set: 3 solved, 187 unsolved
Search for dead transitions found 3 dead transitions in 54282ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 122/229 places, 188/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 119 transition count 188
Applied a total of 3 rules in 2 ms. Remains 119 /122 variables (removed 3) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 119 cols
[2025-06-06 02:37:22] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 02:37:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:22] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-06 02:37:22] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 119/229 places, 188/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55456 ms. Remains : 119/229 places, 188/791 transitions.
[2025-06-06 02:37:22] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:37:22] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:37:22] [INFO ] Input system was already deterministic with 188 transitions.
[2025-06-06 02:37:22] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:37:22] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:37:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16002647976630693332.gal : 1 ms
[2025-06-06 02:37:22] [INFO ] Time to serialize properties into /tmp/CTLFireability4170507333086805070.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/CTLFireability16002647976630693332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4170507333086805070.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,153879,3.5245,100032,2,4812,5,396699,6,0,664,115078,0


Converting to forward existential form...Done !
original formula: AG(((EX(((s1<1)||(l2232<1))) + EF(AG(E(((s1>=1)&&(l2241>=1)) U ((s1>=1)&&(l2212>=1)))))) + (((s1>=1)&&(l2222>=1))||(((s1>=1)&&(l446>=1))&...179
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((((s1>=1)&&(l2222>=1))||(((s1>=1)&&(l446>=1))&&((s1<1)||(l2212<1)))))) * !(E(TRUE U !(E(...257
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t33, t35, t44, t47, t48, t49, t50, t60, t62, t66, t68, t71, t73, t74, t76, t79, t80,...633
(forward)formula 0,0,4.43275,100032,1,0,307,396699,401,135,4555,115718,397
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-13 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 : 229/229 places, 791/791 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 190 transition count 368
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 190 transition count 368
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 88 place count 190 transition count 358
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 124 place count 154 transition count 322
Iterating global reduction 1 with 36 rules applied. Total rules applied 160 place count 154 transition count 322
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 172 place count 154 transition count 310
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 183 place count 143 transition count 293
Iterating global reduction 2 with 11 rules applied. Total rules applied 194 place count 143 transition count 293
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 208 place count 143 transition count 279
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 211 place count 140 transition count 276
Iterating global reduction 3 with 3 rules applied. Total rules applied 214 place count 140 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 216 place count 138 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 218 place count 138 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 219 place count 137 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 137 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 221 place count 136 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 136 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 223 place count 135 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 135 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 225 place count 134 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 134 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 227 place count 133 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 228 place count 133 transition count 267
Applied a total of 228 rules in 12 ms. Remains 133 /229 variables (removed 96) and now considering 267/791 (removed 524) transitions.
// Phase 1: matrix 267 rows 133 cols
[2025-06-06 02:37:27] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 02:37:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:27] [INFO ] State equation strengthened by 168 read => feed constraints.
[2025-06-06 02:37:28] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-06 02:37:28] [INFO ] Invariant cache hit.
[2025-06-06 02:37:28] [INFO ] State equation strengthened by 168 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, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:29] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:31] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:34] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:34] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:34] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:34] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 267/400 variables, 133/145 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 168/313 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:40] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:42] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:43] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 10 ms to minimize.
Problem TDEAD245 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:43] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:43] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 5/318 constraints. Problems are: Problem set: 3 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:47] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/319 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/319 constraints. Problems are: Problem set: 3 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/400 variables, and 319 constraints, problems are : Problem set: 3 solved, 263 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 263 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 4/133 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 9/18 constraints. Problems are: Problem set: 3 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:59] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/19 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 267/400 variables, 133/152 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 168/320 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 263/583 constraints. Problems are: Problem set: 3 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 583 constraints, problems are : Problem set: 3 solved, 263 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 263/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 3 solved, 263 unsolved
Search for dead transitions found 3 dead transitions in 60146ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 133/229 places, 264/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 264
Applied a total of 3 rules in 2 ms. Remains 130 /133 variables (removed 3) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 130 cols
[2025-06-06 02:38:28] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 02:38:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:28] [INFO ] State equation strengthened by 167 read => feed constraints.
[2025-06-06 02:38:28] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 130/229 places, 264/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61630 ms. Remains : 130/229 places, 264/791 transitions.
[2025-06-06 02:38:28] [INFO ] Flatten gal took : 8 ms
[2025-06-06 02:38:29] [INFO ] Flatten gal took : 9 ms
[2025-06-06 02:38:29] [INFO ] Input system was already deterministic with 264 transitions.
[2025-06-06 02:38:29] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:38:29] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:38:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7791379751069684375.gal : 2 ms
[2025-06-06 02:38:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10255320098841115390.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/CTLFireability7791379751069684375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10255320098841115390.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,198924,7.58098,231872,2,5649,5,898093,6,0,784,207541,0


Converting to forward existential form...Done !
original formula: A(((s1>=1)&&(l2229>=1)) U (AF(((s1>=1)&&(l2235>=1))) + !((EF((AG(((s1>=1)&&(l2226>=1))) * A(((s1>=1)&&(l2234>=1)) U ((s1>=1)&&(l2209>=1))...274
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((s1>=1)&&(l2235>=1))))) + !((E(TRUE U (!(E(TRUE U !(((s1>=1)&&(l2226>=1))))) * !((E(!(...1130
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t49, t59, t65, t66, t67, t71, t72, t76, t78, t80, t81, t85, t87,...903
(forward)formula 0,1,13.4831,279468,1,0,1092,1.54278e+06,588,473,5516,698427,1525
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 791/791 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 183 transition count 271
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 183 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 183 transition count 267
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 138 place count 141 transition count 225
Iterating global reduction 1 with 42 rules applied. Total rules applied 180 place count 141 transition count 225
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 195 place count 141 transition count 210
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 212 place count 124 transition count 182
Iterating global reduction 2 with 17 rules applied. Total rules applied 229 place count 124 transition count 182
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 245 place count 124 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 249 place count 120 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 253 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 256 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 259 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 115 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 266 place count 115 transition count 154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 268 place count 113 transition count 152
Iterating global reduction 4 with 2 rules applied. Total rules applied 270 place count 113 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 271 place count 112 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 112 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 273 place count 111 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 275 place count 110 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 276 place count 110 transition count 147
Applied a total of 276 rules in 10 ms. Remains 110 /229 variables (removed 119) and now considering 147/791 (removed 644) transitions.
// Phase 1: matrix 147 rows 110 cols
[2025-06-06 02:38:42] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 02:38:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:42] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-06 02:38:43] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-06 02:38:43] [INFO ] Invariant cache hit.
[2025-06-06 02:38:43] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:43] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:44] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/110 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:45] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:45] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:45] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:45] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 147/257 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 71/192 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:48] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:48] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
Problem TDEAD133 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 2/194 constraints. Problems are: Problem set: 3 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:51] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:51] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 2/196 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 13 (OVERLAPS) 0/257 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 196 constraints, problems are : Problem set: 3 solved, 143 unsolved in 14146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 4/110 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 7/15 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 147/257 variables, 110/125 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 71/196 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 143/339 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/339 constraints. Problems are: Problem set: 3 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 257/257 variables, and 339 constraints, problems are : Problem set: 3 solved, 143 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/146 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44207ms problems are : Problem set: 3 solved, 143 unsolved
Search for dead transitions found 3 dead transitions in 44208ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/229 places, 144/791 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 144
Applied a total of 3 rules in 2 ms. Remains 107 /110 variables (removed 3) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 107 cols
[2025-06-06 02:39:27] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:39:27] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 02:39:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:39:27] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 02:39:27] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/229 places, 144/791 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45277 ms. Remains : 107/229 places, 144/791 transitions.
[2025-06-06 02:39:27] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:39:27] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:39:27] [INFO ] Input system was already deterministic with 144 transitions.
[2025-06-06 02:39:27] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:39:27] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:39:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17888910367599069014.gal : 1 ms
[2025-06-06 02:39:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5494067449773911933.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/CTLFireability17888910367599069014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5494067449773911933.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,115394,0.823003,38268,2,3646,5,130440,6,0,572,57974,0


Converting to forward existential form...Done !
original formula: EF(EG(((AX(((s1<1)||(l2235<1))) * (s1>=1)) * (l2218>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!(EX(!(((s1<1)||(l2235<1))))) * (s1>=1)) * (l2218>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t57, t62, t63, t67, t69, t70, t83, t84, t85, t86, t87, t88, t89,...467
(forward)formula 0,0,1.60795,46492,1,0,291,175024,310,111,3794,105425,344
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-06 02:39:29] [INFO ] Flatten gal took : 14 ms
[2025-06-06 02:39:29] [INFO ] Flatten gal took : 14 ms
Total runtime 929269 ms.

BK_STOP 1749177569579

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

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