About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d0m04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 72862.00 | 0.00 | 0.00 | FFFFTTFFTTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994200354.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-d0m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994200354
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K 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 57K 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-d0m04-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749146836906
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-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 18:07:18] [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-05 18:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:07:18] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-05 18:07:18] [INFO ] Transformed 262 places.
[2025-06-05 18:07:18] [INFO ] Transformed 73 transitions.
[2025-06-05 18:07:18] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Support contains 60 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Applied a total of 2 rules in 11 ms. Remains 70 /72 variables (removed 2) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2025-06-05 18:07:18] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:18] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-05 18:07:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:18] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 18:07:18] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-05 18:07:18] [INFO ] Invariant cache hit.
[2025-06-05 18:07:18] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:19] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:19] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:19] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:19] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:19] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:19] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:20] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:20] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:20] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:20] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:20] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 7 (OVERLAPS) 73/143 variables, 70/88 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 31/119 constraints. Problems are: Problem set: 5 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:21] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/120 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/120 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/120 constraints. Problems are: Problem set: 5 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 120 constraints, problems are : Problem set: 5 solved, 67 unsolved in 5418 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 10/13 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/14 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/15 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 4/67 variables, 1/16 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 2/18 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 73/140 variables, 67/85 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 31/116 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 13/129 constraints. Problems are: Problem set: 5 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:24] [INFO ] Deduced a trap along path composed of 10 places in 39 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:24] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:25] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 3/132 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/132 constraints. Problems are: Problem set: 5 solved, 67 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 15 (OVERLAPS) 3/143 variables, 3/135 constraints. Problems are: Problem set: 7 solved, 65 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 54/189 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 1/190 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/190 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 19 (OVERLAPS) 0/143 variables, 0/190 constraints. Problems are: Problem set: 9 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 190 constraints, problems are : Problem set: 9 solved, 63 unsolved in 15315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 67/72 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 20824ms problems are : Problem set: 9 solved, 63 unsolved
Search for dead transitions found 9 dead transitions in 20842ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 64/73 transitions.
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 69 transition count 55
Reduce places removed 2 places and 5 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 67 transition count 50
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 3 rules in 1 ms. Remains 67 /70 variables (removed 3) and now considering 49/64 (removed 15) transitions.
// Phase 1: matrix 49 rows 67 cols
[2025-06-05 18:07:39] [INFO ] Computed 19 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-05 18:07:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 18:07:39] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/72 places, 49/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21249 ms. Remains : 67/72 places, 49/73 transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Support contains 40 out of 54 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:07:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-05 18:07:39] [INFO ] Flatten gal took : 19 ms
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:07:39] [INFO ] Flatten gal took : 10 ms
[2025-06-05 18:07:39] [INFO ] Input system was already deterministic with 49 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 40000 steps (8953 resets) in 1708 ms. (23 steps per ms) remains 19/36 properties
BEST_FIRST walk for 4003 steps (423 resets) in 104 ms. (38 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (198 resets) in 79 ms. (50 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (249 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (428 resets) in 121 ms. (32 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (500 resets) in 120 ms. (33 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (192 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (426 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (186 resets) in 13 ms. (285 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (428 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (392 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (306 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (202 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (422 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (180 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (436 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (192 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (196 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (208 resets) in 15 ms. (250 steps per ms) remains 17/18 properties
// Phase 1: matrix 49 rows 54 cols
[2025-06-05 18:07:40] [INFO ] Computed 6 invariants in 2 ms
[2025-06-05 18:07:40] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/50 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:40] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Problem AtomicPropp0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:40] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:40] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:40] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:40] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 5/11 constraints. Problems are: Problem set: 5 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:40] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:40] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:40] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 2/14 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 49/103 variables, 54/68 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 20/88 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/88 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/103 variables, 0/88 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 88 constraints, problems are : Problem set: 5 solved, 12 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 12 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: 5 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/49 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/5 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 5/54 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 7/14 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 49/103 variables, 54/68 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 20/88 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 12/100 constraints. Problems are: Problem set: 5 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:41] [INFO ] Deduced a trap along path composed of 4 places in 17 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 1/101 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/101 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/103 variables, 0/101 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 101 constraints, problems are : Problem set: 5 solved, 12 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1784ms problems are : Problem set: 5 solved, 12 unsolved
Parikh walk visited 3 properties in 526 ms.
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 131 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 44 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 44 transition count 44
Applied a total of 10 rules in 12 ms. Remains 44 /54 variables (removed 10) and now considering 44/49 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 44/54 places, 44/49 transitions.
RANDOM walk for 40000 steps (8942 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1945 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1962 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4202 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1939 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1607 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (4076 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1960 resets) in 104 ms. (380 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
// Phase 1: matrix 44 rows 44 cols
[2025-06-05 18:07:43] [INFO ] Computed 3 invariants in 0 ms
[2025-06-05 18:07:43] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 26/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 42/79 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/88 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 8 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 44/44 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 26/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 42/79 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:43] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 9/88 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:44] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/88 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 75 constraints, problems are : Problem set: 0 solved, 8 unsolved in 709 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 44/44 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1172ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 341 ms.
Support contains 10 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 44/44 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 41 transition count 40
Applied a total of 7 rules in 6 ms. Remains 41 /44 variables (removed 3) and now considering 40/44 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 41/44 places, 40/44 transitions.
RANDOM walk for 40000 steps (8934 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1934 resets) in 35 ms. (1111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4145 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1926 resets) in 30 ms. (1290 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1630 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (4179 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1895 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 432 steps, run visited all 7 properties in 9 ms. (steps per millisecond=48 )
Probabilistic random walk after 432 steps, saw 223 distinct states, run finished after 12 ms. (steps per millisecond=36 ) properties seen :7
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:07:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-05 18:07:44] [INFO ] Flatten gal took : 5 ms
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:07:44] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:07:44] [INFO ] Input system was already deterministic with 49 transitions.
Support contains 29 out of 54 places (down from 33) after GAL structural reductions.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 49
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 45 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 45 transition count 44
Applied a total of 14 rules in 2 ms. Remains 45 /54 variables (removed 9) and now considering 44/49 (removed 5) transitions.
// Phase 1: matrix 44 rows 45 cols
[2025-06-05 18:07:44] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:44] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-05 18:07:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:44] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-05 18:07:44] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2025-06-05 18:07:45] [INFO ] Invariant cache hit.
[2025-06-05 18:07:45] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/87 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:45] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 2/89 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 66 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1858 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/87 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 2/89 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 40/109 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/89 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 109 constraints, problems are : Problem set: 0 solved, 43 unsolved in 3972 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5843ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 5843ms
Starting structural reductions in LTL mode, iteration 1 : 45/54 places, 44/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5932 ms. Remains : 45/54 places, 44/49 transitions.
[2025-06-05 18:07:50] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:07:50] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:07:50] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-05 18:07:50] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:07:50] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:07:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6379960849955942905.gal : 2 ms
[2025-06-05 18:07:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10100814253733125028.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/CTLFireability6379960849955942905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10100814253733125028.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,654,0.026654,4588,2,587,5,2520,6,0,220,2114,0
Converting to forward existential form...Done !
original formula: A(!((!(((AF(((s1>=1)&&(l79>=1))) + ((s1>=1)&&(l113>=1))) + ((p21>=1)&&(l67>=1)))) * A(EG(((s1>=1)&&(l21>=1))) U !(AX(((s1>=1)&&(l90>=1)))...244
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!(EX(((s1>=1)&&(l3>=1)))) + !(((s7>=1)&&(l0>=1)))) + E(TRUE U ((s3>=1)&&(l0>=1))))))))) * !...606
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t23, t25, t29, t32, t34, t35, t36, t37, t38, t39, t41, t42, Intersection with reacha...228
(forward)formula 0,0,0.136932,9964,1,0,172,25198,130,81,1476,25763,203
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 43 transition count 43
Applied a total of 12 rules in 11 ms. Remains 43 /54 variables (removed 11) and now considering 43/49 (removed 6) transitions.
// Phase 1: matrix 43 rows 43 cols
[2025-06-05 18:07:51] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 18:07:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-05 18:07:51] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:07:51] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2025-06-05 18:07:51] [INFO ] Invariant cache hit.
[2025-06-05 18:07:51] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/86 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:51] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:51] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 65 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/86 variables, 43/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 17/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:54] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 108 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4479 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6060ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 6060ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/54 places, 43/49 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6176 ms. Remains : 43/54 places, 43/49 transitions.
[2025-06-05 18:07:57] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:07:57] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:07:57] [INFO ] Input system was already deterministic with 43 transitions.
[2025-06-05 18:07:57] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:07:57] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:07:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5608287729060894512.gal : 1 ms
[2025-06-05 18:07:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14143274770067155057.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/CTLFireability5608287729060894512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14143274770067155057.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,622,0.019606,4584,2,562,5,3287,6,0,217,2203,0
Converting to forward existential form...Done !
original formula: AF(EG(((s1<1)||(l70<1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((s1<1)||(l70<1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t25, t29, t31, t33, t34, t35, t36, t37, t38, t40, t41, Intersection with reachable ...224
dead was empty
(forward)formula 0,1,0.10035,9064,1,0,145,21669,107,56,1392,20323,153
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-04 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 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 40 transition count 39
Applied a total of 24 rules in 5 ms. Remains 40 /54 variables (removed 14) and now considering 39/49 (removed 10) transitions.
// Phase 1: matrix 39 rows 40 cols
[2025-06-05 18:07:57] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:57] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 18:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:07:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:07:57] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2025-06-05 18:07:57] [INFO ] Invariant cache hit.
[2025-06-05 18:07:57] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:57] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:07:58] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1459 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2535 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4006ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 4006ms
Starting structural reductions in LTL mode, iteration 1 : 40/54 places, 39/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4101 ms. Remains : 40/54 places, 39/49 transitions.
[2025-06-05 18:08:01] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:08:01] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:01] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-05 18:08:01] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:01] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8485766090702661022.gal : 0 ms
[2025-06-05 18:08:01] [INFO ] Time to serialize properties into /tmp/CTLFireability607475616728503464.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/CTLFireability8485766090702661022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability607475616728503464.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,565,0.015658,4504,2,492,5,2635,6,0,201,1835,0
Converting to forward existential form...Done !
original formula: A(!(((s9>=1)&&(l89>=1))) U ((EX(!(E(((s1>=1)&&(l0>=1)) U ((s1>=1)&&(l63>=1))))) + ((s1>=1)&&(l129>=1))) * (EF(AG(((s1>=1)&&(l236>=1)))) +...178
=> equivalent forward existential formula: [((Init * !(EG(!(((EX(!(E(((s1>=1)&&(l0>=1)) U ((s1>=1)&&(l63>=1))))) + ((s1>=1)&&(l129>=1))) * (E(TRUE U !(E(TR...573
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t22, t26, t28, t30, t31, t32, t33, t34, t36, t37, Intersection with reachable at ea...219
(forward)formula 0,0,0.103622,8984,1,0,207,21539,113,119,1305,22116,232
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-06 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 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 41 transition count 40
Applied a total of 22 rules in 6 ms. Remains 41 /54 variables (removed 13) and now considering 40/49 (removed 9) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-05 18:08:01] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 18:08:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 18:08:01] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2025-06-05 18:08:01] [INFO ] Invariant cache hit.
[2025-06-05 18:08:01] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 61 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 40/81 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:04] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/81 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/81 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 102 constraints, problems are : Problem set: 0 solved, 39 unsolved in 3179 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4233ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 4234ms
Starting structural reductions in LTL mode, iteration 1 : 41/54 places, 40/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4349 ms. Remains : 41/54 places, 40/49 transitions.
[2025-06-05 18:08:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:05] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-05 18:08:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9752518408184483345.gal : 0 ms
[2025-06-05 18:08:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11308167372988337591.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/CTLFireability9752518408184483345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11308167372988337591.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,577,0.017213,4516,2,554,5,2807,6,0,206,2052,0
Converting to forward existential form...Done !
original formula: (AF(((s1>=1)&&(l24>=1))) + !(E(AF(AG(((s1>=1)&&(l129>=1)))) U AG(AF(AX(FALSE))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(((s1>=1)&&(l24>=1))))))),!(EG(!(!(E(TRUE U !(((s1>=1)&&(l129>=1))))))))) * !(E(TRUE U !(...193
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t16, t23, t27, t29, t31, t32, t33, t34, t35, t37, t38, Intersection with reacha...228
(forward)formula 0,0,0.102058,9252,1,0,150,22738,116,61,1335,22504,165
FORMULA SieveSingleMsgMbox-PT-d0m04-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 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 42 transition count 42
Applied a total of 19 rules in 2 ms. Remains 42 /54 variables (removed 12) and now considering 42/49 (removed 7) transitions.
// Phase 1: matrix 42 rows 42 cols
[2025-06-05 18:08:06] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 18:08:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 18:08:06] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2025-06-05 18:08:06] [INFO ] Invariant cache hit.
[2025-06-05 18:08:06] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/45 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:06] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:06] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 63 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 42/84 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:08] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 105 constraints, problems are : Problem set: 0 solved, 41 unsolved in 3067 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4513ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 4513ms
Starting structural reductions in LTL mode, iteration 1 : 42/54 places, 42/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4607 ms. Remains : 42/54 places, 42/49 transitions.
[2025-06-05 18:08:10] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:08:10] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:10] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-05 18:08:10] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:10] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9176185863916258596.gal : 1 ms
[2025-06-05 18:08:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8487888780807052243.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/CTLFireability9176185863916258596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8487888780807052243.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,590,0.018115,4696,2,537,5,3186,6,0,212,2085,0
Converting to forward existential form...Done !
original formula: EG(AX(AF(((s6>=1)&&(l0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(((s6>=1)&&(l0>=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t24, t28, t30, t32, t33, t34, t35, t36, t37, t39, t40, Intersection with reachable ...224
(forward)formula 0,0,0.093638,8920,1,0,140,20380,109,55,1359,19436,151
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 41 transition count 40
Applied a total of 17 rules in 12 ms. Remains 41 /54 variables (removed 13) and now considering 40/49 (removed 9) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-05 18:08:10] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 18:08:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 18:08:10] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:08:10] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2025-06-05 18:08:10] [INFO ] Invariant cache hit.
[2025-06-05 18:08:10] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:11] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 61 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/81 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 39/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:12] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 101 constraints, problems are : Problem set: 0 solved, 39 unsolved in 3401 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4501ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 4501ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/54 places, 40/49 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4603 ms. Remains : 41/54 places, 40/49 transitions.
[2025-06-05 18:08:15] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:08:15] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:08:15] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-05 18:08:15] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:15] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1791668197039067899.gal : 1 ms
[2025-06-05 18:08:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6615868782019750520.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/CTLFireability1791668197039067899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6615868782019750520.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,571,0.02014,4516,2,461,5,2595,6,0,206,1840,0
Converting to forward existential form...Done !
original formula: AF(EG((((s1>=1)&&(l78>=1)) * ((l127>=1) * (A(((s1>=1)&&(l129>=1)) U !(((s1>=1)&&(l78>=1)))) + (l0>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((s1>=1)&&(l78>=1)) * ((l127>=1) * (!((E(!(!(((s1>=1)&&(l78>=1)))) U (!(((s1>=1)&&(l129>=1))) *...242
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t15, t17, t23, t27, t29, t31, t32, t33, t34, t35, t37, t38, Intersection with reacha...228
(forward)formula 0,0,0.087342,7716,1,0,137,15537,111,53,1343,14590,141
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 41 transition count 40
Applied a total of 17 rules in 11 ms. Remains 41 /54 variables (removed 13) and now considering 40/49 (removed 9) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-05 18:08:15] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 18:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:08:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:08:15] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2025-06-05 18:08:15] [INFO ] Invariant cache hit.
[2025-06-05 18:08:15] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:16] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 60 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 39/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 99 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2348 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3438ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3439ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/54 places, 40/49 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3554 ms. Remains : 41/54 places, 40/49 transitions.
[2025-06-05 18:08:19] [INFO ] Flatten gal took : 6 ms
[2025-06-05 18:08:19] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:08:19] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-05 18:08:19] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:19] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2532809139715500577.gal : 1 ms
[2025-06-05 18:08:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1137892971904403230.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/CTLFireability2532809139715500577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1137892971904403230.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,565,0.017736,4524,2,521,5,2873,6,0,206,1972,0
Converting to forward existential form...Done !
original formula: AF(AG((((s1>=1)&&(l62>=1))&&(((s1<1)||(l20<1))||((p10<1)||(l0<1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((s1>=1)&&(l62>=1))&&(((s1<1)||(l20<1))||((p10<1)||(l0<1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t26, t28, t30, t31, t32, t33, t34, t36, t37, t38, Intersection with reachable at ea...219
(forward)formula 0,0,0.089691,8364,1,0,123,17112,105,44,1369,16246,132
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 43 transition count 43
Applied a total of 17 rules in 5 ms. Remains 43 /54 variables (removed 11) and now considering 43/49 (removed 6) transitions.
// Phase 1: matrix 43 rows 43 cols
[2025-06-05 18:08:19] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 18:08:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-05 18:08:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2025-06-05 18:08:19] [INFO ] Invariant cache hit.
[2025-06-05 18:08:19] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/86 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:19] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:19] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 65 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/86 variables, 43/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 17/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:22] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 108 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4522 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6045ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 6045ms
Starting structural reductions in LTL mode, iteration 1 : 43/54 places, 43/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6151 ms. Remains : 43/54 places, 43/49 transitions.
[2025-06-05 18:08:25] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:25] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:08:25] [INFO ] Input system was already deterministic with 43 transitions.
[2025-06-05 18:08:25] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:25] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:25] [INFO ] Time to serialize gal into /tmp/CTLFireability18223904725462461009.gal : 1 ms
[2025-06-05 18:08:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12770432804599970617.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/CTLFireability18223904725462461009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12770432804599970617.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,622,0.029334,4576,2,562,5,3287,6,0,217,2203,0
Converting to forward existential form...Done !
original formula: A((AG(EX((!(((p14>=1)&&(l65>=1))) * EG(((s1>=1)&&(l127>=1)))))) + ((s8>=1)&&(l0>=1))) U (!((!(((s1>=1)&&(l235>=1))) + EF(AX(((s9>=1)&&(l8...238
=> equivalent forward existential formula: [((Init * !(EG(!((!((!(((s1>=1)&&(l235>=1))) + E(TRUE U !(EX(!(((s9>=1)&&(l89>=1)))))))) * !((E(!(((s1>=1)&&(l0>...1021
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t25, t29, t31, t33, t34, t35, t36, t37, t38, t40, t41, Intersection with reachable ...224
(forward)formula 0,0,0.15101,10208,1,0,185,26420,133,94,1435,26655,224
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 40 transition count 39
Applied a total of 24 rules in 4 ms. Remains 40 /54 variables (removed 14) and now considering 39/49 (removed 10) transitions.
// Phase 1: matrix 39 rows 40 cols
[2025-06-05 18:08:25] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 18:08:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:08:25] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2025-06-05 18:08:25] [INFO ] Invariant cache hit.
[2025-06-05 18:08:25] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:26] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:26] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2559 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4016ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 4017ms
Starting structural reductions in LTL mode, iteration 1 : 40/54 places, 39/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4115 ms. Remains : 40/54 places, 39/49 transitions.
[2025-06-05 18:08:29] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:08:29] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:08:29] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-05 18:08:29] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:29] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:08:29] [INFO ] Time to serialize gal into /tmp/CTLFireability1034244410091773474.gal : 0 ms
[2025-06-05 18:08:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14741884629854252602.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/CTLFireability1034244410091773474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14741884629854252602.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,565,0.015558,4504,2,492,5,2635,6,0,201,1835,0
Converting to forward existential form...Done !
original formula: AX((AG(((s8<1)||(l0<1))) * (((s1<1)||(l113<1))||((s1>=1)&&(l63>=1)))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(((s8<1)||(l0<1))))] = FALSE * [(EY(Init) * !((((s1<1)||(l113<1))||((s1>=1)&&(l63>=1))...168
(forward)formula 0,0,0.02582,4760,1,0,12,2979,12,4,408,2193,5
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 18:08:29] [INFO ] Flatten gal took : 6 ms
[2025-06-05 18:08:29] [INFO ] Flatten gal took : 5 ms
Total runtime 71636 ms.
BK_STOP 1749146909768
--------------------
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-d0m04"
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-d0m04, 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-174901994200354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m04.tgz
mv SieveSingleMsgMbox-PT-d0m04 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 '
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 ;