fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r212-tall-174901994000290
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ShieldRVt-PT-030A

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 TFFTTF?TTFFTFFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 82K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2023-15
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-00
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-01
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-02
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-03
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-04
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-05
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-06
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-07
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-08
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-09
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-10
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749110669281

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 08:04:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 08:04:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 08:04:30] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-06-05 08:04:30] [INFO ] Transformed 243 places.
[2025-06-05 08:04:30] [INFO ] Transformed 243 transitions.
[2025-06-05 08:04:30] [INFO ] Found NUPN structural information;
[2025-06-05 08:04:30] [INFO ] Parsed PT model containing 243 places and 243 transitions and 1026 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 145 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 14 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2025-06-05 08:04:30] [INFO ] Computed 121 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:04:31] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-06-05 08:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:04:31] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 14621 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17583 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32294ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 32312ms
Finished structural reductions in LTL mode , in 1 iterations and 32863 ms. Remains : 243/243 places, 242/242 transitions.
Support contains 145 out of 243 places after structural reductions.
[2025-06-05 08:05:03] [INFO ] Flatten gal took : 53 ms
[2025-06-05 08:05:03] [INFO ] Flatten gal took : 23 ms
[2025-06-05 08:05:03] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 143 out of 243 places (down from 145) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 77 to 74
RANDOM walk for 40000 steps (8 resets) in 1302 ms. (30 steps per ms) remains 38/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
[2025-06-05 08:05:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 44/123 variables, 61/140 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 44/184 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 120/243 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 120/364 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1021 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 44/123 variables, 61/140 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 44/184 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 120/243 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 120/364 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 38/645 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 645 constraints, problems are : Problem set: 0 solved, 38 unsolved in 3429 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4472ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 33 different solutions.
Parikh walk visited 17 properties in 3398 ms.
Support contains 49 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 242/242 transitions.
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 2 place count 242 transition count 241
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 242 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 42 place count 242 transition count 221
Applied a total of 42 rules in 54 ms. Remains 242 /243 variables (removed 1) and now considering 221/242 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 242/243 places, 221/242 transitions.
RANDOM walk for 40000 steps (8 resets) in 603 ms. (66 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 257294 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :18 out of 21
Probabilistic random walk after 257294 steps, saw 247061 distinct states, run finished after 3007 ms. (steps per millisecond=85 ) properties seen :18
// Phase 1: matrix 221 rows 242 cols
[2025-06-05 08:05:15] [INFO ] Computed 121 invariants in 4 ms
[2025-06-05 08:05:15] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 207/242 variables, 104/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 207/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 221/463 variables, 242/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/463 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 607 constraints, problems are : Problem set: 0 solved, 3 unsolved in 227 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 242/242 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 207/242 variables, 104/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 207/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 221/463 variables, 242/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/463 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 610 constraints, problems are : Problem set: 0 solved, 3 unsolved in 409 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 242/242 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 650ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1251 ms.
Support contains 17 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 221/221 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 242 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 242 transition count 215
Applied a total of 12 rules in 27 ms. Remains 242 /242 variables (removed 0) and now considering 215/221 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 242/242 places, 215/221 transitions.
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 256877 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 3
Probabilistic random walk after 256877 steps, saw 249056 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 215 rows 242 cols
[2025-06-05 08:05:21] [INFO ] Computed 121 invariants in 2 ms
[2025-06-05 08:05:21] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 207/242 variables, 104/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 207/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 215/457 variables, 242/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/457 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 607 constraints, problems are : Problem set: 0 solved, 3 unsolved in 306 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 242/242 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 207/242 variables, 104/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 207/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 215/457 variables, 242/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/457 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 610 constraints, problems are : Problem set: 0 solved, 3 unsolved in 433 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 242/242 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 746ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 1468 ms.
Support contains 13 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 215/215 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 214
Applied a total of 2 rules in 28 ms. Remains 242 /242 variables (removed 0) and now considering 214/215 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 242/242 places, 214/215 transitions.
RANDOM walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 312563 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 312563 steps, saw 302180 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
// Phase 1: matrix 214 rows 242 cols
[2025-06-05 08:05:26] [INFO ] Computed 121 invariants in 4 ms
[2025-06-05 08:05:26] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 14/27 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 215/242 variables, 108/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 215/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 214/456 variables, 242/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/456 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 607 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 242/242 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 14/27 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 215/242 variables, 108/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 215/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 214/456 variables, 242/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/456 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 609 constraints, problems are : Problem set: 0 solved, 2 unsolved in 287 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 242/242 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 882 ms.
Support contains 13 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-05 08:05:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:05:28] [INFO ] Implicit Places using invariants in 144 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 241/242 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 162 ms. Remains : 241/242 places, 214/214 transitions.
RANDOM walk for 40000 steps (8 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 261299 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 261299 steps, saw 252958 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 214 rows 241 cols
[2025-06-05 08:05:31] [INFO ] Computed 120 invariants in 4 ms
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 14/27 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 214/241 variables, 107/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 214/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 214/455 variables, 241/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/455 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 602 constraints, problems are : Problem set: 0 solved, 2 unsolved in 177 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 14/27 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 214/241 variables, 107/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 214/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 214/455 variables, 241/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/455 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 604 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 342 ms.
Support contains 9 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 241 transition count 213
Applied a total of 2 rules in 17 ms. Remains 241 /241 variables (removed 0) and now considering 213/214 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 241/241 places, 213/214 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 810306 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 1
Probabilistic random walk after 810306 steps, saw 773934 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
// Phase 1: matrix 213 rows 241 cols
[2025-06-05 08:05:35] [INFO ] Computed 120 invariants in 5 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/19 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/241 variables, 111/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 222/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 213/454 variables, 241/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/454 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 241/241 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 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/19 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/241 variables, 111/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 222/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 213/454 variables, 241/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/454 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 603 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 9 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 241 /241 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 241/241 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 241 /241 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2025-06-05 08:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:05:35] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-05 08:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:05:36] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 08:05:36] [INFO ] Redundant transitions in 7 ms returned []
Running 212 sub problems to find dead transitions.
[2025-06-05 08:05:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 120/360 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/454 variables, 241/602 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/454 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 602 constraints, problems are : Problem set: 0 solved, 212 unsolved in 11075 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 120/360 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/454 variables, 241/602 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 212/814 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/454 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 814 constraints, problems are : Problem set: 0 solved, 212 unsolved in 15660 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26774ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 26775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27137 ms. Remains : 241/241 places, 213/213 transitions.
[2025-06-05 08:06:02] [INFO ] Flatten gal took : 22 ms
[2025-06-05 08:06:03] [INFO ] Flatten gal took : 19 ms
[2025-06-05 08:06:03] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 242/242 transitions.
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 2 place count 242 transition count 241
Applied a total of 2 rules in 11 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2025-06-05 08:06:03] [INFO ] Computed 121 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:06:03] [INFO ] Implicit Places using invariants in 210 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 251 ms. Remains : 241/243 places, 241/242 transitions.
[2025-06-05 08:06:03] [INFO ] Flatten gal took : 18 ms
[2025-06-05 08:06:03] [INFO ] Flatten gal took : 16 ms
[2025-06-05 08:06:03] [INFO ] Input system was already deterministic with 241 transitions.
[2025-06-05 08:06:03] [INFO ] Flatten gal took : 14 ms
[2025-06-05 08:06:03] [INFO ] Flatten gal took : 13 ms
[2025-06-05 08:06:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6253883077010951226.gal : 6 ms
[2025-06-05 08:06:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10167861092940588308.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6253883077010951226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10167861092940588308.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32923e+36,0.130572,7532,2,601,5,13624,6,0,1207,17337,0


Converting to forward existential form...Done !
original formula: E((((p216==1)&&(p218==1))&&(p223==1)) U EF((EG(EF((p37==1))) + EG((((p73==1)||(((p91==1)&&(p100==1))&&(p106==1))) + AF((((p156==1)&&(p157...178
=> equivalent forward existential formula: ([FwdG(FwdU(FwdU(Init,(((p216==1)&&(p218==1))&&(p223==1))),TRUE),E(TRUE U (p37==1)))] != FALSE + [FwdG(FwdU(FwdU...312
Hit Full ! (commute/partial/dont) 230/19/11
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.539595,16492,1,0,8,63195,25,0,7284,26108,16
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2025-06-05 08:06:04] [INFO ] Computed 121 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:06:04] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-05 08:06:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:06:04] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:06: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/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13578 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17019 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30627ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 30629ms
Finished structural reductions in LTL mode , in 1 iterations and 30942 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:06:34] [INFO ] Flatten gal took : 13 ms
[2025-06-05 08:06:34] [INFO ] Flatten gal took : 13 ms
[2025-06-05 08:06:35] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:06:35] [INFO ] Flatten gal took : 12 ms
[2025-06-05 08:06:35] [INFO ] Flatten gal took : 11 ms
[2025-06-05 08:06:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6000898115101271844.gal : 4 ms
[2025-06-05 08:06:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10828467598400756054.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/CTLFireability6000898115101271844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10828467598400756054.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.65846e+36,0.120612,7608,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: (A(AF(((((p92==1)&&(p93==1))&&(p96==1))||(!((p46==1)&&(p49==1))))) U EG(!(EF((p25==1))))) * AX((EG((((p52==1)&&(p53==1))&&((p56==1)&&(p89...180
=> equivalent forward existential formula: (([((FwdU(Init,!(EG(!(E(TRUE U (p25==1)))))) * !(!(EG(!(((((p92==1)&&(p93==1))&&(p96==1))||(!((p46==1)&&(p49==1)...355
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.545983,17720,1,0,10,69665,31,2,7328,33066,15
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 242/242 transitions.
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 2 place count 242 transition count 241
Applied a total of 2 rules in 10 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2025-06-05 08:06:35] [INFO ] Computed 121 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:06:35] [INFO ] Implicit Places using invariants in 114 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 133 ms. Remains : 241/243 places, 241/242 transitions.
[2025-06-05 08:06:35] [INFO ] Flatten gal took : 10 ms
[2025-06-05 08:06:35] [INFO ] Flatten gal took : 11 ms
[2025-06-05 08:06:35] [INFO ] Input system was already deterministic with 241 transitions.
[2025-06-05 08:06:35] [INFO ] Flatten gal took : 11 ms
[2025-06-05 08:06:35] [INFO ] Flatten gal took : 10 ms
[2025-06-05 08:06:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12878032316974404655.gal : 2 ms
[2025-06-05 08:06:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8649718016139679028.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/CTLFireability12878032316974404655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8649718016139679028.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32923e+36,0.117672,7576,2,601,5,13624,6,0,1207,17337,0


Converting to forward existential form...Done !
original formula: E((AF((p121==1)) + !(EG(((EF((p131==1)) + ((((p184==1)&&(p186==1))&&((p191==1)&&(p224==1)))&&((p226==1)&&(p231==1)))) * EG((p197==1))))))...167
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((p121==1)))) + !(EG(((E(TRUE U (p131==1)) + ((((p184==1)&&(p186==1))&&((p191==1)&&(p224==1))...225
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-05 08:07:05] [INFO ] Flatten gal took : 10 ms
[2025-06-05 08:07:05] [INFO ] Applying decomposition
[2025-06-05 08:07:05] [INFO ] Flatten gal took : 9 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/graph8940575518949962624.txt' '-o' '/tmp/graph8940575518949962624.bin' '-w' '/tmp/graph8940575518949962624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8940575518949962624.bin' '-l' '-1' '-v' '-w' '/tmp/graph8940575518949962624.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:07:06] [INFO ] Decomposing Gal with order
[2025-06-05 08:07:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:07:06] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-05 08:07:06] [INFO ] Flatten gal took : 52 ms
[2025-06-05 08:07:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-05 08:07:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7719621187809695190.gal : 6 ms
[2025-06-05 08:07:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8081186486389535828.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/CTLFireability7719621187809695190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8081186486389535828.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,1.32923e+36,0.053803,6920,64,9,1897,82,273,2662,18,131,0


Converting to forward existential form...Done !
original formula: E((AF((i7.i1.u60.p121==1)) + !(EG(((EF((i9.i0.u65.p131==1)) + ((((i12.i1.u91.p184==1)&&(i12.i1.u92.p186==1))&&((i13.i0.u95.p191==1)&&(i15...270
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((i7.i1.u60.p121==1)))) + !(EG(((E(TRUE U (i9.i0.u65.p131==1)) + ((((i12.i1.u91.p184==1)&&(i1...328
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2025-06-05 08:07:36] [INFO ] Computed 121 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:07:36] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-05 08:07:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:07:36] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:07:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 14070 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17363 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31461ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 31461ms
Finished structural reductions in LTL mode , in 1 iterations and 31820 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:08:08] [INFO ] Flatten gal took : 21 ms
[2025-06-05 08:08:08] [INFO ] Flatten gal took : 19 ms
[2025-06-05 08:08:08] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:08:08] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:08:08] [INFO ] Flatten gal took : 15 ms
[2025-06-05 08:08:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11152201925021007240.gal : 2 ms
[2025-06-05 08:08:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15773033410959983005.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/CTLFireability11152201925021007240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15773033410959983005.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.65846e+36,0.127026,7600,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: EF(EG((AF((((p120==1)&&(p122==1))&&(p127==1))) + AX((((p8==1)&&(p10==1))&&(p15==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!((((p120==1)&&(p122==1))&&(p127==1))))) + !(EX(!((((p8==1)&&(p10==1))&&(p15==1)))))...167
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.471377,14768,1,0,10,56347,25,3,6856,17465,13
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-05 08:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:08:08] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-05 08:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:08:08] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 14143 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17625 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31810ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 31810ms
Finished structural reductions in LTL mode , in 1 iterations and 32114 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:08:40] [INFO ] Flatten gal took : 11 ms
[2025-06-05 08:08:40] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:08:40] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:08:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:08:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:08:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8669307548295847014.gal : 2 ms
[2025-06-05 08:08:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15292169813469256453.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/CTLFireability8669307548295847014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15292169813469256453.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.65846e+36,0.123062,7604,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: EX(EF(((AX((((p91==1)&&(p100==1))&&(p106==1))) + EG((p63==1))) + (A((p225==1) U (p87==1)) * AX((((p67==1)&&(p76==1))&&(p82==1)))))))
=> equivalent forward existential formula: (([(FwdU(EY(Init),TRUE) * !(EX(!((((p91==1)&&(p100==1))&&(p106==1))))))] != FALSE + [FwdG(FwdU(EY(Init),TRUE),(p...327
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 238/0/4
(forward)formula 0,1,0.537317,16564,1,0,9,63425,22,1,7270,26909,14
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 242/242 transitions.
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 2 place count 242 transition count 241
Applied a total of 2 rules in 17 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2025-06-05 08:08:41] [INFO ] Computed 121 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:08:41] [INFO ] Implicit Places using invariants in 111 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 135 ms. Remains : 241/243 places, 241/242 transitions.
[2025-06-05 08:08:41] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:08:41] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:08:41] [INFO ] Input system was already deterministic with 241 transitions.
[2025-06-05 08:08:41] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:08:41] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:08:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16479583375847357077.gal : 1 ms
[2025-06-05 08:08:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5410240825653079439.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/CTLFireability16479583375847357077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5410240825653079439.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32923e+36,0.1189,7576,2,601,5,13624,6,0,1207,17337,0


Converting to forward existential form...Done !
original formula: AG((A(!(A((((p128==1)&&(p130==1))&&(p135==1)) U (((p131==1)&&(p140==1))&&(p146==1)))) U (((p157!=1)||(((p232==1)&&(p234==1))&&(p239==1)))...234
=> equivalent forward existential formula: ([(((FwdU((FwdU(Init,TRUE) * !((((p171==1)&&(p180==1))&&(p186==1)))),!((((p157!=1)||(((p232==1)&&(p234==1))&&(p2...656
Hit Full ! (commute/partial/dont) 219/22/22
(forward)formula 0,0,0.36152,14232,1,0,10,51875,22,3,7069,17337,10
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2025-06-05 08:08:41] [INFO ] Computed 121 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:08:41] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-05 08:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:08:42] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:08:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13861 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17244 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31135ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 31136ms
Finished structural reductions in LTL mode , in 1 iterations and 31448 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:09:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:09:13] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:09:13] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:09:13] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:09:13] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:09:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16617675276450586250.gal : 1 ms
[2025-06-05 08:09:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11644802383909855534.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/CTLFireability16617675276450586250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11644802383909855534.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.65846e+36,0.121604,7536,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: !(E(EG(((!((p46==1)&&(p49==1)))&&(((((p102==1)&&(p105==1))&&(p199==1))||(p65==1))||(p123==1)))) U EF(EX(EF((((p67==1)&&(p76==1))&&(p82==1...162
=> equivalent forward existential formula: [(FwdU(EY(FwdU(FwdU(Init,EG(((!((p46==1)&&(p49==1)))&&(((((p102==1)&&(p105==1))&&(p199==1))||(p65==1))||(p123==1...218
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.529999,17008,1,0,9,67332,24,2,7094,29145,16
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 242/242 transitions.
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 2 place count 242 transition count 241
Applied a total of 2 rules in 7 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2025-06-05 08:09:13] [INFO ] Computed 121 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:09:14] [INFO ] Implicit Places using invariants in 119 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 132 ms. Remains : 241/243 places, 241/242 transitions.
[2025-06-05 08:09:14] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:09:14] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:09:14] [INFO ] Input system was already deterministic with 241 transitions.
[2025-06-05 08:09:14] [INFO ] Flatten gal took : 26 ms
[2025-06-05 08:09:14] [INFO ] Flatten gal took : 22 ms
[2025-06-05 08:09:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6607240520205510597.gal : 1 ms
[2025-06-05 08:09:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13626698903672478159.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6607240520205510597.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13626698903672478159.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 36917 steps (8 resets) in 315 ms. (116 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2025-06-05 08:09:14] [INFO ] Computed 121 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:09:14] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-05 08:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:09:14] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13969 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17044 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31038ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 31039ms
Finished structural reductions in LTL mode , in 1 iterations and 31308 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:09:45] [INFO ] Flatten gal took : 20 ms
[2025-06-05 08:09:45] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:09:45] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:09:45] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:09:45] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:09:45] [INFO ] Time to serialize gal into /tmp/CTLFireability99925689153539281.gal : 2 ms
[2025-06-05 08:09:45] [INFO ] Time to serialize properties into /tmp/CTLFireability18031222185545179229.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/CTLFireability99925689153539281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18031222185545179229.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.65846e+36,0.122909,7600,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: (EG(AX(EF((((p59==1)&&(p68==1))&&(p74==1))))) * E(!((AX((AG((((p84==1)&&(p85==1))&&(p88==1))) + (p101!=1))) + !((AG((((p108==1)&&(p109==1...232
=> equivalent forward existential formula: [(FwdU((Init * EG(!(EX(!(E(TRUE U (((p59==1)&&(p68==1))&&(p74==1)))))))),!((!(EX(!((!(E(TRUE U !((((p84==1)&&(p8...332
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.3805,14256,1,0,6,51715,14,0,6447,17465,5
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-05 08:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:09:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-05 08:09:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:09:46] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:09:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13793 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 16918 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30744ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 30745ms
Finished structural reductions in LTL mode , in 1 iterations and 31052 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:10:17] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:10:17] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:10:17] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:10:17] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:10:17] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:10:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18394649826366064606.gal : 2 ms
[2025-06-05 08:10:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4431537410001659762.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/CTLFireability18394649826366064606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4431537410001659762.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.65846e+36,0.123284,7608,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: AG((E((((p91==1) * EX((p21==1))) * ((((p1==1)&&(p7==1))||(p181==1))||((p38==1)&&(p41==1)))) U (EG(EX(((p240==1)&&(p242==1)))) * AF((p141!...280
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG((((((p185==0)||(p181==0))||((p24==0)||(p26==0)))||(((p31==0)||(p188==0))||((p189==0)||...343
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.550819,18104,1,0,29,74820,38,14,7112,45981,23
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-05 08:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:10:17] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-05 08:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:10:17] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13746 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17036 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30807ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 30808ms
Finished structural reductions in LTL mode , in 1 iterations and 31080 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:10:48] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:10:48] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:10:48] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:10:48] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:10:48] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:10:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10163620497201196943.gal : 1 ms
[2025-06-05 08:10:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8941815072039315004.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/CTLFireability10163620497201196943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8941815072039315004.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.65846e+36,0.121668,7600,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: EF(((E(!((((p25==1)||(p125==1)) + EG((p53==1)))) U ((p187==1) + A((((p84==1)&&(p85==1))&&(p88==1)) U (((p187==1)&&(p196==1))&&(p202==1)))...793
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * (E(!((((p25==1)||(p125==1)) + EG((p53==1)))) U ((p187==1) + !((E(!((((p187==1)&&(p19...1696
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 232/17/10
Hit Full ! (commute/partial/dont) 231/0/11
(forward)formula 0,1,0.684126,22960,1,0,62,94604,69,35,7645,76626,65
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-05 08:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:10:49] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-05 08:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:10:49] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13898 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 16959 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30884ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 30884ms
Finished structural reductions in LTL mode , in 1 iterations and 31178 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:11:20] [INFO ] Flatten gal took : 12 ms
[2025-06-05 08:11:20] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:11:20] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:11:20] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:11:20] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:11:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12149922011698243783.gal : 2 ms
[2025-06-05 08:11:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10278811365946811378.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/CTLFireability12149922011698243783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10278811365946811378.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.65846e+36,0.123953,7544,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: AG((((AG((p187==0)) + AG(((p187==1) + EG((p119==1))))) + (AX(EF((((p179==0)||(p188==0))||(p194==0)))) + E(!(E((p97!=1) U !((((p147==1)&&(...315
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !((EG((((p156==0)||(p157==0))||(p160==0))) * !(!((E(!((p105==1)) U (!((p127==1)) * !((...467
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.34809,13688,1,0,6,48649,14,0,6447,17465,5
FORMULA ShieldRVt-PT-030A-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-05 08:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:11:21] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-05 08:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:11:21] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13814 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17115 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30954ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 30955ms
Finished structural reductions in LTL mode , in 1 iterations and 31259 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:11:52] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:11:52] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:11:52] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:11:52] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:11:52] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:11:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11361977318601156040.gal : 1 ms
[2025-06-05 08:11:52] [INFO ] Time to serialize properties into /tmp/CTLFireability17497224175045333782.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/CTLFireability11361977318601156040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17497224175045333782.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.65846e+36,0.126664,7608,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: AX(((AF((p87==1)) + AF((p155==0))) + E(((p233==1)||(((p67==1)&&(p76==1))&&(p82==1))) U A((((p184==1)&&(p186==1))&&(p191==1)) U ((p86==1)&...169
=> equivalent forward existential formula: [FwdG(((EY(Init) * !(E(((p233==1)||(((p67==1)&&(p76==1))&&(p82==1))) U !((E(!(((p86==1)&&(p89==1))) U (!((((p184...295
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/0/7
Hit Full ! (commute/partial/dont) 227/0/15
(forward)formula 0,1,0.579194,17976,1,0,15,69381,47,5,7314,34401,17
FORMULA ShieldRVt-PT-030A-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-05 08:11:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:11:53] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-05 08:11:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:11:53] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:11:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13843 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 17100 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30969ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 30969ms
Finished structural reductions in LTL mode , in 1 iterations and 31263 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:12:24] [INFO ] Flatten gal took : 10 ms
[2025-06-05 08:12:24] [INFO ] Flatten gal took : 9 ms
[2025-06-05 08:12:24] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:12:24] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:12:24] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:12:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13897845437426684906.gal : 1 ms
[2025-06-05 08:12:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13674949798860424478.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/CTLFireability13897845437426684906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13674949798860424478.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.65846e+36,0.12507,7604,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: ((EX(((((((p163==0)||(p172==0))||(p178==0))&&((p166==0)||(p169==0)))||(p199==0)) + EX(AX((p33==1))))) * AG((p41==0))) * (EF(AX(((p46!=1)|...289
=> equivalent forward existential formula: (([(Init * !(EX(((((((p163==0)||(p172==0))||(p178==0))&&((p166==0)||(p169==0)))||(p199==0)) + EX(!(EX(!((p33==1)...451
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.450459,14004,1,0,7,50409,25,1,7092,17465,8
FORMULA ShieldRVt-PT-030A-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-05 08:12:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:12:24] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-05 08:12:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:12:25] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-05 08:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13759 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 16976 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30761ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 30762ms
Finished structural reductions in LTL mode , in 1 iterations and 31055 ms. Remains : 243/243 places, 242/242 transitions.
[2025-06-05 08:12:55] [INFO ] Flatten gal took : 10 ms
[2025-06-05 08:12:55] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:12:55] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:12:55] [INFO ] Flatten gal took : 7 ms
[2025-06-05 08:12:55] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:12:55] [INFO ] Time to serialize gal into /tmp/CTLFireability254063022243259924.gal : 1 ms
[2025-06-05 08:12:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11474646104058238219.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/CTLFireability254063022243259924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11474646104058238219.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.65846e+36,0.12712,7604,2,606,5,13727,6,0,1216,17465,0


Converting to forward existential form...Done !
original formula: EG((EX((((((p51==0)&&((((p156==1)&&(p157==1))&&(p160==1))||(((p204==1)&&(p205==1))&&(p208==1)))) + ((AG((p93==1)) * (p3==1)) * ((p12==1)&...208
=> equivalent forward existential formula: [FwdG(Init,(EX((((((p51==0)&&((((p156==1)&&(p157==1))&&(p160==1))||(((p204==1)&&(p205==1))&&(p208==1)))) + ((!(E...263
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.495607,14644,1,0,17,56441,27,4,7096,17465,15
FORMULA ShieldRVt-PT-030A-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 242/242 transitions.
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 2 place count 242 transition count 241
Applied a total of 2 rules in 13 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2025-06-05 08:12:56] [INFO ] Computed 121 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 08:12:56] [INFO ] Implicit Places using invariants in 109 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 128 ms. Remains : 241/243 places, 241/242 transitions.
[2025-06-05 08:12:56] [INFO ] Flatten gal took : 8 ms
[2025-06-05 08:12:56] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:12:56] [INFO ] Input system was already deterministic with 241 transitions.
[2025-06-05 08:12:56] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:12:56] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:12:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6031680117356984887.gal : 1 ms
[2025-06-05 08:12:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11675548043965262414.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/CTLFireability6031680117356984887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11675548043965262414.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32923e+36,0.126135,7572,2,601,5,13624,6,0,1207,17337,0


Converting to forward existential form...Done !
original formula: EG(EF((((p187==1)&&(p196==1))&&(p202==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p187==1)&&(p196==1))&&(p202==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.536147,16276,1,0,7,61994,18,1,7256,24133,11
FORMULA ShieldRVt-PT-030A-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 08:12:57] [INFO ] Flatten gal took : 12 ms
[2025-06-05 08:12:57] [INFO ] Flatten gal took : 6 ms
[2025-06-05 08:12:57] [INFO ] Applying decomposition
[2025-06-05 08:12:57] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10516169527738514273.txt' '-o' '/tmp/graph10516169527738514273.bin' '-w' '/tmp/graph10516169527738514273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10516169527738514273.bin' '-l' '-1' '-v' '-w' '/tmp/graph10516169527738514273.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:12:57] [INFO ] Decomposing Gal with order
[2025-06-05 08:12:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:12:57] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-05 08:12:57] [INFO ] Flatten gal took : 13 ms
[2025-06-05 08:12:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 08:12:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11486833681155007218.gal : 3 ms
[2025-06-05 08:12:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12033950621637412044.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/CTLFireability11486833681155007218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12033950621637412044.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.65846e+36,0.057165,6844,56,9,1680,78,236,2331,18,125,0


Converting to forward existential form...Done !
original formula: E((AF((i8.i0.u60.p121==1)) + !(EG(((EF((i9.i0.u65.p131==1)) + ((((i12.i0.u91.p184==1)&&(i12.i0.u92.p186==1))&&((i12.i1.u95.p191==1)&&(i14...276
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((i8.i0.u60.p121==1)))) + !(EG(((E(TRUE U (i9.i0.u65.p131==1)) + ((((i12.i0.u91.p184==1)&&(i1...334
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
[2025-06-05 08:35:45] [INFO ] Applying decomposition
[2025-06-05 08:35:45] [INFO ] Flatten gal took : 12 ms
[2025-06-05 08:35:45] [INFO ] Decomposing Gal with order
[2025-06-05 08:35:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:35:45] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-05 08:35:45] [INFO ] Flatten gal took : 13 ms
[2025-06-05 08:35:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 08:35:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14107966903574879527.gal : 2 ms
[2025-06-05 08:35:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3204985012635113739.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/CTLFireability14107966903574879527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3204985012635113739.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.65846e+36,0.145046,7904,248,5,6279,462,618,6894,12,343,0


Converting to forward existential form...Done !
original formula: E((AF((u61.p121==1)) + !(EG(((EF((u66.p131==1)) + ((((u92.p184==1)&&(u93.p186==1))&&((u96.p191==1)&&(u112.p224==1)))&&((u113.p226==1)&&(u...210
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((u61.p121==1)))) + !(EG(((E(TRUE U (u66.p131==1)) + ((((u92.p184==1)&&(u93.p186==1))&&((u96....268
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Fast SCC detection found an SCC at level 121
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Fast SCC detection found an SCC at level 121
Detected timeout of ITS tools.
[2025-06-05 08:58:34] [INFO ] Flatten gal took : 11 ms
[2025-06-05 08:58:34] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-05 08:58:34] [INFO ] Transformed 243 places.
[2025-06-05 08:58:34] [INFO ] Transformed 242 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-05 08:58:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3589914302543543191.gal : 2 ms
[2025-06-05 08:58:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8027305353373920993.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/CTLFireability3589914302543543191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8027305353373920993.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
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.65846e+36,0.148356,8756,2,1602,5,19667,6,0,1216,20485,0


Converting to forward existential form...Done !
original formula: E((AF((p121==1)) + !(EG(((EF((p131==1)) + ((((p184==1)&&(p186==1))&&((p191==1)&&(p224==1)))&&((p226==1)&&(p231==1)))) * EG((p197==1))))))...167
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((p121==1)))) + !(EG(((E(TRUE U (p131==1)) + ((((p184==1)&&(p186==1))&&((p191==1)&&(p224==1))...225
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection

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="ShieldRVt-PT-030A"
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 ShieldRVt-PT-030A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901994000290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030A.tgz
mv ShieldRVt-PT-030A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;