About the Execution of ITS-Tools for ShieldIIPs-PT-003A
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 | [undef] | Time out reached |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532400282.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 ShieldIIPs-PT-003A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532400282
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K 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.7K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 26K 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 ShieldIIPs-PT-003A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2023-15
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-00
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-01
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-02
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-03
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-04
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-05
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-06
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-07
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-08
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-09
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-10
FORMULA_NAME ShieldIIPs-PT-003A-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749020016211
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-003A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 06:53:37] [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-04 06:53:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 06:53:37] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2025-06-04 06:53:37] [INFO ] Transformed 78 places.
[2025-06-04 06:53:37] [INFO ] Transformed 75 transitions.
[2025-06-04 06:53:37] [INFO ] Found NUPN structural information;
[2025-06-04 06:53:37] [INFO ] Parsed PT model containing 78 places and 75 transitions and 330 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 65 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 06:53:37] [INFO ] Computed 28 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:53:37] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-04 06:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:53:37] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 06:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:53:38] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:53:38] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:53:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:53:39] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:53:39] [INFO ] Deduced a trap composed of 19 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-04 06:53:39] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 3120 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:53:45] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:53:55] [INFO ] Deduced a trap along path composed of 8 places in 38 ms of which 12 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 29267 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32432ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 32447ms
Finished structural reductions in LTL mode , in 1 iterations and 32811 ms. Remains : 78/78 places, 75/75 transitions.
Support contains 65 out of 78 places after structural reductions.
[2025-06-04 06:54:10] [INFO ] Flatten gal took : 26 ms
[2025-06-04 06:54:10] [INFO ] Flatten gal took : 11 ms
[2025-06-04 06:54:10] [INFO ] Input system was already deterministic with 75 transitions.
Reduction of identical properties reduced properties to check from 70 to 62
RANDOM walk for 40000 steps (211 resets) in 2189 ms. (18 steps per ms) remains 3/62 properties
BEST_FIRST walk for 40004 steps (44 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (46 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (42 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
[2025-06-04 06:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (OVERLAPS) 60/78 variables, 28/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 60/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/153 variables, 78/184 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:11] [INFO ] Deduced a trap along path composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/185 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 185 constraints, problems are : Problem set: 2 solved, 1 unsolved in 141 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/25 variables, 7/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 18/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/78 variables, 21/53 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 53/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:11] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/107 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/153 variables, 78/185 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 1/186 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 1/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 187 constraints, problems are : Problem set: 2 solved, 1 unsolved in 149 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 304ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 75/75 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 78 transition count 74
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 76 transition count 73
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 76 transition count 73
Applied a total of 20 rules in 29 ms. Remains 76 /78 variables (removed 2) and now considering 73/75 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 76/78 places, 73/75 transitions.
RANDOM walk for 40000 steps (22 resets) in 503 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (44 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2414862 steps, run timeout after 3001 ms. (steps per millisecond=804 ) properties seen :0 out of 1
Probabilistic random walk after 2414862 steps, saw 442488 distinct states, run finished after 3005 ms. (steps per millisecond=803 ) properties seen :0
// Phase 1: matrix 73 rows 76 cols
[2025-06-04 06:54:15] [INFO ] Computed 28 invariants in 5 ms
[2025-06-04 06:54:15] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/74 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/76 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 73/149 variables, 76/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/149 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Domain max(s): 76/76 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/74 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/76 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:15] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 73/149 variables, 76/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:15] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/149 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Domain max(s): 76/76 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 7 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2025-06-04 06:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:54:15] [INFO ] Implicit Places using invariants in 76 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/76 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 85 ms. Remains : 75/76 places, 73/73 transitions.
RANDOM walk for 40000 steps (17 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (46 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2502683 steps, run timeout after 3001 ms. (steps per millisecond=833 ) properties seen :0 out of 1
Probabilistic random walk after 2502683 steps, saw 453420 distinct states, run finished after 3001 ms. (steps per millisecond=833 ) properties seen :0
// Phase 1: matrix 73 rows 75 cols
[2025-06-04 06:54:18] [INFO ] Computed 27 invariants in 5 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/73 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 49/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/75 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 73/148 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/148 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/73 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 49/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:18] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/75 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 73/148 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/148 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:18] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/148 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/148 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/148 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3825 steps, including 319 resets, run visited all 1 properties in 14 ms. (steps per millisecond=273 )
Parikh walk visited 1 properties in 17 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-04 06:54:19] [INFO ] Flatten gal took : 8 ms
[2025-06-04 06:54:19] [INFO ] Flatten gal took : 8 ms
[2025-06-04 06:54:19] [INFO ] Input system was already deterministic with 75 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 06:54:19] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:54:19] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-04 06:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:54:19] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 06:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:19] [INFO ] Deduced a trap composed of 9 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-04 06:54:19] [INFO ] Deduced a trap composed of 15 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-04 06:54:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:20] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:20] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:20] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2533 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:26] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:54:35] [INFO ] Deduced a trap along path composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28536 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31087ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 31089ms
Finished structural reductions in LTL mode , in 1 iterations and 31220 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 06:54:50] [INFO ] Flatten gal took : 6 ms
[2025-06-04 06:54:50] [INFO ] Flatten gal took : 6 ms
[2025-06-04 06:54:50] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 06:54:50] [INFO ] Flatten gal took : 6 ms
[2025-06-04 06:54:50] [INFO ] Flatten gal took : 5 ms
[2025-06-04 06:54:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3753451267227481485.gal : 3 ms
[2025-06-04 06:54:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6489287543352501211.ctl : 9 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/CTLFireability3753451267227481485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6489287543352501211.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,2.11657e+11,3.03891,95280,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: AF(((EX(((p12==0)||(p45==0))) * (p76==1)) * (((p29==1)&&(p44==1)) + (AG(((((p61==1)&&(p67==1))&&((p77==1)&&(p54==1)))&&(p69==1))) * ((AF(...240
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((p12==0)||(p45==0))) * (p76==1)) * (((p29==1)&&(p44==1)) + (!(E(TRUE U !(((((p61==1)&&(p67==1...303
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 06:55:20] [INFO ] Flatten gal took : 5 ms
[2025-06-04 06:55:20] [INFO ] Applying decomposition
[2025-06-04 06:55: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/graph12876606940332321512.txt' '-o' '/tmp/graph12876606940332321512.bin' '-w' '/tmp/graph12876606940332321512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12876606940332321512.bin' '-l' '-1' '-v' '-w' '/tmp/graph12876606940332321512.weights' '-q' '0' '-e' '0.001'
[2025-06-04 06:55:20] [INFO ] Decomposing Gal with order
[2025-06-04 06:55:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 06:55:20] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 06:55:20] [INFO ] Flatten gal took : 40 ms
[2025-06-04 06:55:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 9 ms.
[2025-06-04 06:55:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11380348483498593138.gal : 3 ms
[2025-06-04 06:55:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8142781801760086222.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/CTLFireability11380348483498593138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8142781801760086222.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,2.11657e+11,14.0628,266244,924,31,346000,141,196,1.1691e+06,32,640,0
Converting to forward existential form...Done !
original formula: AF(((EX(((i1.i2.u5.p12==0)||(i4.u17.p45==0))) * (i6.u27.p76==1)) * (((i2.u10.p29==1)&&(i2.u16.p44==1)) + (AG(((((i7.u22.p61==1)&&(i7.u24....361
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((i1.i2.u5.p12==0)||(i4.u17.p45==0))) * (i6.u27.p76==1)) * (((i2.u10.p29==1)&&(i2.u16.p44==1))...424
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t42, t55, t72, i0.t63, i0.u6.t1, i0.u6.t2, i1.t73, i1.i1.t60, i1.i1.u8.t3, i1.i1...489
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 06:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:55:50] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 06:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:55:50] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 06:55: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/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:55:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:55:51] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:55:51] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:55:52] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:55:52] [INFO ] Deduced a trap composed of 19 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-04 06:55:52] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2509 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:55:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:56:07] [INFO ] Deduced a trap along path composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28276 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30795ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30796ms
Finished structural reductions in LTL mode , in 1 iterations and 30942 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 06:56:21] [INFO ] Flatten gal took : 6 ms
[2025-06-04 06:56:21] [INFO ] Flatten gal took : 4 ms
[2025-06-04 06:56:21] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 06:56:21] [INFO ] Flatten gal took : 5 ms
[2025-06-04 06:56:21] [INFO ] Flatten gal took : 6 ms
[2025-06-04 06:56:21] [INFO ] Time to serialize gal into /tmp/CTLFireability321472497298697784.gal : 1 ms
[2025-06-04 06:56:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9577316484101908746.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/CTLFireability321472497298697784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9577316484101908746.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.11657e+11,2.69613,95372,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: EX(EF(((((A((((p38==1)&&(p48==1))&&(p50==1)) U (((p36==1)&&(p42==1))&&(p52==1))) * AX(E((((p63==1)&&(p71==1))&&(p77==1)) U ((p33==1)&&(p4...291
=> equivalent forward existential formula: [(((((FwdU(EY(Init),TRUE) * ((p50==1)&&(p71==1))) * (((p65==1)&&(p76==1))&&((p38==1)&&(p48==1)))) * (!((E(!((((p...448
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 06:56:51] [INFO ] Flatten gal took : 11 ms
[2025-06-04 06:56:51] [INFO ] Applying decomposition
[2025-06-04 06:56:51] [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/graph4375839853255905116.txt' '-o' '/tmp/graph4375839853255905116.bin' '-w' '/tmp/graph4375839853255905116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4375839853255905116.bin' '-l' '-1' '-v' '-w' '/tmp/graph4375839853255905116.weights' '-q' '0' '-e' '0.001'
[2025-06-04 06:56:51] [INFO ] Decomposing Gal with order
[2025-06-04 06:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 06:56:51] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 06:56:51] [INFO ] Flatten gal took : 10 ms
[2025-06-04 06:56:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2025-06-04 06:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11205566174062421230.gal : 1 ms
[2025-06-04 06:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability448974285754981519.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/CTLFireability11205566174062421230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability448974285754981519.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 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.11657e+11,12.2285,209776,989,30,274142,146,167,878357,32,650,0
Converting to forward existential form...Done !
original formula: EX(EF(((((A((((i5.u14.p38==1)&&(i5.u17.p48==1))&&(i5.u18.p50==1)) U (((i4.u13.p36==1)&&(i4.u15.p42==1))&&(i5.u18.p52==1))) * AX(E((((i6.u...438
=> equivalent forward existential formula: [(((((FwdU(EY(Init),TRUE) * ((i5.u18.p50==1)&&(i6.u26.p71==1))) * (((i8.u24.p65==1)&&(i6.u27.p76==1))&&((i5.u14....637
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t42, t57, t71, i1.t63, i1.u6.t1, i1.u6.t2, i2.t73, i2.t60, i2.u8.t3, i2.u8.t4, i...474
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 77 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 74 transition count 72
Applied a total of 5 rules in 8 ms. Remains 74 /78 variables (removed 4) and now considering 72/75 (removed 3) transitions.
// Phase 1: matrix 72 rows 74 cols
[2025-06-04 06:57:21] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:57:21] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-04 06:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:57:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 06:57:22] [INFO ] Redundant transitions in 21 ms returned [64]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 71 rows 74 cols
[2025-06-04 06:57:22] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:57:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:57:22] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:57:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/145 variables, 74/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:57:22] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1661 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/145 variables, 74/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 70/249 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:57:24] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 250 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2389 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4078ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 4078ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/78 places, 71/75 transitions.
Applied a total of 0 rules in 7 ms. Remains 74 /74 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4234 ms. Remains : 74/78 places, 71/75 transitions.
[2025-06-04 06:57:26] [INFO ] Flatten gal took : 7 ms
[2025-06-04 06:57:26] [INFO ] Flatten gal took : 4 ms
[2025-06-04 06:57:26] [INFO ] Input system was already deterministic with 71 transitions.
[2025-06-04 06:57:26] [INFO ] Flatten gal took : 3 ms
[2025-06-04 06:57:26] [INFO ] Flatten gal took : 3 ms
[2025-06-04 06:57:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8839904485520178482.gal : 4 ms
[2025-06-04 06:57:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14432066859942093604.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/CTLFireability8839904485520178482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14432066859942093604.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,7.85913e+10,1.45268,56124,2,3916,5,184078,6,0,370,382089,0
Converting to forward existential form...Done !
original formula: AF(AG(AF((p16==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!((p16==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t25, t32...370
Detected timeout of ITS tools.
[2025-06-04 06:57:56] [INFO ] Flatten gal took : 4 ms
[2025-06-04 06:57:56] [INFO ] Applying decomposition
[2025-06-04 06:57:56] [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/graph551137645858622286.txt' '-o' '/tmp/graph551137645858622286.bin' '-w' '/tmp/graph551137645858622286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph551137645858622286.bin' '-l' '-1' '-v' '-w' '/tmp/graph551137645858622286.weights' '-q' '0' '-e' '0.001'
[2025-06-04 06:57:56] [INFO ] Decomposing Gal with order
[2025-06-04 06:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 06:57:56] [INFO ] Removed a total of 43 redundant transitions.
[2025-06-04 06:57:56] [INFO ] Flatten gal took : 14 ms
[2025-06-04 06:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2025-06-04 06:57:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8039747478049942348.gal : 1 ms
[2025-06-04 06:57:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16445168584521093027.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/CTLFireability8039747478049942348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16445168584521093027.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,7.85913e+10,7.49124,170776,1076,29,234041,65,160,912643,33,258,0
Converting to forward existential form...Done !
original formula: AF(AG(AF((i0.u6.p16==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!((i0.u6.p16==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t32, t44, t60, i0.t50, i0.u6.t1, i0.u6.t2, i2.t62, i2.t49, i2.u8.t3, i2.u8.t4, i...491
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 06:58:26] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:58:26] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-04 06:58:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:58:26] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 06:58: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/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:58:26] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:58:26] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:58:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:58:27] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:58:27] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:58:27] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2360 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:58:33] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:58:42] [INFO ] Deduced a trap along path composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28314 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30697ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30698ms
Finished structural reductions in LTL mode , in 1 iterations and 30830 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 06:58:57] [INFO ] Flatten gal took : 10 ms
[2025-06-04 06:58:57] [INFO ] Flatten gal took : 4 ms
[2025-06-04 06:58:57] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 06:58:57] [INFO ] Flatten gal took : 3 ms
[2025-06-04 06:58:57] [INFO ] Flatten gal took : 3 ms
[2025-06-04 06:58:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14920464150421394725.gal : 1 ms
[2025-06-04 06:58:57] [INFO ] Time to serialize properties into /tmp/CTLFireability11320527710545658645.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/CTLFireability14920464150421394725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11320527710545658645.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.11657e+11,2.82845,95300,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: AX(EF((EF(((((((p6==1)&&(p16==1))||((p6==1)&&(p17==1)))&&(p13==1))&&((p21==1)&&(p27==1)))&&(((p63==1)&&(p73==1))&&(p77==1)))) * (AX(((((p...263
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (E(TRUE U ((((((p6==1)&&(p16==1))||((p6==1)&&(p17==1)))&&(p13==1))&&((p21==1)&&(p27==1))...340
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 06:59:27] [INFO ] Flatten gal took : 3 ms
[2025-06-04 06:59:27] [INFO ] Applying decomposition
[2025-06-04 06:59:27] [INFO ] Flatten gal took : 4 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/graph5316942031187848510.txt' '-o' '/tmp/graph5316942031187848510.bin' '-w' '/tmp/graph5316942031187848510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5316942031187848510.bin' '-l' '-1' '-v' '-w' '/tmp/graph5316942031187848510.weights' '-q' '0' '-e' '0.001'
[2025-06-04 06:59:27] [INFO ] Decomposing Gal with order
[2025-06-04 06:59:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 06:59:27] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 06:59:27] [INFO ] Flatten gal took : 14 ms
[2025-06-04 06:59:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 3 ms.
[2025-06-04 06:59:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10500445702998823740.gal : 2 ms
[2025-06-04 06:59:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4837180313948192496.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/CTLFireability10500445702998823740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4837180313948192496.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,2.11657e+11,9.82213,246456,1191,31,360113,140,187,1.39467e+06,32,645,0
Converting to forward existential form...Done !
original formula: AX(EF((EF(((((((i0.i1.u2.p6==1)&&(i0.i1.u6.p16==1))||((i0.i1.u2.p6==1)&&(i0.i1.u6.p17==1)))&&(i1.u5.p13==1))&&((i1.u8.p21==1)&&(i0.i1.u9....414
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (E(TRUE U ((((((i0.i1.u2.p6==1)&&(i0.i1.u6.p16==1))||((i0.i1.u2.p6==1)&&(i0.i1.u6.p17==1...491
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t42, t55, t73, i0.i1.t63, i0.i1.t72, i0.i1.u6.t1, i0.i1.u6.t2, i0.i1.u9.t5, i0.i...492
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 06:59:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:59:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-04 06:59:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 06:59:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 06:59:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:59:57] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:59:58] [INFO ] Deduced a trap composed of 15 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-04 06:59:58] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:59:58] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 06:59:58] [INFO ] Deduced a trap composed of 19 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-04 06:59:58] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2468 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:00:04] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:00:13] [INFO ] Deduced a trap along path composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28476 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30954ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30955ms
Finished structural reductions in LTL mode , in 1 iterations and 31078 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:00:28] [INFO ] Flatten gal took : 9 ms
[2025-06-04 07:00:28] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:00:28] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:00:28] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:00:28] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:00:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9841663216170541240.gal : 1 ms
[2025-06-04 07:00:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7204621725382924662.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/CTLFireability9841663216170541240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7204621725382924662.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,2.11657e+11,2.8391,96780,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: EG((A((EG(((p3==1)&&(p24==1))) + (((((p13==1)&&(p21==1))&&(p25==1))||((p58==1)&&(p73==1))) * AG((p47==1)))) U AF(((!(((p11==1)&&(p15==1))...389
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(!(EG(!(((!(((p11==1)&&(p15==1))&&(p26==1)))&&((p21==1)||((p30==1)&&(p43==1)))))))) U (!((EG((...653
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:00:58] [INFO ] Flatten gal took : 4 ms
[2025-06-04 07:00:58] [INFO ] Applying decomposition
[2025-06-04 07:00:58] [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/graph10135737642063537012.txt' '-o' '/tmp/graph10135737642063537012.bin' '-w' '/tmp/graph10135737642063537012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10135737642063537012.bin' '-l' '-1' '-v' '-w' '/tmp/graph10135737642063537012.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:00:58] [INFO ] Decomposing Gal with order
[2025-06-04 07:00:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:00:58] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:00:58] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:00:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2025-06-04 07:00:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9911705945883016415.gal : 1 ms
[2025-06-04 07:00:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14432391787867820749.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/CTLFireability9911705945883016415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14432391787867820749.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,2.11657e+11,8.22027,164160,1009,30,198894,226,196,970027,32,1636,0
Converting to forward existential form...Done !
original formula: EG((A((EG(((i1.u1.p3==1)&&(i2.i1.u9.p24==1))) + (((((i2.i1.u5.p13==1)&&(i2.i0.u8.p21==1))&&(i2.i1.u9.p25==1))||((i8.u21.p58==1)&&(i8.u26....587
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(!(EG(!(((!(((i2.i1.u4.p11==1)&&(i0.u6.p15==1))&&(i2.i1.u9.p26==1)))&&((i2.i0.u8.p21==1)||((i3...945
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t40, t57, t72, i0.t63, i0.u6.t1, i0.u6.t2, i2.t74, i2.i0.t60, i2.i0.u8.t3, i2.i0...489
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:01:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:01:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-04 07:01:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:01:28] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:01:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:01:29] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:01:29] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:01:29] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:01:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:01:30] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:01:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2438 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:01:35] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:01:45] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28417 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30866ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30866ms
Finished structural reductions in LTL mode , in 1 iterations and 30987 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:01:59] [INFO ] Flatten gal took : 10 ms
[2025-06-04 07:01:59] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:01:59] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:01:59] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:01:59] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:01:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2319503453620375583.gal : 1 ms
[2025-06-04 07:01:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17472673243246938909.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/CTLFireability2319503453620375583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17472673243246938909.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.11657e+11,2.90483,96208,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: (EG(((((AX(((p1==0)||(p20==0))) + AX(((p53==0)||(p74==0)))) + (EF((p41==1)) + ((p33==1)&&(p48==1)))) + ((p26==0)&&(((p38==0)||(p48==0))||...411
=> equivalent forward existential formula: [FwdG((FwdU((Init * EG(((((!(EX(!(((p1==0)||(p20==0))))) + !(EX(!(((p53==0)||(p74==0)))))) + (E(TRUE U (p41==1))...497
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:02:29] [INFO ] Flatten gal took : 9 ms
[2025-06-04 07:02:29] [INFO ] Applying decomposition
[2025-06-04 07:02:29] [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/graph6231170806269562835.txt' '-o' '/tmp/graph6231170806269562835.bin' '-w' '/tmp/graph6231170806269562835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6231170806269562835.bin' '-l' '-1' '-v' '-w' '/tmp/graph6231170806269562835.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:02:29] [INFO ] Decomposing Gal with order
[2025-06-04 07:02:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:02:29] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:02:29] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:02:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-04 07:02:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6110914487518375494.gal : 1 ms
[2025-06-04 07:02:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13891624668529869015.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/CTLFireability6110914487518375494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13891624668529869015.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,2.11657e+11,3.81771,104444,1004,30,153778,99,167,538431,32,428,0
Converting to forward existential form...Done !
original formula: (EG(((((AX(((i1.u0.p1==0)||(i1.u8.p20==0))) + AX(((i8.u19.p53==0)||(i7.u27.p74==0)))) + (EF((i4.u15.p41==1)) + ((i5.u12.p33==1)&&(i5.u17....594
=> equivalent forward existential formula: [FwdG((FwdU((Init * EG(((((!(EX(!(((i1.u0.p1==0)||(i1.u8.p20==0))))) + !(EX(!(((i8.u19.p53==0)||(i7.u27.p74==0))...680
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t38, t57, t73, i1.t60, i1.u8.t3, i1.u8.t4, i2.t72, i2.t63, i2.u6.t1, i2.u6.t2, i...474
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:02:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:02:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-04 07:02:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:02:59] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:02:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:03:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:03:00] [INFO ] Deduced a trap composed of 15 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-04 07:03:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:03:01] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:03:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:03:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2486 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:03:06] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:03:16] [INFO ] Deduced a trap along path composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28205 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30737ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30738ms
Finished structural reductions in LTL mode , in 1 iterations and 30855 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:03:30] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:03:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:03:30] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:03:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:03:30] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:03:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13596167305596763449.gal : 1 ms
[2025-06-04 07:03:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12115347110804421791.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/CTLFireability13596167305596763449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12115347110804421791.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.11657e+11,2.82454,96292,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: EX(A(((!(EF((((p61==1)&&(p67==1))&&(p76==1)))) * (p72!=1)) * (A((((p11==1)&&(p17==1))&&(p26==1)) U (((p61==1)&&(p65==1))&&(p76==1))) + !(...330
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((E(E(TRUE U (((p38==1)&&(p48==1))&&(p50==1))) U ((((p26==1)||(((p63==1)&&(p71==1))&&(p75==1...818
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:04:00] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:04:00] [INFO ] Applying decomposition
[2025-06-04 07:04:00] [INFO ] Flatten gal took : 4 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/graph2578826493937525324.txt' '-o' '/tmp/graph2578826493937525324.bin' '-w' '/tmp/graph2578826493937525324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2578826493937525324.bin' '-l' '-1' '-v' '-w' '/tmp/graph2578826493937525324.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:04:00] [INFO ] Decomposing Gal with order
[2025-06-04 07:04:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:04:00] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:04:00] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:04:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-04 07:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7653136521156944718.gal : 1 ms
[2025-06-04 07:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2814588821966844537.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/CTLFireability7653136521156944718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2814588821966844537.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 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.11657e+11,5.45289,111096,946,30,144294,100,167,521943,32,460,0
Converting to forward existential form...Done !
original formula: EX(A(((!(EF((((i7.u22.p61==1)&&(i7.u24.p67==1))&&(i6.u27.p76==1)))) * (i6.u26.p72!=1)) * (A((((i1.u4.p11==1)&&(i1.u6.p17==1))&&(i2.u9.p26...493
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((E(E(TRUE U (((i5.u14.p38==1)&&(i5.u17.p48==1))&&(i5.u18.p50==1))) U ((((i2.u9.p26==1)||(((...1187
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t42, t57, t71, i1.t63, i1.u6.t1, i1.u6.t2, i2.t73, i2.t60, i2.u8.t3, i2.u8.t4, i...474
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:04:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-04 07:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:04:30] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:04:31] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:04:31] [INFO ] Deduced a trap composed of 15 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-04 07:04:31] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:04:32] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:04:32] [INFO ] Deduced a trap composed of 19 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-04 07:04:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2412 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:04:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:04:47] [INFO ] Deduced a trap along path composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28391 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30811ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30811ms
Finished structural reductions in LTL mode , in 1 iterations and 30940 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:05:01] [INFO ] Flatten gal took : 9 ms
[2025-06-04 07:05:01] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:05:01] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:05:01] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:05:01] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:05:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8633319850569095775.gal : 5 ms
[2025-06-04 07:05:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10501016385589646104.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/CTLFireability8633319850569095775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10501016385589646104.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.11657e+11,2.85505,95072,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: AG(EF((AG(((p33==0)||(p48==0))) * (EG(EX(((p3==1)&&(p24==1)))) + (((p13==1)&&(p23==1))&&(p25==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(E(TRUE U !(((p33==0)||(p48==0))))) * (EG(EX(((p3==1)&&(p24==1)))) + (((p13==1)...191
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-04 07:05:31] [INFO ] Flatten gal took : 8 ms
[2025-06-04 07:05:31] [INFO ] Applying decomposition
[2025-06-04 07:05:31] [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/graph15155591417935759306.txt' '-o' '/tmp/graph15155591417935759306.bin' '-w' '/tmp/graph15155591417935759306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15155591417935759306.bin' '-l' '-1' '-v' '-w' '/tmp/graph15155591417935759306.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:05:31] [INFO ] Decomposing Gal with order
[2025-06-04 07:05:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:05:31] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:05:31] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:05:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 2 ms.
[2025-06-04 07:05:31] [INFO ] Time to serialize gal into /tmp/CTLFireability513576175215105153.gal : 1 ms
[2025-06-04 07:05:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12179696007541104694.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/CTLFireability513576175215105153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12179696007541104694.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 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.11657e+11,14.3189,310180,1273,31,381178,139,188,2.19172e+06,32,609,0
Converting to forward existential form...Done !
original formula: AG(EF((AG(((i2.u12.p33==0)||(i2.u17.p48==0))) * (EG(EX(((i1.i0.u1.p3==1)&&(i1.i1.u9.p24==1)))) + (((i0.u5.p13==1)&&(i0.u8.p23==1))&&(i1.i...172
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(E(TRUE U !(((i2.u12.p33==0)||(i2.u17.p48==0))))) * (EG(EX(((i1.i0.u1.p3==1)&&(...244
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t42, t55, t74, i0.t60, i0.u8.t3, i0.u8.t4, i1.i1.t63, i1.i1.t72, i1.i1.u6.t1, i1...492
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:06:01] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-04 07:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:06:01] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:06:02] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:06:02] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:06:02] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:06:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:06:03] [INFO ] Deduced a trap composed of 19 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-04 07:06:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2432 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:06:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:06:18] [INFO ] Deduced a trap along path composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28259 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30697ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30697ms
Finished structural reductions in LTL mode , in 1 iterations and 30799 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:06:32] [INFO ] Flatten gal took : 4 ms
[2025-06-04 07:06:32] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:06:32] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:06:32] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:06:32] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:06:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13604662424267237870.gal : 0 ms
[2025-06-04 07:06:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6927436893844819464.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/CTLFireability13604662424267237870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6927436893844819464.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.11657e+11,2.91206,95824,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: A(((EX(((p12==1)&&(p45==1))) * (((p33==1)&&(p48==1)) + ((!(A(AX((p66==1)) U !((((p38==1)&&(p48==1))&&(p50==1))))) * (p32==1)) * (p34==1))...476
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(((!(EX(!(EG((((p61==1)&&(p67==1))&&(p77==1)))))) + !(E((p65==1) U (p46==1)))) + !(...970
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:07:02] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:07:02] [INFO ] Applying decomposition
[2025-06-04 07:07:02] [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/graph2148043605265948766.txt' '-o' '/tmp/graph2148043605265948766.bin' '-w' '/tmp/graph2148043605265948766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2148043605265948766.bin' '-l' '-1' '-v' '-w' '/tmp/graph2148043605265948766.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:07:02] [INFO ] Decomposing Gal with order
[2025-06-04 07:07:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:07:02] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:07:02] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:07:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-04 07:07:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1792769616711629792.gal : 1 ms
[2025-06-04 07:07:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9228081637483736015.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/CTLFireability1792769616711629792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9228081637483736015.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 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.11657e+11,9.57183,187636,936,30,243493,145,164,919121,32,656,0
Converting to forward existential form...Done !
original formula: A(((EX(((i2.u5.p12==1)&&(i4.u17.p45==1))) * (((i4.u12.p33==1)&&(i4.u17.p48==1)) + ((!(A(AX((i8.u24.p66==1)) U !((((i4.u14.p38==1)&&(i4.u1...706
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(((!(EX(!(EG((((i8.u22.p61==1)&&(i8.u24.p67==1))&&(i7.u27.p77==1)))))) + !(E((i8.u2...1340
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t40, t54, t72, i0.t63, i0.u6.t1, i0.u6.t2, i2.t73, i2.t60, i2.u8.t3, i2.u8.t4, i...474
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:07:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-04 07:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:07:32] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:07:33] [INFO ] Deduced a trap composed of 9 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-04 07:07:33] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:07:33] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:07:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:07:34] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:07:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2394 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:07:39] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:07:49] [INFO ] Deduced a trap along path composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28441 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30842ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30842ms
Finished structural reductions in LTL mode , in 1 iterations and 30960 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:08:03] [INFO ] Flatten gal took : 8 ms
[2025-06-04 07:08:03] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:08:03] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:08:03] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:08:03] [INFO ] Flatten gal took : 3 ms
[2025-06-04 07:08:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15152715519826313208.gal : 1 ms
[2025-06-04 07:08:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6188377754333753611.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/CTLFireability15152715519826313208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6188377754333753611.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.11657e+11,2.86438,96020,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: AF((((p3==1)&&(p24==1)) + (((AX((((p11==1)&&(p17==1))&&(p27==1))) * EX(E((p41==1) U ((p56==1)&&(p66==1))))) * (AX(FALSE) * EF(((p29==0)||...205
=> equivalent forward existential formula: [FwdG(Init,!((((p3==1)&&(p24==1)) + (((!(EX(!((((p11==1)&&(p17==1))&&(p27==1))))) * EX(E((p41==1) U ((p56==1)&&(...268
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:08:33] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:08:33] [INFO ] Applying decomposition
[2025-06-04 07:08:33] [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/graph6380725315861437674.txt' '-o' '/tmp/graph6380725315861437674.bin' '-w' '/tmp/graph6380725315861437674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6380725315861437674.bin' '-l' '-1' '-v' '-w' '/tmp/graph6380725315861437674.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:08:33] [INFO ] Decomposing Gal with order
[2025-06-04 07:08:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:08:33] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:08:33] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:08:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-04 07:08:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8544405836258573234.gal : 1 ms
[2025-06-04 07:08:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15942247157160620995.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/CTLFireability8544405836258573234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15942247157160620995.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,2.11657e+11,8.5796,191676,935,30,272934,146,166,941097,32,621,0
Converting to forward existential form...Done !
original formula: AF((((i0.u1.p3==1)&&(i1.u9.p24==1)) + (((AX((((i1.u4.p11==1)&&(i1.u6.p17==1))&&(i1.u9.p27==1))) * EX(E((i5.u15.p41==1) U ((i8.u20.p56==1)...291
=> equivalent forward existential formula: [FwdG(Init,!((((i0.u1.p3==1)&&(i1.u9.p24==1)) + (((!(EX(!((((i1.u4.p11==1)&&(i1.u6.p17==1))&&(i1.u9.p27==1))))) ...354
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t40, t54, t73, i1.t72, i1.t63, i1.u6.t1, i1.u6.t2, i1.u9.t5, i1.u9.t6, i2.t60, i...474
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:09:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:09:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-04 07:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:09:04] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:09:04] [INFO ] Deduced a trap composed of 9 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-04 07:09:04] [INFO ] Deduced a trap composed of 15 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-04 07:09:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:09:05] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:09:05] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:09:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2396 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:09:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:09:20] [INFO ] Deduced a trap along path composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28017 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30421ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30422ms
Finished structural reductions in LTL mode , in 1 iterations and 30534 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:09:34] [INFO ] Flatten gal took : 8 ms
[2025-06-04 07:09:34] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:09:34] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:09:34] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:09:34] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:09:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8558561894916093328.gal : 1 ms
[2025-06-04 07:09:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4604868827415678029.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/CTLFireability8558561894916093328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4604868827415678029.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,2.11657e+11,2.84604,96268,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: AF(EG(EX(AX(EG(((p58==1)&&(p73==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(!(EX(!(EG(((p58==1)&&(p73==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:10:04] [INFO ] Flatten gal took : 8 ms
[2025-06-04 07:10:04] [INFO ] Applying decomposition
[2025-06-04 07:10:04] [INFO ] Flatten gal took : 4 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/graph2235065576286254647.txt' '-o' '/tmp/graph2235065576286254647.bin' '-w' '/tmp/graph2235065576286254647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2235065576286254647.bin' '-l' '-1' '-v' '-w' '/tmp/graph2235065576286254647.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:10:04] [INFO ] Decomposing Gal with order
[2025-06-04 07:10:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:10:04] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:10:04] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:10:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-04 07:10:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17374666925354761604.gal : 1 ms
[2025-06-04 07:10:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7766341875061857746.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/CTLFireability17374666925354761604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7766341875061857746.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,2.11657e+11,8.18322,197152,1161,31,291158,144,168,1.02094e+06,32,626,0
Converting to forward existential form...Done !
original formula: AF(EG(EX(AX(EG(((i7.u21.p58==1)&&(i7.u26.p73==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(!(EX(!(EG(((i7.u21.p58==1)&&(i7.u26.p73==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t40, t55, t73, i0.t72, i0.t63, i0.u6.t1, i0.u6.t2, i0.u9.t5, i0.u9.t6, i2.t60, i...474
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:10:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-04 07:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:10:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:10:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:10:35] [INFO ] Deduced a trap composed of 15 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-04 07:10:35] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:10:35] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:10:36] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:10:36] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2428 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:10:41] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:10:51] [INFO ] Deduced a trap along path composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28240 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30674ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30675ms
Finished structural reductions in LTL mode , in 1 iterations and 30788 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:11:05] [INFO ] Flatten gal took : 8 ms
[2025-06-04 07:11:05] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:11:05] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:11:05] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:11:05] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:11:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16657053054103227546.gal : 0 ms
[2025-06-04 07:11:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6442510122716034682.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/CTLFireability16657053054103227546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6442510122716034682.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.11657e+11,2.75663,96496,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: AF(((E(E((p26==1) U (((p63==1)&&(p71==1))&&(p75==1))) U EX((((p36==1)&&(p42==1))&&(p52==1)))) + AF(E(((p8==1)&&(p22==1)) U ((p57==1)&&(p5...201
=> equivalent forward existential formula: [FwdG(Init,!(((E(E((p26==1) U (((p63==1)&&(p71==1))&&(p75==1))) U EX((((p36==1)&&(p42==1))&&(p52==1)))) + !(EG(!...252
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:11:35] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:11:35] [INFO ] Applying decomposition
[2025-06-04 07:11:35] [INFO ] Flatten gal took : 2 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/graph16128522181325917616.txt' '-o' '/tmp/graph16128522181325917616.bin' '-w' '/tmp/graph16128522181325917616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16128522181325917616.bin' '-l' '-1' '-v' '-w' '/tmp/graph16128522181325917616.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:11:35] [INFO ] Decomposing Gal with order
[2025-06-04 07:11:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:11:35] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:11:35] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:11:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 2 ms.
[2025-06-04 07:11:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15164296433093580606.gal : 1 ms
[2025-06-04 07:11:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4838953204425396759.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/CTLFireability15164296433093580606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4838953204425396759.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,2.11657e+11,7.28139,162660,1083,31,171815,98,186,1.15883e+06,32,440,0
Converting to forward existential form...Done !
original formula: AF(((E(E((i1.i1.u9.p26==1) U (((i5.u23.p63==1)&&(i5.u26.p71==1))&&(i6.u27.p75==1))) U EX((((i3.u13.p36==1)&&(i3.u15.p42==1))&&(i4.u18.p52...311
=> equivalent forward existential formula: [FwdG(Init,!(((E(E((i1.i1.u9.p26==1) U (((i5.u23.p63==1)&&(i5.u26.p71==1))&&(i6.u27.p75==1))) U EX((((i3.u13.p36...362
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t44, t55, t72, i0.t63, i0.u6.t1, i0.u6.t2, i1.i1.t60, i1.i1.t73, i1.i1.u8.t3, i1...492
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2025-06-04 07:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:12:05] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-04 07:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:12:05] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:12:06] [INFO ] Deduced a trap composed of 9 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-04 07:12:06] [INFO ] Deduced a trap composed of 15 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-04 07:12:06] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:12:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:12:07] [INFO ] Deduced a trap composed of 19 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-04 07:12:07] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2483 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:12:12] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:12:22] [INFO ] Deduced a trap along path composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28591 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31081ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 31082ms
Finished structural reductions in LTL mode , in 1 iterations and 31201 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:12:36] [INFO ] Flatten gal took : 7 ms
[2025-06-04 07:12:36] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:12:36] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:12:36] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:12:36] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:12:36] [INFO ] Time to serialize gal into /tmp/CTLFireability99926706397445715.gal : 0 ms
[2025-06-04 07:12:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9890059933132194522.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/CTLFireability99926706397445715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9890059933132194522.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 -...281
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.11657e+11,2.84386,95964,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: EG((AF(EG((p50!=1))) + (EX(A(((((p11==1)&&(p15==1))&&(p27==1))||(p41==1)) U !(((p53==1)&&(p74==1))))) * AG((p41==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG((p50!=1))))) + (EX(!((E(!(!(((p53==1)&&(p74==1)))) U (!(((((p11==1)&&(p15==1))&&(p27==1))|...273
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:13:06] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:13:06] [INFO ] Applying decomposition
[2025-06-04 07:13:06] [INFO ] Flatten gal took : 2 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/graph1117622385119419021.txt' '-o' '/tmp/graph1117622385119419021.bin' '-w' '/tmp/graph1117622385119419021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1117622385119419021.bin' '-l' '-1' '-v' '-w' '/tmp/graph1117622385119419021.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:13:06] [INFO ] Decomposing Gal with order
[2025-06-04 07:13:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:13:06] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:13:06] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:13:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 2 ms.
[2025-06-04 07:13:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2399638468464217355.gal : 1 ms
[2025-06-04 07:13:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12616332110047222619.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/CTLFireability2399638468464217355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12616332110047222619.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,2.11657e+11,8.33008,181660,1032,31,248082,143,196,819020,32,618,0
Converting to forward existential form...Done !
original formula: EG((AF(EG((i4.u18.p50!=1))) + (EX(A(((((i0.i1.u4.p11==1)&&(i1.u6.p15==1))&&(i0.i1.u9.p27==1))||(i4.u15.p41==1)) U !(((i6.u19.p53==1)&&(i7...196
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG((i4.u18.p50!=1))))) + (EX(!((E(!(!(((i6.u19.p53==1)&&(i7.u27.p74==1)))) U (!(((((i0.i1.u4....360
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t40, t52, t71, i0.t74, i0.i0.t60, i0.i0.u8.t3, i0.i0.u8.t4, i0.i1.u9.t5, i0.i1.u...489
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 77 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 74 transition count 72
Applied a total of 5 rules in 16 ms. Remains 74 /78 variables (removed 4) and now considering 72/75 (removed 3) transitions.
// Phase 1: matrix 72 rows 74 cols
[2025-06-04 07:13:36] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:13:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-04 07:13:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:13:37] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:13:37] [INFO ] Redundant transitions in 17 ms returned [64]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 71 rows 74 cols
[2025-06-04 07:13:37] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:13:37] [INFO ] Deduced a trap composed of 8 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-04 07:13:37] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:13:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/145 variables, 74/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:13:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1605 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/145 variables, 74/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 70/249 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:13:39] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 250 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2450 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4067ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 4067ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/78 places, 71/75 transitions.
Applied a total of 0 rules in 7 ms. Remains 74 /74 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4216 ms. Remains : 74/78 places, 71/75 transitions.
[2025-06-04 07:13:41] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:13:41] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:13:41] [INFO ] Input system was already deterministic with 71 transitions.
[2025-06-04 07:13:41] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:13:41] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:13:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5894846957599560251.gal : 0 ms
[2025-06-04 07:13:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15457096368796984236.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/CTLFireability5894846957599560251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15457096368796984236.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,7.85913e+10,1.45749,56120,2,3916,5,184078,6,0,370,382089,0
Converting to forward existential form...Done !
original formula: EG(((EF(!(A(((((p13==1)&&(p21==1))&&((p25==1)&&(p33==1)))&&(p47==1)) U AF((p46==1))))) * (p25==0)) * (((p61==0)||(p65==0))||(p76==0))))
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U !(!((E(!(!(EG(!((p46==1))))) U (!(((((p13==1)&&(p21==1))&&((p25==1)&&(p33==1)))&&(p47==1))...273
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t25, t32...370
Detected timeout of ITS tools.
[2025-06-04 07:14:11] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:14:11] [INFO ] Applying decomposition
[2025-06-04 07:14:11] [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/graph13709002346482227725.txt' '-o' '/tmp/graph13709002346482227725.bin' '-w' '/tmp/graph13709002346482227725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13709002346482227725.bin' '-l' '-1' '-v' '-w' '/tmp/graph13709002346482227725.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:14:11] [INFO ] Decomposing Gal with order
[2025-06-04 07:14:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:14:11] [INFO ] Removed a total of 43 redundant transitions.
[2025-06-04 07:14:11] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:14:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 1 ms.
[2025-06-04 07:14:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5198211296619757964.gal : 1 ms
[2025-06-04 07:14:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12622620186450884581.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/CTLFireability5198211296619757964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12622620186450884581.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,7.85913e+10,14.2569,326096,1361,30,390059,62,167,2.42194e+06,33,257,0
Converting to forward existential form...Done !
original formula: EG(((EF(!(A(((((i0.u5.p13==1)&&(i0.u8.p21==1))&&((i1.i1.u9.p25==1)&&(i2.u12.p33==1)))&&(i2.u17.p47==1)) U AF((i2.u17.p46==1))))) * (i1.i1...228
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U !(!((E(!(!(EG(!((i2.u17.p46==1))))) U (!(((((i0.u5.p13==1)&&(i0.u8.p21==1))&&((i1.i1.u9.p2...362
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t44, t62, t69, i0.t49, i0.u8.t3, i0.u8.t4, i1.i1.t50, i1.i1.t58, i1.i1.u6.t1, i1...509
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 77 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 74 transition count 72
Applied a total of 5 rules in 6 ms. Remains 74 /78 variables (removed 4) and now considering 72/75 (removed 3) transitions.
// Phase 1: matrix 72 rows 74 cols
[2025-06-04 07:14:41] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:14:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-04 07:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:14:41] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 07:14:41] [INFO ] Redundant transitions in 17 ms returned [64]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 71 rows 74 cols
[2025-06-04 07:14:41] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:14:41] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:14:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:14:41] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/145 variables, 74/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:14:42] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1607 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/145 variables, 74/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 70/249 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:14:43] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 250 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2359 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3976ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3976ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/78 places, 71/75 transitions.
Applied a total of 0 rules in 7 ms. Remains 74 /74 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4126 ms. Remains : 74/78 places, 71/75 transitions.
[2025-06-04 07:14:45] [INFO ] Flatten gal took : 4 ms
[2025-06-04 07:14:45] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:14:45] [INFO ] Input system was already deterministic with 71 transitions.
[2025-06-04 07:14:45] [INFO ] Flatten gal took : 1 ms
[2025-06-04 07:14:45] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:14:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6178225108725168776.gal : 0 ms
[2025-06-04 07:14:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17540019802400727.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/CTLFireability6178225108725168776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17540019802400727.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 -...281
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,7.85913e+10,1.38637,56124,2,3916,5,184078,6,0,370,382089,0
Converting to forward existential form...Done !
original formula: AF(AG((p66==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p66==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t25, t32...370
Detected timeout of ITS tools.
[2025-06-04 07:15:15] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:15:15] [INFO ] Applying decomposition
[2025-06-04 07:15:15] [INFO ] Flatten gal took : 2 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/graph6345886956370403128.txt' '-o' '/tmp/graph6345886956370403128.bin' '-w' '/tmp/graph6345886956370403128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6345886956370403128.bin' '-l' '-1' '-v' '-w' '/tmp/graph6345886956370403128.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:15:15] [INFO ] Decomposing Gal with order
[2025-06-04 07:15:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:15:15] [INFO ] Removed a total of 43 redundant transitions.
[2025-06-04 07:15:15] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:15:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 1 ms.
[2025-06-04 07:15:15] [INFO ] Time to serialize gal into /tmp/CTLFireability3953345210097619134.gal : 1 ms
[2025-06-04 07:15:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16434318224708446971.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/CTLFireability3953345210097619134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16434318224708446971.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,7.85913e+10,5.94946,151300,1076,29,207218,70,165,843126,33,322,0
Converting to forward existential form...Done !
original formula: AF(AG((i5.u23.p66==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((i5.u23.p66==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t32, t42, t61, i0.i1.t50, i0.i1.t58, i0.i1.u6.t1, i0.i1.u6.t2, i0.i1.u9.t5, i0.i...509
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 78 cols
[2025-06-04 07:15:45] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:15:45] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-04 07:15:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 07:15:45] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-04 07:15:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:15:46] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:15:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:15:46] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:15:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:15:47] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:15:47] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2472 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/153 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:15:52] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 07:16:02] [INFO ] Deduced a trap along path composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/153 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 266 constraints, problems are : Problem set: 0 solved, 74 unsolved in 28024 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30508ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 30509ms
Finished structural reductions in LTL mode , in 1 iterations and 30625 ms. Remains : 78/78 places, 75/75 transitions.
[2025-06-04 07:16:16] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:16:16] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:16:16] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:16:16] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:16:16] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:16:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3773373840481476406.gal : 0 ms
[2025-06-04 07:16:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8871245443255073858.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/CTLFireability3773373840481476406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8871245443255073858.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,2.11657e+11,2.87639,95592,2,7090,5,288417,6,0,389,657344,0
Converting to forward existential form...Done !
original formula: AF((EG((AX(((p58==0)||(p72==0))) + EG((p64==0)))) * ((p37==0)||(p70==0))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((!(EX(!(((p58==0)||(p72==0))))) + EG((p64==0)))) * ((p37==0)||(p70==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
Detected timeout of ITS tools.
[2025-06-04 07:16:46] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:16:46] [INFO ] Applying decomposition
[2025-06-04 07:16:46] [INFO ] Flatten gal took : 2 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/graph13772523484609749104.txt' '-o' '/tmp/graph13772523484609749104.bin' '-w' '/tmp/graph13772523484609749104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13772523484609749104.bin' '-l' '-1' '-v' '-w' '/tmp/graph13772523484609749104.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:16:46] [INFO ] Decomposing Gal with order
[2025-06-04 07:16:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:16:46] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:16:46] [INFO ] Flatten gal took : 4 ms
[2025-06-04 07:16:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 1 ms.
[2025-06-04 07:16:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8971250597951918266.gal : 1 ms
[2025-06-04 07:16:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11990578469014714041.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/CTLFireability8971250597951918266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11990578469014714041.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,2.11657e+11,17.1069,281424,1264,31,323457,221,186,1.81923e+06,32,1570,0
Converting to forward existential form...Done !
original formula: AF((EG((AX(((i7.u21.p58==0)||(i7.u26.p72==0))) + EG((i5.u24.p64==0)))) * ((i4.u14.p37==0)||(i7.u26.p70==0))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((!(EX(!(((i7.u21.p58==0)||(i7.u26.p72==0))))) + EG((i5.u24.p64==0)))) * ((i4.u14.p37==0)||(i7.u...178
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t40, t55, t74, i0.t60, i0.u8.t3, i0.u8.t4, i1.i0.t63, i1.i0.t72, i1.i0.u6.t1, i1...492
Detected timeout of ITS tools.
[2025-06-04 07:17:16] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:17:16] [INFO ] Flatten gal took : 2 ms
[2025-06-04 07:17:16] [INFO ] Applying decomposition
[2025-06-04 07:17:16] [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/graph249633871275518867.txt' '-o' '/tmp/graph249633871275518867.bin' '-w' '/tmp/graph249633871275518867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph249633871275518867.bin' '-l' '-1' '-v' '-w' '/tmp/graph249633871275518867.weights' '-q' '0' '-e' '0.001'
[2025-06-04 07:17:16] [INFO ] Decomposing Gal with order
[2025-06-04 07:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:17:16] [INFO ] Removed a total of 48 redundant transitions.
[2025-06-04 07:17:16] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 1 ms.
[2025-06-04 07:17:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4783909094788548171.gal : 1 ms
[2025-06-04 07:17:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14784287006522537148.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/CTLFireability4783909094788548171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14784287006522537148.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 16 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.11657e+11,14.1368,264012,1086,30,353623,220,186,1.23972e+06,32,1679,0
Converting to forward existential form...Done !
original formula: AF(((EX(((i1.u5.p12==0)||(i3.u17.p45==0))) * (i7.u27.p76==1)) * (((i2.u10.p29==1)&&(i2.u16.p44==1)) + (AG(((((i5.u22.p61==1)&&(i5.u24.p67...358
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((i1.u5.p12==0)||(i3.u17.p45==0))) * (i7.u27.p76==1)) * (((i2.u10.p29==1)&&(i2.u16.p44==1)) + ...421
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t14, t40, t53, t73, i0.i1.t63, i0.i1.t72, i0.i1.u6.t1, i0.i1.u6.t2, i0.i1.u9.t5, i0.i...492
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-04 07:24:49] [INFO ] Applying decomposition
[2025-06-04 07:24:49] [INFO ] Flatten gal took : 6 ms
[2025-06-04 07:24:49] [INFO ] Decomposing Gal with order
[2025-06-04 07:24:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 07:24:49] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-04 07:24:49] [INFO ] Flatten gal took : 5 ms
[2025-06-04 07:24:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 0 ms.
[2025-06-04 07:24:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10858156836499098814.gal : 0 ms
[2025-06-04 07:24:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6219054125546627118.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/CTLFireability10858156836499098814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6219054125546627118.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 16 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.11657e+11,0.871603,44468,1116,27,80422,141,173,160165,30,301,0
Converting to forward existential form...Done !
original formula: AF(((EX(((u7.p12==0)||(u20.p45==0))) * (u31.p76==1)) * (((u12.p29==1)&&(u19.p44==1)) + (AG(((((u26.p61==1)&&(u28.p67==1))&&((u31.p77==1)&...307
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((u7.p12==0)||(u20.p45==0))) * (u31.p76==1)) * (((u12.p29==1)&&(u19.p44==1)) + (!(E(TRUE U !((...370
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t39, t44, t45, t48, t52, t55, t61, t63, t67, t70, u8.t1, u8.t2, u10.t3, u10.t4, u11...405
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-04 07:26:33] [INFO ] Flatten gal took : 4 ms
[2025-06-04 07:26:33] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 07:26:33] [INFO ] Transformed 78 places.
[2025-06-04 07:26:33] [INFO ] Transformed 75 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-04 07:26:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11249966284894031206.gal : 1 ms
[2025-06-04 07:26:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7717979115675729843.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/CTLFireability11249966284894031206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7717979115675729843.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 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.11657e+11,6.42521,204176,2,6163,5,545607,6,0,389,1.60835e+06,0
Converting to forward existential form...Done !
original formula: AF(((EX(((p12==0)||(p45==0))) * (p76==1)) * (((p29==1)&&(p44==1)) + (AG(((((p61==1)&&(p67==1))&&((p77==1)&&(p54==1)))&&(p69==1))) * ((AF(...240
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((p12==0)||(p45==0))) * (p76==1)) * (((p29==1)&&(p44==1)) + (!(E(TRUE U !(((((p61==1)&&(p67==1...303
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...380
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="ShieldIIPs-PT-003A"
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 ShieldIIPs-PT-003A, 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 r198-tall-174894532400282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-003A.tgz
mv ShieldIIPs-PT-003A 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 ;