About the Execution of ITS-Tools for MedleyA-PT-21
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | F?F?T?T?FFTTTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200258.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 MedleyA-PT-21, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 70K May 29 14:32 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 MedleyA-PT-21-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-21-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748889742132
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 18:42:24] [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-02 18:42:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:42:25] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2025-06-02 18:42:25] [INFO ] Transformed 306 places.
[2025-06-02 18:42:25] [INFO ] Transformed 298 transitions.
[2025-06-02 18:42:25] [INFO ] Found NUPN structural information;
[2025-06-02 18:42:25] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Support contains 120 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 282 transition count 274
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 282 transition count 274
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 271 transition count 263
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 271 transition count 263
Applied a total of 70 rules in 156 ms. Remains 271 /306 variables (removed 35) and now considering 263/298 (removed 35) transitions.
// Phase 1: matrix 263 rows 271 cols
[2025-06-02 18:42:25] [INFO ] Computed 20 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:42:26] [INFO ] Implicit Places using invariants in 578 ms returned []
[2025-06-02 18:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:42:26] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-02 18:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:33] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:33] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:33] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:34] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:34] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:34] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:34] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:34] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:34] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:35] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:35] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:35] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:35] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:35] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:36] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:36] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:36] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:36] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:37] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:37] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:37] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:38] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:38] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:39] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:39] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:39] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:39] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:40] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:43] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:43] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:44] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:44] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:44] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:45] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:46] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:47] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:47] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:48] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:48] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:48] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:49] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:49] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 262 unsolved
SMT process timed out in 30159ms, After SMT, problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 30187ms
Starting structural reductions in LTL mode, iteration 1 : 271/306 places, 263/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31584 ms. Remains : 271/306 places, 263/298 transitions.
Support contains 120 out of 271 places after structural reductions.
[2025-06-02 18:42:57] [INFO ] Flatten gal took : 94 ms
[2025-06-02 18:42:57] [INFO ] Flatten gal took : 40 ms
[2025-06-02 18:42:57] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 119 out of 271 places (down from 120) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2328 ms. (17 steps per ms) remains 30/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
[2025-06-02 18:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 208/266 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 5/271 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 263/534 variables, 271/291 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 291 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 208/266 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:00] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:01] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:01] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:01] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:01] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:01] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:01] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:01] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 5/271 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 263/534 variables, 271/299 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 30/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:04] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:04] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:04] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 332 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6749ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 263/263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 271 transition count 219
Reduce places removed 44 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 49 rules applied. Total rules applied 93 place count 227 transition count 214
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 222 transition count 214
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 98 place count 222 transition count 185
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 156 place count 193 transition count 185
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 171 place count 178 transition count 170
Iterating global reduction 3 with 15 rules applied. Total rules applied 186 place count 178 transition count 170
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 186 place count 178 transition count 167
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 192 place count 175 transition count 167
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 248 place count 147 transition count 139
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 258 place count 142 transition count 161
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 267 place count 142 transition count 152
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 276 place count 133 transition count 152
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 133 transition count 152
Applied a total of 278 rules in 120 ms. Remains 133 /271 variables (removed 138) and now considering 152/263 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 133/271 places, 152/263 transitions.
RANDOM walk for 40000 steps (8 resets) in 931 ms. (42 steps per ms) remains 22/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
// Phase 1: matrix 152 rows 133 cols
[2025-06-02 18:43:05] [INFO ] Computed 20 invariants in 6 ms
[2025-06-02 18:43:05] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 96/122 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 11/133 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 152/285 variables, 133/153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 11/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 164 constraints, problems are : Problem set: 0 solved, 13 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 133/133 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 96/122 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:06] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:06] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:06] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:06] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 11/133 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 152/285 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 11/168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:07] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/285 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:07] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/285 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 183 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2392 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 133/133 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2853ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 12 properties in 951 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 152/152 transitions.
Graph (trivial) has 72 edges and 133 vertex of which 2 / 133 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 132 transition count 141
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 123 transition count 141
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 19 place count 123 transition count 129
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 43 place count 111 transition count 129
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 106 transition count 120
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 106 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 53 place count 106 transition count 119
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 105 transition count 119
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 81 place count 92 transition count 106
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 92 transition count 105
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 87 transition count 139
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 107 place count 87 transition count 124
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 123 place count 72 transition count 123
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 72 transition count 123
Applied a total of 124 rules in 74 ms. Remains 72 /133 variables (removed 61) and now considering 123/152 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 72/133 places, 123/152 transitions.
RANDOM walk for 40000 steps (15 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1705276 steps, run timeout after 3001 ms. (steps per millisecond=568 ) properties seen :0 out of 1
Probabilistic random walk after 1705276 steps, saw 289350 distinct states, run finished after 3015 ms. (steps per millisecond=565 ) properties seen :0
// Phase 1: matrix 123 rows 72 cols
[2025-06-02 18:43:12] [INFO ] Computed 20 invariants in 2 ms
[2025-06-02 18:43:12] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/72 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:13] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:13] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:13] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/195 variables, 72/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 30/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 72/72 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/72 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/195 variables, 72/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 30/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 72/72 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 6 ms.
[2025-06-02 18:43:13] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:43:13] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:43:13] [INFO ] Input system was already deterministic with 263 transitions.
Computed a total of 53 stabilizing places and 53 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 240 transition count 232
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 240 transition count 232
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 80 place count 222 transition count 214
Iterating global reduction 0 with 18 rules applied. Total rules applied 98 place count 222 transition count 214
Applied a total of 98 rules in 20 ms. Remains 222 /271 variables (removed 49) and now considering 214/263 (removed 49) transitions.
// Phase 1: matrix 214 rows 222 cols
[2025-06-02 18:43:13] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:43:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 18:43:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:43:13] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-02 18:43:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:17] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:17] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:18] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:18] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:18] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:18] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:18] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:19] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:19] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:19] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:20] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:20] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 255 constraints, problems are : Problem set: 0 solved, 213 unsolved in 25969 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:42] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 213/469 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:48] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:48] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:49] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:49] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:51] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:51] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:51] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 7/476 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:53] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:00] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:07] [INFO ] Deduced a trap along path composed of 4 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:07] [INFO ] Deduced a trap along path composed of 9 places in 105 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:07] [INFO ] Deduced a trap along path composed of 9 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:07] [INFO ] Deduced a trap along path composed of 9 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:08] [INFO ] Deduced a trap along path composed of 11 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 483 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 56035ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 56038ms
Starting structural reductions in LTL mode, iteration 1 : 222/271 places, 214/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56558 ms. Remains : 222/271 places, 214/263 transitions.
[2025-06-02 18:44:10] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:44:10] [INFO ] Flatten gal took : 22 ms
[2025-06-02 18:44:10] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-02 18:44:10] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:44:10] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:44:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1009020675014573841.gal : 10 ms
[2025-06-02 18:44:10] [INFO ] Time to serialize properties into /tmp/CTLFireability3677629433442028514.ctl : 8 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/CTLFireability1009020675014573841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3677629433442028514.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,1.89904e+17,3.61968,93452,2,16995,5,358857,6,0,1104,551246,0
Converting to forward existential form...Done !
original formula: (AG(((((p290==0)||(p25==0))&&(p192==1))&&(p230==1))) + AG(EF(AX(((p229==0)||(p300==0))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(((((p290==0)||(p25==0))&&(p192==1))&&(p230==1))))))),TRUE) * !(E(TRUE U !(EX(!(((p...189
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t14, t15, t21, t30, t31, t38, t53, t63, t84, t99, t109, t129, t144, t154...353
(forward)formula 0,1,24.5059,576484,1,0,381,3.03031e+06,450,197,6126,3.00175e+06,446
FORMULA MedleyA-PT-21-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 246 transition count 238
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 246 transition count 238
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 233 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 233 transition count 225
Applied a total of 76 rules in 16 ms. Remains 233 /271 variables (removed 38) and now considering 225/263 (removed 38) transitions.
// Phase 1: matrix 225 rows 233 cols
[2025-06-02 18:44:34] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:44:35] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-02 18:44:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:44:35] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-06-02 18:44:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:40] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:40] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:41] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:41] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:41] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:41] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:41] [INFO ] Deduced a trap composed of 27 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-02 18:44:41] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:42] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:42] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:42] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:42] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:43] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:43] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:45] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:48] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 225/458 variables, 233/271 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:59] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/458 variables, and 272 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:06] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/272 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/496 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:11] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:12] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:12] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:12] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:13] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:14] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:17] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:18] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:20] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:20] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:24] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:45:28] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 60052ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 233/271 places, 225/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60664 ms. Remains : 233/271 places, 225/263 transitions.
[2025-06-02 18:45:35] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:45:35] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:45:35] [INFO ] Input system was already deterministic with 225 transitions.
[2025-06-02 18:45:35] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:45:35] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:45:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15062030581840286724.gal : 8 ms
[2025-06-02 18:45:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10533914675397914832.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/CTLFireability15062030581840286724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10533914675397914832.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,3.16348e+17,8.0539,184492,2,20048,5,673085,6,0,1159,1.13873e+06,0
Converting to forward existential form...Done !
original formula: (AG(((A(EX(A(((p147==1)&&(p300==1)) U (p170==1))) U (A((p131==1) U (p105==1)) * E((p161==1) U (p83==1)))) + AX((((p183==0)||(p185==0))||(...414
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(((!((E(!((!((E(!((p105==1)) U (!((p131==1)) * !((p105==1)))) + EG(!((p105==1))))) * E(...1415
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t23, t29, t30, t33, t41, t53, t56, t66, t87, t91, t99, t103, t109, ...393
Detected timeout of ITS tools.
[2025-06-02 18:46:05] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:46:05] [INFO ] Applying decomposition
[2025-06-02 18:46:05] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8920190946266723141.txt' '-o' '/tmp/graph8920190946266723141.bin' '-w' '/tmp/graph8920190946266723141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8920190946266723141.bin' '-l' '-1' '-v' '-w' '/tmp/graph8920190946266723141.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:46:05] [INFO ] Decomposing Gal with order
[2025-06-02 18:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:46:06] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-02 18:46:06] [INFO ] Flatten gal took : 110 ms
[2025-06-02 18:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-06-02 18:46:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17629759112334779828.gal : 14 ms
[2025-06-02 18:46:06] [INFO ] Time to serialize properties into /tmp/CTLFireability18225890634070400187.ctl : 6 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/CTLFireability17629759112334779828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18225890634070400187.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,3.16348e+17,0.704308,21008,2667,24,37176,265,548,52749,37,675,0
Converting to forward existential form...Done !
original formula: (AG(((A(EX(A(((i6.i2.u37.p147==1)&&(i14.i2.u97.p300==1)) U (i0.i2.u58.p170==1))) U (A((i7.i2.u45.p131==1) U (i0.i0.u34.p105==1)) * E((i8....672
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(((!((E(!((!((E(!((i0.i0.u34.p105==1)) U (!((i7.i2.u45.p131==1)) * !((i0.i0.u34.p105==1...2136
Reverse transition relation is NOT exact ! Due to transitions t10, t29, t182, t184, t186, t187, t188, t193, t194, t204, t207, t215, t220, t223, i1.u4.t0, i...600
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Graph (trivial) has 197 edges and 271 vertex of which 6 / 271 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 265 transition count 191
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 199 transition count 191
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 133 place count 199 transition count 158
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 199 place count 166 transition count 158
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 230 place count 135 transition count 127
Iterating global reduction 2 with 31 rules applied. Total rules applied 261 place count 135 transition count 127
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 261 place count 135 transition count 114
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 287 place count 122 transition count 114
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 325 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 47 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 328 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 332 place count 97 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 94 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 340 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 340 place count 94 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 342 place count 93 transition count 85
Applied a total of 342 rules in 51 ms. Remains 93 /271 variables (removed 178) and now considering 85/263 (removed 178) transitions.
// Phase 1: matrix 85 rows 93 cols
[2025-06-02 18:46:36] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:46:36] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 18:46:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:46:36] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:46:36] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-02 18:46:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:37] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 114 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3464 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 58/172 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 172 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2856 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6334ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 6336ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/271 places, 85/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6686 ms. Remains : 93/271 places, 85/263 transitions.
[2025-06-02 18:46:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:46:42] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:46:42] [INFO ] Input system was already deterministic with 85 transitions.
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 18:46:42] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:46:42] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:46:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14706857811032537968.gal : 2 ms
[2025-06-02 18:46:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6113272261030798124.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14706857811032537968.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6113272261030798124.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 243 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 243 transition count 235
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 72 place count 227 transition count 219
Iterating global reduction 0 with 16 rules applied. Total rules applied 88 place count 227 transition count 219
Applied a total of 88 rules in 15 ms. Remains 227 /271 variables (removed 44) and now considering 219/263 (removed 44) transitions.
// Phase 1: matrix 219 rows 227 cols
[2025-06-02 18:46:43] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:46:43] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-02 18:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:46:43] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-02 18:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:48] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:48] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:49] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:49] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:49] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:49] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:49] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:49] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:49] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:50] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:50] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:50] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:50] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:53] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:53] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:56] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/446 variables, 227/264 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:05] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:09] [INFO ] Deduced a trap along path composed of 4 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/446 variables, and 266 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:14] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:14] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:17] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:19] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:19] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 219/446 variables, 227/270 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 218/488 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:22] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:25] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:25] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:26] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:28] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:29] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:31] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:31] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:36] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:47:36] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 499 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 227/271 places, 219/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60633 ms. Remains : 227/271 places, 219/263 transitions.
[2025-06-02 18:47:43] [INFO ] Flatten gal took : 14 ms
[2025-06-02 18:47:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:47:43] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-02 18:47:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:47:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:47:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5926668903112810343.gal : 3 ms
[2025-06-02 18:47:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12535165250030854006.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5926668903112810343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12535165250030854006.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,1.86854e+17,4.38819,99852,2,14165,5,380720,6,0,1129,579381,0
Converting to forward existential form...Done !
original formula: A(AF((A(((p149==1)&&((p187==1)||(p268==1))) U E((p237==1) U (p181==1))) + !((((p189!=1) + EF((p36==1))) * (E((p107==1) U (p57==1)) + (p44...256
=> equivalent forward existential formula: [((Init * !(EG(!(!((((!(EG(!((p126==1)))) + !(!(EX(!((p82==1)))))) * (p248!=1)) * !((EX((p106==1)) + !(E(TRUE U ...670
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t72, t78, t84, t99, t106, t110, t111, t131...377
Detected timeout of ITS tools.
[2025-06-02 18:48:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:48:13] [INFO ] Applying decomposition
[2025-06-02 18:48:13] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6575084748859143192.txt' '-o' '/tmp/graph6575084748859143192.bin' '-w' '/tmp/graph6575084748859143192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6575084748859143192.bin' '-l' '-1' '-v' '-w' '/tmp/graph6575084748859143192.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:48:13] [INFO ] Decomposing Gal with order
[2025-06-02 18:48:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:48:13] [INFO ] Removed a total of 31 redundant transitions.
[2025-06-02 18:48:13] [INFO ] Flatten gal took : 33 ms
[2025-06-02 18:48:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-02 18:48:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15712808179082329166.gal : 8 ms
[2025-06-02 18:48:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7049274414648515457.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/CTLFireability15712808179082329166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7049274414648515457.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,1.86854e+17,0.615476,16064,2207,26,27510,262,522,34143,42,624,0
Converting to forward existential form...Done !
original formula: A(AF((A(((i9.i0.u48.p149==1)&&((i2.i2.u62.p187==1)||(i14.u84.p268==1))) U E((i10.u78.p237==1) U (i10.u60.p181==1))) + !((((i11.u64.p189!=...389
=> equivalent forward existential formula: [((Init * !(EG(!(!((((!(EG(!((i8.i1.u42.p126==1)))) + !(!(EX(!((i5.i0.u28.p82==1)))))) * (i13.i1.u75.p248!=1)) *...929
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t176, t177, t178, t180, t181, t182, t186, t187, t188, t198, t206, t209, t217, i0.u8...533
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Graph (trivial) has 190 edges and 271 vertex of which 6 / 271 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 265 transition count 194
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 202 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 201 transition count 193
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 129 place count 201 transition count 159
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 197 place count 167 transition count 159
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 227 place count 137 transition count 129
Iterating global reduction 3 with 30 rules applied. Total rules applied 257 place count 137 transition count 129
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 257 place count 137 transition count 118
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 279 place count 126 transition count 118
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 319 place count 106 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 105 transition count 97
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 43 edges and 104 vertex of which 5 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 322 place count 101 transition count 97
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 326 place count 100 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 332 place count 97 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 334 place count 97 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 334 place count 97 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 336 place count 96 transition count 88
Applied a total of 336 rules in 39 ms. Remains 96 /271 variables (removed 175) and now considering 88/263 (removed 175) transitions.
// Phase 1: matrix 88 rows 96 cols
[2025-06-02 18:48:44] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:48:44] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 18:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:48:44] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:48:44] [INFO ] Redundant transitions in 2 ms returned []
Running 62 sub problems to find dead transitions.
[2025-06-02 18:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 13/96 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:45] [INFO ] Deduced a trap composed of 5 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-02 18:48:45] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:45] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 87/183 variables, 96/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/184 variables, and 117 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3361 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 13/96 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 87/183 variables, 96/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 62/179 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/184 variables, and 179 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3188 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6561ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6561ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/271 places, 88/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6871 ms. Remains : 96/271 places, 88/263 transitions.
[2025-06-02 18:48:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:48:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:48:50] [INFO ] Input system was already deterministic with 88 transitions.
[2025-06-02 18:48:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:48:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:48:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2097097699800528186.gal : 2 ms
[2025-06-02 18:48:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15567328683693548439.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/CTLFireability2097097699800528186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15567328683693548439.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,1.28746e+11,0.226348,8504,2,794,5,22695,5,0,473,25602,0
Converting to forward existential form...Done !
original formula: AG(((p52==0) * ((p120==0) + EG(!(E((p56==1) U (p9==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p52==0)))] = FALSE * [((FwdU(Init,TRUE) * !((p120==0))) * !(EG(!(E((p56==1) U (p9==1))))...167
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t28, t37, t41, t45, t79, Intersection with reachable at each step enabled. (destroye...192
Fast SCC detection found an SCC at level 0
(forward)formula 0,0,1.01758,30128,1,0,205,166857,204,102,2764,160433,242
FORMULA MedleyA-PT-21-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 240 transition count 232
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 240 transition count 232
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 80 place count 222 transition count 214
Iterating global reduction 0 with 18 rules applied. Total rules applied 98 place count 222 transition count 214
Applied a total of 98 rules in 8 ms. Remains 222 /271 variables (removed 49) and now considering 214/263 (removed 49) transitions.
// Phase 1: matrix 214 rows 222 cols
[2025-06-02 18:48:51] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:48:52] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 18:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:48:52] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-02 18:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:56] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:56] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:56] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:57] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:57] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:57] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:57] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:58] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:58] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:59] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:02] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:11] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/436 variables, and 257 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/469 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:25] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:25] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:25] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:25] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:26] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:26] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:27] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:27] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:28] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:28] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 10/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:31] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:31] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:49:41] [INFO ] Deduced a trap along path composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 483 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 222/271 places, 214/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60568 ms. Remains : 222/271 places, 214/263 transitions.
[2025-06-02 18:49:52] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:49:52] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:49:52] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-02 18:49:52] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:49:52] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:49:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2101342955515618983.gal : 3 ms
[2025-06-02 18:49:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3744081646725736278.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/CTLFireability2101342955515618983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3744081646725736278.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,1.44337e+17,2.64228,65336,2,11300,5,260313,6,0,1104,362020,0
Converting to forward existential form...Done !
original formula: (EF(AX(((E((p43==1) U (p231==1)) * (p165==1)) * (p203==1)))) * AG(((((p201==0)||(p244==0)) + (AG(((p128==1)&&(p156==1))) + AF((p89==0))))...201
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(((E((p43==1) U (p231==1)) * (p165==1)) * (p203==1))))))))] = FALSE * [FwdG(((FwdU(In...311
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t104, t108, t109, t129, t144, t1...355
Detected timeout of ITS tools.
[2025-06-02 18:50:22] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:50:22] [INFO ] Applying decomposition
[2025-06-02 18:50:22] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph215129634266983572.txt' '-o' '/tmp/graph215129634266983572.bin' '-w' '/tmp/graph215129634266983572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph215129634266983572.bin' '-l' '-1' '-v' '-w' '/tmp/graph215129634266983572.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:50:22] [INFO ] Decomposing Gal with order
[2025-06-02 18:50:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:50:22] [INFO ] Removed a total of 32 redundant transitions.
[2025-06-02 18:50:22] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:50:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 18:50:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4169341028981288846.gal : 4 ms
[2025-06-02 18:50:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11668129856310956881.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/CTLFireability4169341028981288846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11668129856310956881.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,1.44337e+17,0.579863,19336,1846,25,37644,279,495,38283,44,743,0
Converting to forward existential form...Done !
original formula: (EF(AX(((E((i3.u14.p43==1) U (i13.i0.u71.p231==1)) * (i9.i0.u52.p165==1)) * (i11.u63.p203==1)))) * AG(((((i11.u62.p201==0)||(i13.i1.u76.p...312
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(((E((i3.u14.p43==1) U (i13.i0.u71.p231==1)) * (i9.i0.u52.p165==1)) * (i11.u63.p203==...422
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t171, t172, t173, t175, t177, t181, t182, t183, t193, t196, t201, t204, t209, t212,...485
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,6.76737,218760,1,0,490014,293,3138,615190,224,743,706455
FORMULA MedleyA-PT-21-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Graph (trivial) has 194 edges and 271 vertex of which 6 / 271 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 265 transition count 192
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 200 transition count 192
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 131 place count 200 transition count 160
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 195 place count 168 transition count 160
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 225 place count 138 transition count 130
Iterating global reduction 2 with 30 rules applied. Total rules applied 255 place count 138 transition count 130
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 255 place count 138 transition count 118
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 279 place count 126 transition count 118
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 319 place count 106 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 320 place count 105 transition count 97
Applied a total of 320 rules in 23 ms. Remains 105 /271 variables (removed 166) and now considering 97/263 (removed 166) transitions.
// Phase 1: matrix 97 rows 105 cols
[2025-06-02 18:50:29] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:50:29] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 18:50:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:50:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:50:29] [INFO ] Redundant transitions in 4 ms returned []
Running 68 sub problems to find dead transitions.
[2025-06-02 18:50:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 14/105 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:30] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:30] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:30] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:31] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 96/201 variables, 105/129 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/202 variables, and 129 constraints, problems are : Problem set: 0 solved, 68 unsolved in 4168 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 14/105 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 96/201 variables, 105/129 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 68/197 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/202 variables, and 197 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3359 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7536ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 7537ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/271 places, 97/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7800 ms. Remains : 105/271 places, 97/263 transitions.
[2025-06-02 18:50:37] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:50:37] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:50:37] [INFO ] Input system was already deterministic with 97 transitions.
[2025-06-02 18:50:37] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:50:37] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:50:37] [INFO ] Time to serialize gal into /tmp/CTLFireability2169323074420881759.gal : 1 ms
[2025-06-02 18:50:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14995952054206341121.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/CTLFireability2169323074420881759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14995952054206341121.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,1.24367e+12,0.750239,21192,2,1456,5,89326,6,0,519,96015,0
Converting to forward existential form...Done !
original formula: AG(EF((((p258==0)||(p210==0))||((p238==0)||(p56==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p258==0)||(p210==0))||((p238==0)||(p56==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t29, t30, t31, t41, t46, t51, t89, t90, t91, Intersection with reachable at ...221
(forward)formula 0,1,3.58868,90496,1,0,181,524110,214,76,3010,462316,203
FORMULA MedleyA-PT-21-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 239 transition count 231
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 239 transition count 231
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 82 place count 221 transition count 213
Iterating global reduction 0 with 18 rules applied. Total rules applied 100 place count 221 transition count 213
Applied a total of 100 rules in 8 ms. Remains 221 /271 variables (removed 50) and now considering 213/263 (removed 50) transitions.
// Phase 1: matrix 213 rows 221 cols
[2025-06-02 18:50:41] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:50:41] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 18:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:50:41] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-02 18:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:46] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:46] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:46] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:46] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:47] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:47] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:47] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:48] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:49] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:52] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/434 variables, 221/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:02] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 255 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:13] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:13] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:14] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:16] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 213/434 variables, 221/258 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 212/470 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:20] [INFO ] Deduced a trap composed of 7 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-02 18:51:20] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:20] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:20] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:21] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:22] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:23] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 7/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:25] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:26] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:28] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:31] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:32] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:33] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 484 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60038ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Starting structural reductions in LTL mode, iteration 1 : 221/271 places, 213/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60386 ms. Remains : 221/271 places, 213/263 transitions.
[2025-06-02 18:51:41] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:51:41] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:51:41] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-02 18:51:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:51:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:51:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10311643643192987497.gal : 2 ms
[2025-06-02 18:51:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2408300901441854202.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/CTLFireability10311643643192987497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2408300901441854202.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,1.37906e+17,2.58025,60412,2,10556,5,243741,6,0,1099,327813,0
Converting to forward existential form...Done !
original formula: EF((EX((((p222==0)||(p43==0))&&(p45==1))) * ((EG((EF(((p95==0)||(p115==0))) + (p180==0))) + (p19==0)) + (p21==0))))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * EX((((p222==0)||(p43==0))&&(p45==1)))),(E(TRUE U ((p95==0)||(p115==0))) + (p180==0)))...335
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t127, t142, t148, t151, t1...355
(forward)formula 0,1,21.4298,461036,1,0,392,2.27511e+06,453,196,6565,2.54733e+06,460
FORMULA MedleyA-PT-21-CTLFireability-2025-07 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 : 271/271 places, 263/263 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 239 transition count 231
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 239 transition count 231
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 83 place count 220 transition count 212
Iterating global reduction 0 with 19 rules applied. Total rules applied 102 place count 220 transition count 212
Applied a total of 102 rules in 9 ms. Remains 220 /271 variables (removed 51) and now considering 212/263 (removed 51) transitions.
// Phase 1: matrix 212 rows 220 cols
[2025-06-02 18:52:03] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:52:03] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 18:52:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:52:03] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-02 18:52:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:08] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:08] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:08] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:08] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:09] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:09] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:09] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:09] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:10] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:10] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:11] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:12] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/253 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:20] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/432 variables, and 254 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/432 variables, 220/253 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 211/464 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:36] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:36] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:37] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:38] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:38] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:39] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:39] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:39] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:41] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:42] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:43] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:44] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:46] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:58] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:58] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 480 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60044ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 220/271 places, 212/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60440 ms. Remains : 220/271 places, 212/263 transitions.
[2025-06-02 18:53:03] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:53:03] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:53:03] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-02 18:53:03] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:53:03] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:53:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4224648115274638335.gal : 1 ms
[2025-06-02 18:53:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4359546376718621083.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/CTLFireability4224648115274638335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4359546376718621083.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,1.31918e+17,2.0502,55148,2,10280,5,224657,6,0,1094,295065,0
Converting to forward existential form...Done !
original formula: EF(EG(AX(((p171==1)||((p18==1)&&(p50==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(((p171==1)||((p18==1)&&(p50==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t127, t142, t152, t169, t1...343
(forward)formula 0,1,14.3431,319276,1,0,383,1.60699e+06,447,195,5956,1.74593e+06,450
FORMULA MedleyA-PT-21-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Graph (trivial) has 197 edges and 271 vertex of which 6 / 271 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 265 transition count 192
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 200 transition count 192
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 131 place count 200 transition count 159
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 197 place count 167 transition count 159
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 227 place count 137 transition count 129
Iterating global reduction 2 with 30 rules applied. Total rules applied 257 place count 137 transition count 129
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 257 place count 137 transition count 117
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 281 place count 125 transition count 117
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 321 place count 105 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 104 transition count 96
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 103 vertex of which 5 / 103 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 324 place count 100 transition count 96
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 328 place count 99 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 334 place count 96 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 336 place count 96 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 336 place count 96 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 338 place count 95 transition count 87
Applied a total of 338 rules in 32 ms. Remains 95 /271 variables (removed 176) and now considering 87/263 (removed 176) transitions.
// Phase 1: matrix 87 rows 95 cols
[2025-06-02 18:53:18] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:53:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-02 18:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:53:18] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:53:18] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-02 18:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 13/95 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 86/181 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 116 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3667 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 13/95 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 86/181 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 60/176 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2935 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6606ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6607ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/271 places, 87/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6865 ms. Remains : 95/271 places, 87/263 transitions.
[2025-06-02 18:53:24] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:53:24] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:53:24] [INFO ] Input system was already deterministic with 87 transitions.
[2025-06-02 18:53:24] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:53:24] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:53:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9800660641869656692.gal : 1 ms
[2025-06-02 18:53:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13504942707644368782.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/CTLFireability9800660641869656692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13504942707644368782.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,8.9291e+10,0.204674,8232,2,727,5,21135,5,0,468,23958,0
Converting to forward existential form...Done !
original formula: EF(((p151==1) * EF((p83==0))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p151==1)),TRUE) * (p83==0))] != FALSE
(forward)formula 0,1,0.259706,8488,1,0,8,21135,9,2,867,23958,4
FORMULA MedleyA-PT-21-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 239 transition count 231
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 239 transition count 231
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 83 place count 220 transition count 212
Iterating global reduction 0 with 19 rules applied. Total rules applied 102 place count 220 transition count 212
Applied a total of 102 rules in 14 ms. Remains 220 /271 variables (removed 51) and now considering 212/263 (removed 51) transitions.
// Phase 1: matrix 212 rows 220 cols
[2025-06-02 18:53:25] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:53:25] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-02 18:53:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:53:25] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-02 18:53:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:30] [INFO ] Deduced a trap composed of 18 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-02 18:53:30] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:31] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:31] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:31] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:31] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:31] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:31] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:32] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:32] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:34] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:34] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/253 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:43] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/432 variables, and 254 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/432 variables, 220/253 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 211/464 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:58] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:53:59] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:00] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:01] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:01] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:02] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:02] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:02] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:04] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:05] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:07] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:07] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:10] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:21] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:21] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 480 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 220/271 places, 212/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60581 ms. Remains : 220/271 places, 212/263 transitions.
[2025-06-02 18:54:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:54:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:54:25] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-02 18:54:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:54:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:54:25] [INFO ] Time to serialize gal into /tmp/CTLFireability933883562044424225.gal : 2 ms
[2025-06-02 18:54:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17635712865329722091.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/CTLFireability933883562044424225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17635712865329722091.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,1.31918e+17,2.06337,55200,2,10280,5,224657,6,0,1094,295065,0
Converting to forward existential form...Done !
original formula: EG(AG((AX((((p219==0)||(p240==0))||((p271==0)||(p301==0)))) + (p5==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((!(EX(!((((p219==0)||(p240==0))||((p271==0)||(p301==0)))))) + (p5==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t127, t142, t152, t169, t1...343
(forward)formula 0,0,16.2421,334228,1,0,430,1.69273e+06,453,226,6235,1.70736e+06,522
FORMULA MedleyA-PT-21-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 243 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 243 transition count 235
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 72 place count 227 transition count 219
Iterating global reduction 0 with 16 rules applied. Total rules applied 88 place count 227 transition count 219
Applied a total of 88 rules in 9 ms. Remains 227 /271 variables (removed 44) and now considering 219/263 (removed 44) transitions.
// Phase 1: matrix 219 rows 227 cols
[2025-06-02 18:54:42] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:42] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 18:54:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:42] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-02 18:54:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:47] [INFO ] Deduced a trap composed of 18 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-02 18:54:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:47] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:47] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:48] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:48] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:48] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:48] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:48] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:48] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:48] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:49] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:49] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:49] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:50] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/446 variables, 227/262 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:58] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/446 variables, and 263 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/446 variables, 227/262 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 218/480 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:15] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:16] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:16] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:16] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:17] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:18] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:19] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:19] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:21] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:22] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:23] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:24] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:28] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:29] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:55:42] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 496 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 227/271 places, 219/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 227/271 places, 219/263 transitions.
[2025-06-02 18:55:42] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:55:42] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:55:42] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-02 18:55:42] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:55:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:55:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9008692834008059681.gal : 1 ms
[2025-06-02 18:55:42] [INFO ] Time to serialize properties into /tmp/CTLFireability18093881465332776894.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/CTLFireability9008692834008059681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18093881465332776894.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,1.79012e+17,3.88605,90016,2,12439,5,363215,6,0,1129,506504,0
Converting to forward existential form...Done !
original formula: E(AX(((p44==1) + !((((p20==1)&&(p134==1)) + EX((p117==1)))))) U AX(((p222==1) * ((EX(EX((p155==1))) + (p75==1)) + A((p223==1) U (p243==1)...160
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(((p44==1) + !((((p20==1)&&(p134==1)) + EX((p117==1))))))))) * !(EX(!(((p222==1) * ((EX(EX((p1...265
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t40, t48, t54, t63, t64, t85, t100, t110, t115, t121...371
(forward)formula 0,0,22.5348,494184,1,0,425,2.61392e+06,468,213,6129,3.0293e+06,485
FORMULA MedleyA-PT-21-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 270 transition count 200
Reduce places removed 62 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 208 transition count 197
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 130 place count 205 transition count 197
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 130 place count 205 transition count 164
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 196 place count 172 transition count 164
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 223 place count 145 transition count 137
Iterating global reduction 3 with 27 rules applied. Total rules applied 250 place count 145 transition count 137
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 250 place count 145 transition count 128
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 268 place count 136 transition count 128
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 312 place count 114 transition count 106
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 114 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 314 place count 113 transition count 105
Applied a total of 314 rules in 24 ms. Remains 113 /271 variables (removed 158) and now considering 105/263 (removed 158) transitions.
// Phase 1: matrix 105 rows 113 cols
[2025-06-02 18:56:05] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:56:05] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 18:56:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:56:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 18:56:05] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:56:05] [INFO ] Redundant transitions in 4 ms returned []
Running 83 sub problems to find dead transitions.
[2025-06-02 18:56:05] [INFO ] Invariant cache hit.
[2025-06-02 18:56:05] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 11/113 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:06] [INFO ] Deduced a trap composed of 6 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-02 18:56:07] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:07] [INFO ] Deduced a trap composed of 2 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-02 18:56:07] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 105/218 variables, 113/137 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 140 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5865 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 113/113 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 11/113 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 105/218 variables, 113/137 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 83/223 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:14] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 224 constraints, problems are : Problem set: 0 solved, 83 unsolved in 7092 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 113/113 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12970ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 12970ms
Starting structural reductions in SI_CTL mode, iteration 1 : 113/271 places, 105/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13316 ms. Remains : 113/271 places, 105/263 transitions.
[2025-06-02 18:56:18] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:56:18] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:56:18] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-02 18:56:18] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:56:18] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:56:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8085610876977474159.gal : 1 ms
[2025-06-02 18:56:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16284194667452974670.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/CTLFireability8085610876977474159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16284194667452974670.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75011e+12,0.855604,21776,2,1688,5,92452,6,0,556,100421,0
Converting to forward existential form...Done !
original formula: AG((!(A(!((AF((p30==1)) * (p138==1))) U ((p19==1)&&(p21==1)))) * A((!(E(((p22==1)&&(p72==1)) U (p241==1))) + (p69==1)) U ((EF((p260==1)) ...229
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(((p19==1)&&(p21==1)))))) * !(E(!(((p19==1)&&(p21==1))) U (!(!((!(EG(!((p30==1)))) *...638
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t28, t31, t32, t41, t46, t53, t88, t90, t94, t95, t96, t98, Intersection with re...233
Detected timeout of ITS tools.
[2025-06-02 18:56:48] [INFO ] Flatten gal took : 3 ms
[2025-06-02 18:56:48] [INFO ] Applying decomposition
[2025-06-02 18:56:48] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5420760340222063005.txt' '-o' '/tmp/graph5420760340222063005.bin' '-w' '/tmp/graph5420760340222063005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5420760340222063005.bin' '-l' '-1' '-v' '-w' '/tmp/graph5420760340222063005.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:56:48] [INFO ] Decomposing Gal with order
[2025-06-02 18:56:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:56:48] [INFO ] Removed a total of 14 redundant transitions.
[2025-06-02 18:56:48] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:56:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-02 18:56:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15625750227153140723.gal : 2 ms
[2025-06-02 18:56:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10849753808048908215.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/CTLFireability15625750227153140723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10849753808048908215.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75011e+12,0.070724,6128,197,84,4190,657,363,6387,98,2414,0
Converting to forward existential form...Done !
original formula: AG((!(A(!((AF((i2.i0.u2.p30==1)) * (i4.u14.p138==1))) U ((i0.u0.p19==1)&&(i0.u0.p21==1)))) * A((!(E(((i0.u1.p22==1)&&(i0.u8.p72==1)) U (i...333
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(((i0.u0.p19==1)&&(i0.u0.p21==1)))))) * !(E(!(((i0.u0.p19==1)&&(i0.u0.p21==1))) U (!...856
Reverse transition relation is NOT exact ! Due to transitions t31, t32, t46, t90, t94, t98, i0.u0.t0, i2.t95, i2.i0.t28, i3.t88, i4.u10.t1, i6.u17.t53, i6....282
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,0.741399,22128,1,0,36760,1983,1784,79882,517,10916,47843
FORMULA MedleyA-PT-21-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 242 transition count 234
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 242 transition count 234
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 74 place count 226 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 90 place count 226 transition count 218
Applied a total of 90 rules in 8 ms. Remains 226 /271 variables (removed 45) and now considering 218/263 (removed 45) transitions.
// Phase 1: matrix 218 rows 226 cols
[2025-06-02 18:56:49] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:56:49] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 18:56:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:56:50] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-02 18:56:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:55] [INFO ] Deduced a trap composed of 18 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-02 18:56:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:55] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:55] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:55] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:55] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:56] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:56] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:56] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:56] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:57] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:56:58] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:02] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/444 variables, 226/260 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:11] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:15] [INFO ] Deduced a trap along path composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 262 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/444 variables, 226/261 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 217/478 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:23] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:23] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:24] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:24] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:25] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:25] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:26] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:26] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:27] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 9/487 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:28] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:30] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:43] [INFO ] Deduced a trap along path composed of 5 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:57:48] [INFO ] Deduced a trap along path composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 492 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 226/271 places, 218/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60424 ms. Remains : 226/271 places, 218/263 transitions.
[2025-06-02 18:57:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:57:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:57:50] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 18:57:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:57:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:57:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2290639364014032097.gal : 1 ms
[2025-06-02 18:57:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9604500773579078899.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/CTLFireability2290639364014032097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9604500773579078899.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,1.6414e+17,3.18004,80852,2,14304,5,302564,6,0,1124,448028,0
Converting to forward existential form...Done !
original formula: AF(((AX((((AF((p41==1)) * (p19==1)) * ((p21==1)&&(p135==1))) * ((p123==1) * EX(((p183==0)||(p185==0)))))) + ((p18==1)&&(p50==1))) + (AF((...177
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((((!(EG(!((p41==1)))) * (p19==1)) * ((p21==1)&&(p135==1))) * ((p123==1) * EX(((p183==0)||(...240
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t102, t108, t111, t120, t131, t1...367
Detected timeout of ITS tools.
[2025-06-02 18:58:20] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:58:20] [INFO ] Applying decomposition
[2025-06-02 18:58:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13673064441820576093.txt' '-o' '/tmp/graph13673064441820576093.bin' '-w' '/tmp/graph13673064441820576093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13673064441820576093.bin' '-l' '-1' '-v' '-w' '/tmp/graph13673064441820576093.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:58:20] [INFO ] Decomposing Gal with order
[2025-06-02 18:58:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:58:20] [INFO ] Removed a total of 28 redundant transitions.
[2025-06-02 18:58:20] [INFO ] Flatten gal took : 15 ms
[2025-06-02 18:58:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 18:58:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13696928779403742100.gal : 4 ms
[2025-06-02 18:58:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7690306472195841644.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/CTLFireability13696928779403742100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7690306472195841644.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,1.6414e+17,0.430325,15916,2108,25,28351,240,528,29948,45,595,0
Converting to forward existential form...Done !
original formula: AF(((AX((((AF((i2.u12.p41==1)) * (i1.u3.p19==1)) * ((i1.u3.p21==1)&&(i8.u42.p135==1))) * ((i7.u33.p123==1) * EX(((i11.u54.p183==0)||(i11....261
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((((!(EG(!((i2.u12.p41==1)))) * (i1.u3.p19==1)) * ((i1.u3.p21==1)&&(i8.u42.p135==1))) * ((i...324
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t175, t176, t177, t179, t180, t181, t185, t186, t187, t197, t200, t205, t208, t213,...512
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 241 transition count 233
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 241 transition count 233
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 77 place count 224 transition count 216
Iterating global reduction 0 with 17 rules applied. Total rules applied 94 place count 224 transition count 216
Applied a total of 94 rules in 9 ms. Remains 224 /271 variables (removed 47) and now considering 216/263 (removed 47) transitions.
// Phase 1: matrix 216 rows 224 cols
[2025-06-02 18:58:50] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:58:50] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-02 18:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:58:50] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-02 18:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:55] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:55] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:55] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:55] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:56] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:56] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:56] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:56] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:56] [INFO ] Deduced a trap composed of 26 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-02 18:58:56] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:57] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:57] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:58] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:58] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:58:59] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/440 variables, 224/260 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:07] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 261 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:21] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/440 variables, 224/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 215/476 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:25] [INFO ] Deduced a trap composed of 7 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-02 18:59:25] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:27] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:28] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:28] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:28] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:29] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 7/483 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:31] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:31] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:32] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:32] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:33] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 5/488 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:37] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:59:37] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 491 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 224/271 places, 216/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60486 ms. Remains : 224/271 places, 216/263 transitions.
[2025-06-02 18:59:50] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:59:50] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:59:50] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-02 18:59:50] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:59:50] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:59:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15984668162232427108.gal : 2 ms
[2025-06-02 18:59:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10351952998227070388.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/CTLFireability15984668162232427108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10351952998227070388.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,1.49558e+17,2.4953,67072,2,11417,5,277953,6,0,1114,364150,0
Converting to forward existential form...Done !
original formula: E(EG((p208==1)) U ((p161!=1) * AX((AF(((p147==1)&&(p300==1))) + AG(EF((p218==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,EG((p208==1))) * (p161!=1)) * !(EX(!((!(EG(!(((p147==1)&&(p300==1))))) + !(E(TRUE U !(E(TRUE U (p21...179
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t55, t58, t59, t63, t64, t85, t89, t97, t101, t...368
Detected timeout of ITS tools.
[2025-06-02 19:00:20] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:00:20] [INFO ] Applying decomposition
[2025-06-02 19:00:20] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13434622872613394196.txt' '-o' '/tmp/graph13434622872613394196.bin' '-w' '/tmp/graph13434622872613394196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13434622872613394196.bin' '-l' '-1' '-v' '-w' '/tmp/graph13434622872613394196.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:00:20] [INFO ] Decomposing Gal with order
[2025-06-02 19:00:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:00:20] [INFO ] Removed a total of 28 redundant transitions.
[2025-06-02 19:00:20] [INFO ] Flatten gal took : 14 ms
[2025-06-02 19:00:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 19:00:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16607947795121370552.gal : 3 ms
[2025-06-02 19:00:20] [INFO ] Time to serialize properties into /tmp/CTLFireability4725491365045973.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/CTLFireability16607947795121370552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4725491365045973.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
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,1.49558e+17,0.624578,21768,2018,26,43478,272,506,45698,44,707,0
Converting to forward existential form...Done !
original formula: E(EG((i12.i1.u64.p208==1)) U ((i9.i1.u48.p161!=1) * AX((AF(((i7.u35.p147==1)&&(i5.u86.p300==1))) + AG(EF((i12.i1.u67.p218==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,EG((i12.i1.u64.p208==1))) * (i9.i1.u48.p161!=1)) * !(EX(!((!(EG(!(((i7.u35.p147==1)&&(i5.u86.p300==...225
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t173, t174, t175, t177, t178, t179, t183, t184, t185, t195, t198, t206, t211, t214,...545
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,28.6686,768700,1,0,1.64608e+06,281,3138,2.27293e+06,219,707,1957981
FORMULA MedleyA-PT-21-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 263/263 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 245 transition count 237
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 245 transition count 237
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 231 transition count 223
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 231 transition count 223
Applied a total of 80 rules in 11 ms. Remains 231 /271 variables (removed 40) and now considering 223/263 (removed 40) transitions.
// Phase 1: matrix 223 rows 231 cols
[2025-06-02 19:00:49] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:00:49] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 19:00:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:00:50] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-06-02 19:00:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:55] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:56] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:56] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:56] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:56] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:56] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:56] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/454 variables, 231/265 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:14] [INFO ] Deduced a trap along path composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/454 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 266 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:21] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:21] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:24] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 223/454 variables, 231/268 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 222/490 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:27] [INFO ] Deduced a trap composed of 7 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-02 19:01:27] [INFO ] Deduced a trap composed of 45 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-02 19:01:27] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:29] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:30] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:30] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:31] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:31] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:32] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 13/503 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:34] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:35] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:37] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:37] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:01:42] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 509 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 231/271 places, 223/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60485 ms. Remains : 231/271 places, 223/263 transitions.
[2025-06-02 19:01:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:01:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:01:50] [INFO ] Input system was already deterministic with 223 transitions.
[2025-06-02 19:01:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:01:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:01:50] [INFO ] Time to serialize gal into /tmp/CTLFireability10322870043578365724.gal : 1 ms
[2025-06-02 19:01:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12613929582389288104.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/CTLFireability10322870043578365724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12613929582389288104.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74566e+17,15.7996,314868,2,45777,5,1.05523e+06,6,0,1149,2.02051e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 19:02:20] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:02:20] [INFO ] Applying decomposition
[2025-06-02 19:02:20] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15007509112461874839.txt' '-o' '/tmp/graph15007509112461874839.bin' '-w' '/tmp/graph15007509112461874839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15007509112461874839.bin' '-l' '-1' '-v' '-w' '/tmp/graph15007509112461874839.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:02:20] [INFO ] Decomposing Gal with order
[2025-06-02 19:02:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:02:20] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-02 19:02:20] [INFO ] Flatten gal took : 13 ms
[2025-06-02 19:02:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 19:02:20] [INFO ] Time to serialize gal into /tmp/CTLFireability169612002665501397.gal : 3 ms
[2025-06-02 19:02:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7861365360208314515.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/CTLFireability169612002665501397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7861365360208314515.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74566e+17,2.45914,58936,4468,41,115102,499,567,173452,57,1687,0
Converting to forward existential form...Done !
original formula: EF((((AX(A(((i7.u37.p110==1)&&(i9.i0.u49.p148==1)) U ((i10.u59.p177==1)&&(i11.u65.p197==1)))) * A((i15.u87.p281==1) U (i12.i2.u71.p221==1...460
=> equivalent forward existential formula: ((([(FwdU(EY(((FwdU(Init,TRUE) * ((!(EX(!(!((E(!(((i10.u59.p177==1)&&(i11.u65.p197==1))) U (!(((i7.u37.p110==1)&...2369
Reverse transition relation is NOT exact ! Due to transitions t10, t31, t180, t181, t182, t184, t185, t186, t190, t191, t192, t202, t205, t210, t218, t221,...637
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
[2025-06-02 19:02:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 19:02:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:02:50] [INFO ] Applying decomposition
[2025-06-02 19:02:50] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3384413342943352184.txt' '-o' '/tmp/graph3384413342943352184.bin' '-w' '/tmp/graph3384413342943352184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3384413342943352184.bin' '-l' '-1' '-v' '-w' '/tmp/graph3384413342943352184.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:02:50] [INFO ] Decomposing Gal with order
[2025-06-02 19:02:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:02:50] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-02 19:02:50] [INFO ] Flatten gal took : 13 ms
[2025-06-02 19:02:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 19:02:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1988837452185140515.gal : 5 ms
[2025-06-02 19:02:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10050850621213981112.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/CTLFireability1988837452185140515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10050850621213981112.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 4 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,1.73178e+18,13.4195,261584,10655,41,459163,409,619,899197,57,1313,0
Converting to forward existential form...Done !
original formula: (AG(((A(EX(A(((i4.u40.p147==1)&&(i15.i1.u106.p300==1)) U (i11.i0.u63.p170==1))) U (A((i6.i0.u48.p131==1) U (i9.i1.u38.p105==1)) * E((i7.i...655
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(((!((E(!((!((E(!((i9.i1.u38.p105==1)) U (!((i6.i0.u48.p131==1)) * !((i9.i1.u38.p105==1...2113
Reverse transition relation is NOT exact ! Due to transitions t10, t220, t221, t222, t224, t225, t226, t232, t245, t259, i0.t218, i0.t214, i0.u3.t0, i1.t21...924
ITS-tools command line returned an error code 139
[2025-06-02 19:05:04] [INFO ] Applying decomposition
[2025-06-02 19:05:04] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:05:04] [INFO ] Decomposing Gal with order
[2025-06-02 19:05:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:05:04] [INFO ] Removed a total of 10 redundant transitions.
[2025-06-02 19:05:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 19:05:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 11 ms.
[2025-06-02 19:05:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3942042104881926658.gal : 3 ms
[2025-06-02 19:05:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6370029470483020871.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/CTLFireability3942042104881926658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6370029470483020871.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 4 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,1.73178e+18,96.9447,1872596,10138,2395,1.93928e+06,19356,392,1.64531e+07,238,296476,0
Converting to forward existential form...Done !
original formula: (AG(((A(EX(A(((i0.i0.i0.i0.i0.i1.i1.u23.p147==1)&&(u38.p300==1)) U (i0.i0.i0.i0.i1.u54.p170==1))) U (A((i0.i0.i0.i0.i0.i1.i1.i0.u22.p131=...993
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(((!((E(!((!((E(!((i0.i0.i0.i0.i0.i1.i1.u46.p105==1)) U (!((i0.i0.i0.i0.i0.i1.i1.i0.u22...3073
Reverse transition relation is NOT exact ! Due to transitions t221, t226, u38.t6, u38.t7, i0.t231, i0.i0.u34.t23, i0.i0.u34.t27, i0.i0.u34.t30, i0.i0.i0.u3...1796
Detected timeout of ITS tools.
[2025-06-02 19:31:55] [INFO ] Flatten gal took : 504 ms
[2025-06-02 19:31:57] [INFO ] Input system was already deterministic with 263 transitions.
[2025-06-02 19:31:57] [INFO ] Transformed 271 places.
[2025-06-02 19:31:57] [INFO ] Transformed 263 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 19:31:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10898711133614298454.gal : 30 ms
[2025-06-02 19:31:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13489990146466466459.ctl : 20 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/CTLFireability10898711133614298454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13489990146466466459.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="MedleyA-PT-21"
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 MedleyA-PT-21, 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 r128-smll-174876524200258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-21.tgz
mv MedleyA-PT-21 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 ;