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

About the Execution of ITS-Tools for ShieldPPPt-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 298926.00 0.00 0.00 FFFTTTTTTFFTFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533400786.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 ShieldPPPt-PT-001B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533400786
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 19K 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 ShieldPPPt-PT-001B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2023-15
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-00
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-01
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-02
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-03
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-04
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-05
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-06
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-07
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-08
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-09
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-10
FORMULA_NAME ShieldPPPt-PT-001B-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749294854691

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 11:14:15] [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-07 11:14:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 11:14:16] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2025-06-07 11:14:16] [INFO ] Transformed 81 places.
[2025-06-07 11:14:16] [INFO ] Transformed 74 transitions.
[2025-06-07 11:14:16] [INFO ] Found NUPN structural information;
[2025-06-07 11:14:16] [INFO ] Parsed PT model containing 81 places and 74 transitions and 184 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 72 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 81 cols
[2025-06-07 11:14:16] [INFO ] Computed 12 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:14:16] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-06-07 11:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:14:16] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-07 11:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 10/103 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:18] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:18] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 74/155 variables, 81/187 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/155 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 188 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4214 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 74/155 variables, 81/188 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 73/261 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:21] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:21] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:21] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:21] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:22] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:22] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:22] [INFO ] Deduced a trap along path composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:26] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:27] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:27] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/155 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:29] [INFO ] Deduced a trap along path composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:31] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 16 (OVERLAPS) 0/155 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 275 constraints, problems are : Problem set: 0 solved, 73 unsolved in 19802 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 24044ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 24059ms
Finished structural reductions in LTL mode , in 1 iterations and 24404 ms. Remains : 81/81 places, 74/74 transitions.
Support contains 72 out of 81 places after structural reductions.
[2025-06-07 11:14:40] [INFO ] Flatten gal took : 23 ms
[2025-06-07 11:14:40] [INFO ] Flatten gal took : 9 ms
[2025-06-07 11:14:40] [INFO ] Input system was already deterministic with 74 transitions.
Reduction of identical properties reduced properties to check from 76 to 72
RANDOM walk for 40000 steps (10 resets) in 1563 ms. (25 steps per ms) remains 6/72 properties
BEST_FIRST walk for 40002 steps (16 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/6 properties
[2025-06-07 11:14:41] [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/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 2 (OVERLAPS) 63/81 variables, 12/30 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 63/93 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:41] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Problem AtomicPropp44 is UNSAT
After SMT solving in domain Real declared 81/155 variables, and 95 constraints, problems are : Problem set: 5 solved, 0 unsolved in 116 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/81 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-06-07 11:14:41] [INFO ] Flatten gal took : 7 ms
[2025-06-07 11:14:41] [INFO ] Flatten gal took : 6 ms
[2025-06-07 11:14:41] [INFO ] Input system was already deterministic with 74 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 80 transition count 52
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 59 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 58 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 57 transition count 49
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 47 place count 57 transition count 45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 55 place count 53 transition count 45
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 62 place count 46 transition count 38
Iterating global reduction 4 with 7 rules applied. Total rules applied 69 place count 46 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 69 place count 46 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 75 place count 43 transition count 35
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 103 place count 29 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 28 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 105 place count 27 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 105 place count 27 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 107 place count 26 transition count 19
Applied a total of 107 rules in 26 ms. Remains 26 /81 variables (removed 55) and now considering 19/74 (removed 55) transitions.
// Phase 1: matrix 19 rows 26 cols
[2025-06-07 11:14:41] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:14:41] [INFO ] Implicit Places using invariants in 25 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/81 places, 19/74 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 24 transition count 18
Applied a total of 2 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-07 11:14:41] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:14:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-07 11:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:14:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 24/81 places, 18/74 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 119 ms. Remains : 24/81 places, 18/74 transitions.
[2025-06-07 11:14:41] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:14:41] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:14:41] [INFO ] Input system was already deterministic with 18 transitions.
[2025-06-07 11:14:41] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:14:41] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13764007081314898432.gal : 1 ms
[2025-06-07 11:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9880075303192077844.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/CTLFireability13764007081314898432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9880075303192077844.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,4320,0.025199,4044,2,46,5,1924,6,0,117,2655,0


Converting to forward existential form...Done !
original formula: EG(AF(((p26==0)||(p28==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p26==0)||(p28==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.087348,6732,1,0,75,18211,23,75,542,25505,78
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 67
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 67
Applied a total of 14 rules in 7 ms. Remains 74 /81 variables (removed 7) and now considering 67/74 (removed 7) transitions.
// Phase 1: matrix 67 rows 74 cols
[2025-06-07 11:14:42] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:14:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 11:14:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:14:42] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2025-06-07 11:14: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/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:42] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/141 variables, 74/95 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:43] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:43] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 97 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2541 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/141 variables, 74/95 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 66/161 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:45] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:45] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 7/168 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:14:46] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/141 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 171 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5113 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7662ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 7662ms
Starting structural reductions in LTL mode, iteration 1 : 74/81 places, 67/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7761 ms. Remains : 74/81 places, 67/74 transitions.
[2025-06-07 11:14:49] [INFO ] Flatten gal took : 8 ms
[2025-06-07 11:14:49] [INFO ] Flatten gal took : 4 ms
[2025-06-07 11:14:49] [INFO ] Input system was already deterministic with 67 transitions.
[2025-06-07 11:14:49] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:14:49] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:14:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7524056576181069105.gal : 1 ms
[2025-06-07 11:14:49] [INFO ] Time to serialize properties into /tmp/CTLFireability4875830497073684155.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/CTLFireability7524056576181069105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4875830497073684155.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05004e+07,0.753648,32700,2,1927,5,95243,6,0,365,196962,0


Converting to forward existential form...Done !
original formula: A(AG(EX(A((p57==1) U (p71==1)))) U (!((((E((p39==1) U (p80==1)) + !(EF(((p26==1)&&(p28==1))))) * AF((p37==1))) * (!(AF((p77==1))) * !(AX(...315
=> equivalent forward existential formula: [((Init * !(EG(!((!((((E((p39==1) U (p80==1)) + !(E(TRUE U ((p26==1)&&(p28==1))))) * !(EG(!((p37==1))))) * (!(!(...1079
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t13, t14, t17, t21, t26, t30, t34, t35, t39, t40, t42, t43, t45, t46, t48, t49, t51,...264
Detected timeout of ITS tools.
[2025-06-07 11:15:19] [INFO ] Flatten gal took : 6 ms
[2025-06-07 11:15:19] [INFO ] Applying decomposition
[2025-06-07 11:15:19] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6780217877915429193.txt' '-o' '/tmp/graph6780217877915429193.bin' '-w' '/tmp/graph6780217877915429193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6780217877915429193.bin' '-l' '-1' '-v' '-w' '/tmp/graph6780217877915429193.weights' '-q' '0' '-e' '0.001'
[2025-06-07 11:15:19] [INFO ] Decomposing Gal with order
[2025-06-07 11:15:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 11:15:19] [INFO ] Removed a total of 7 redundant transitions.
[2025-06-07 11:15:20] [INFO ] Flatten gal took : 36 ms
[2025-06-07 11:15:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 11:15:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14005783617041300235.gal : 3 ms
[2025-06-07 11:15:20] [INFO ] Time to serialize properties into /tmp/CTLFireability3646038721210762703.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/CTLFireability14005783617041300235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3646038721210762703.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05004e+07,0.067028,6968,263,29,6045,179,216,9763,46,392,0


Converting to forward existential form...Done !
original formula: A(AG(EX(A((i6.u19.p57==1) U (i8.u23.p71==1)))) U (!((((E((i5.u14.p39==1) U (i8.u26.p80==1)) + !(EF(((i3.u7.p26==1)&&(i3.u7.p28==1))))) * ...447
=> equivalent forward existential formula: [((Init * !(EG(!((!((((E((i5.u14.p39==1) U (i8.u26.p80==1)) + !(E(TRUE U ((i3.u7.p26==1)&&(i3.u7.p28==1))))) * !...1461
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t49, i0.u0.t53, i1.u4.t52, i2.u5.t51, i3.u7.t48, i4.u9.t45, i5.t34, i5.u11.t35, i5....365
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,2.89946,142648,1,0,299992,315,1328,414574,256,784,347513
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 80 transition count 59
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 66 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 28 place count 66 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 61 transition count 54
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 47 place count 52 transition count 45
Iterating global reduction 2 with 9 rules applied. Total rules applied 56 place count 52 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 52 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 51 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 59 place count 51 transition count 41
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 63 place count 49 transition count 41
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 87 place count 37 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 37 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 36 transition count 28
Applied a total of 89 rules in 22 ms. Remains 36 /81 variables (removed 45) and now considering 28/74 (removed 46) transitions.
// Phase 1: matrix 28 rows 36 cols
[2025-06-07 11:15:22] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:22] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-07 11:15:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:23] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 11:15:23] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2025-06-07 11:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 3/36 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:23] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/64 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:23] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 50 constraints, problems are : Problem set: 0 solved, 25 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 3/36 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/64 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 75 constraints, problems are : Problem set: 0 solved, 25 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 893ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 894ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/81 places, 28/74 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 996 ms. Remains : 36/81 places, 28/74 transitions.
[2025-06-07 11:15:23] [INFO ] Flatten gal took : 4 ms
[2025-06-07 11:15:23] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:15:23] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-07 11:15:23] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:15:23] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:15:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9204967258830056697.gal : 1 ms
[2025-06-07 11:15:23] [INFO ] Time to serialize properties into /tmp/CTLFireability9327842494338869811.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/CTLFireability9204967258830056697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9327842494338869811.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,64556,0.028478,4912,2,227,5,4910,6,0,174,6904,0


Converting to forward existential form...Done !
original formula: (EF(((p18==1)&&(p45==1))) * E((p69!=1) U A(AF((p23!=1)) U A(!(((p25==1)&&(p45==1))) U (((p20==1)&&(p67==1))||(p49==1))))))
=> equivalent forward existential formula: [((FwdU((Init * E(TRUE U ((p18==1)&&(p45==1)))),(p69!=1)) * !(EG(!(!((E(!((((p20==1)&&(p67==1))||(p49==1))) U (!...631
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t5, t7, t19, t22, Intersection with reachable at each step enabled. (destroyed/rever...185
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 26/0/2
(forward)formula 0,1,2.51262,103100,1,0,1066,588918,107,597,1138,759132,1215
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 64
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 64
Applied a total of 20 rules in 11 ms. Remains 71 /81 variables (removed 10) and now considering 64/74 (removed 10) transitions.
// Phase 1: matrix 64 rows 71 cols
[2025-06-07 11:15:26] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 11:15:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:26] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-06-07 11:15:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:27] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:27] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/135 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 89 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1620 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/135 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 63/152 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:28] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:28] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:29] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:29] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:29] [INFO ] Deduced a trap along path composed of 6 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:29] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:30] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:33] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/135 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 13 (OVERLAPS) 0/135 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 165 constraints, problems are : Problem set: 0 solved, 63 unsolved in 9589 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 11219ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 11219ms
Starting structural reductions in LTL mode, iteration 1 : 71/81 places, 64/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11325 ms. Remains : 71/81 places, 64/74 transitions.
[2025-06-07 11:15:37] [INFO ] Flatten gal took : 7 ms
[2025-06-07 11:15:37] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:15:37] [INFO ] Input system was already deterministic with 64 transitions.
[2025-06-07 11:15:37] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:15:37] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:15:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13521911081230454272.gal : 1 ms
[2025-06-07 11:15:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16354688584698855148.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/CTLFireability13521911081230454272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16354688584698855148.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,8.33978e+06,0.254306,15264,2,1341,5,39381,6,0,350,74377,0


Converting to forward existential form...Done !
original formula: E(AG(!(EX(AG((p39==1))))) U (p42==1))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!(EX(!(E(TRUE U !((p39==1)))))))))) * (p42==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t32, t36, t37, t40, t42, t43, t45, t46, t48, t49, t50, Intersec...244
(forward)formula 0,1,0.683878,26784,1,0,142,86485,152,70,1998,139164,144
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 71 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 71 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 70 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 63
Applied a total of 22 rules in 11 ms. Remains 70 /81 variables (removed 11) and now considering 63/74 (removed 11) transitions.
// Phase 1: matrix 63 rows 70 cols
[2025-06-07 11:15:38] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 11:15:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:38] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-07 11:15:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:39] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:39] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:39] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:39] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 63/133 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 90 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1857 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/133 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:40] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:42] [INFO ] Deduced a trap along path composed of 6 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:42] [INFO ] Deduced a trap along path composed of 8 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:42] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 161 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5381 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 7242ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 7243ms
Starting structural reductions in LTL mode, iteration 1 : 70/81 places, 63/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7366 ms. Remains : 70/81 places, 63/74 transitions.
[2025-06-07 11:15:45] [INFO ] Flatten gal took : 10 ms
[2025-06-07 11:15:45] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:15:45] [INFO ] Input system was already deterministic with 63 transitions.
[2025-06-07 11:15:45] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:15:45] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:15:45] [INFO ] Time to serialize gal into /tmp/CTLFireability12132645164712682013.gal : 1 ms
[2025-06-07 11:15:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15428500033648609851.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/CTLFireability12132645164712682013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15428500033648609851.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,8.79055e+06,0.260572,15904,2,1486,5,41240,6,0,345,77330,0


Converting to forward existential form...Done !
original formula: EF((AF(((p17==0) * EF((p31==1)))) * (EX(E((p53==1) U (p61==1))) + EG((((p73==1)&&(p25==1))&&(p45==1))))))
=> equivalent forward existential formula: ([(FwdU(EY((FwdU(Init,TRUE) * !(EG(!(((p17==0) * E(TRUE U (p31==1)))))))),(p53==1)) * (p61==1))] != FALSE + [Fwd...263
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t11, t12, t16, t20, t21, t22, t26, t30, t35, t36, t39, t41, t42, t44, t45, t47, t48,...259
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 60/0/3
(forward)formula 0,1,8.11234,242960,1,0,1050,1.23473e+06,164,629,2118,2.08909e+06,992
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 67
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 67
Applied a total of 14 rules in 9 ms. Remains 74 /81 variables (removed 7) and now considering 67/74 (removed 7) transitions.
// Phase 1: matrix 67 rows 74 cols
[2025-06-07 11:15:54] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 11:15:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:54] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2025-06-07 11:15:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:54] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:54] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/141 variables, 74/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/141 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 93 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/141 variables, 74/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 66/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:57] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:57] [INFO ] Deduced a trap along path composed of 6 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:57] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:57] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:57] [INFO ] Deduced a trap along path composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:58] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:58] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:58] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:58] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:00] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:00] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/141 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 0/141 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 176 constraints, problems are : Problem set: 0 solved, 66 unsolved in 9969 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 11770ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 11770ms
Starting structural reductions in LTL mode, iteration 1 : 74/81 places, 67/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11868 ms. Remains : 74/81 places, 67/74 transitions.
[2025-06-07 11:16:05] [INFO ] Flatten gal took : 8 ms
[2025-06-07 11:16:05] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:16:05] [INFO ] Input system was already deterministic with 67 transitions.
[2025-06-07 11:16:05] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:16:05] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:16:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15021202170672711702.gal : 1 ms
[2025-06-07 11:16:05] [INFO ] Time to serialize properties into /tmp/CTLFireability15965694568257908047.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/CTLFireability15021202170672711702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15965694568257908047.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12041e+07,0.438238,22520,2,2838,5,60005,6,0,365,120552,0


Converting to forward existential form...Done !
original formula: (E((((p53==1) + E((E((p46==1) U ((p1==1)&&(p62==1))) + EG((p23==1))) U AF((p40==1)))) + EF((p47==1))) U (EX((p72==1)) * EX(A(((p13==1)&&(...293
=> equivalent forward existential formula: ([(Init * !(E((((p53==1) + E((E((p46==1) U ((p1==1)&&(p62==1))) + EG((p23==1))) U !(EG(!((p40==1)))))) + E(TRUE ...437
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t12, t16, t20, t22, t26, t30, t35, t39, t41, t43, t45, t46, t48, t49, t51, t52, t53,...254
Detected timeout of ITS tools.
[2025-06-07 11:16:36] [INFO ] Flatten gal took : 6 ms
[2025-06-07 11:16:36] [INFO ] Applying decomposition
[2025-06-07 11:16:36] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12065918010282341903.txt' '-o' '/tmp/graph12065918010282341903.bin' '-w' '/tmp/graph12065918010282341903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12065918010282341903.bin' '-l' '-1' '-v' '-w' '/tmp/graph12065918010282341903.weights' '-q' '0' '-e' '0.001'
[2025-06-07 11:16:36] [INFO ] Decomposing Gal with order
[2025-06-07 11:16:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 11:16:36] [INFO ] Removed a total of 10 redundant transitions.
[2025-06-07 11:16:36] [INFO ] Flatten gal took : 7 ms
[2025-06-07 11:16:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 11:16:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16142958563084620787.gal : 1 ms
[2025-06-07 11:16:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3428680660531933650.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/CTLFireability16142958563084620787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3428680660531933650.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12041e+07,0.092539,8128,326,22,8618,144,210,13668,36,322,0


Converting to forward existential form...Done !
original formula: (E((((i7.u18.p53==1) + E((E((i5.u15.p46==1) U ((i0.u0.p1==1)&&(i8.u22.p62==1))) + EG((i3.u7.p23==1))) U AF((i6.u12.p40==1)))) + EF((i5.u1...419
=> equivalent forward existential formula: ([(Init * !(E((((i7.u18.p53==1) + E((E((i5.u15.p46==1) U ((i0.u0.p1==1)&&(i8.u22.p62==1))) + EG((i3.u7.p23==1)))...575
Reverse transition relation is NOT exact ! Due to transitions t35, t43, t46, t49, i0.u0.t53, i1.u4.t52, i2.u5.t51, i3.u7.t48, i4.u9.t45, i6.t39, i6.u11.t41...334
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,3.41707,140992,1,0,281660,173,1139,373057,192,367,382736
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 65
Applied a total of 18 rules in 6 ms. Remains 72 /81 variables (removed 9) and now considering 65/74 (removed 9) transitions.
// Phase 1: matrix 65 rows 72 cols
[2025-06-07 11:16:39] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 11:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:39] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-07 11:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:39] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:40] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 65/137 variables, 72/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:41] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/137 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 96 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2629 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/137 variables, 72/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 64/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:42] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:42] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:43] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:43] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:43] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 170 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3780 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 6414ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6415ms
Starting structural reductions in LTL mode, iteration 1 : 72/81 places, 65/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6522 ms. Remains : 72/81 places, 65/74 transitions.
[2025-06-07 11:16:46] [INFO ] Flatten gal took : 4 ms
[2025-06-07 11:16:46] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:16:46] [INFO ] Input system was already deterministic with 65 transitions.
[2025-06-07 11:16:46] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:16:46] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:16:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7456843973716392863.gal : 1 ms
[2025-06-07 11:16:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9624080145823427367.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/CTLFireability7456843973716392863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9624080145823427367.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,8.4162e+06,0.361957,18908,2,1511,5,50868,6,0,355,100555,0


Converting to forward existential form...Done !
original formula: EX(((AF(((p66==1)&&(p47==1))) * EG(AX(EX((p54==0))))) * ((EG((p10==0)) + (p17==0)) + ((p56==1)||((p18==1)&&(p45==1))))))
=> equivalent forward existential formula: (([FwdG((EY(Init) * (!(EG(!(((p66==1)&&(p47==1))))) * EG(!(EX(!(EX((p54==0)))))))),(p10==0))] != FALSE + [((EY(I...373
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t20, t22, t26, t30, t31, t34, t38, t41, t43, t44, t46, t47, t49, t50, t51, t53,...254
Using saturation style SCC detection
(forward)formula 0,0,24.1517,667356,1,0,1171,3.52295e+06,169,575,2028,5.45263e+06,1233
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 63
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 61
Applied a total of 26 rules in 10 ms. Remains 68 /81 variables (removed 13) and now considering 61/74 (removed 13) transitions.
// Phase 1: matrix 61 rows 68 cols
[2025-06-07 11:17:10] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 11:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:10] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-07 11:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:10] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:10] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:10] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:10] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:11] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 86 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 60/146 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:12] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:12] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:12] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:12] [INFO ] Deduced a trap along path composed of 4 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:12] [INFO ] Deduced a trap along path composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 152 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2921 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 4375ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4375ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 61/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4477 ms. Remains : 68/81 places, 61/74 transitions.
[2025-06-07 11:17:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 11:17:14] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:17:14] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-07 11:17:14] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:17:14] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:17:14] [INFO ] Time to serialize gal into /tmp/CTLFireability11417733188075066842.gal : 0 ms
[2025-06-07 11:17:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13649235361973141589.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/CTLFireability11417733188075066842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13649235361973141589.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,6.77085e+06,0.183596,12424,2,1032,5,30101,6,0,335,54832,0


Converting to forward existential form...Done !
original formula: A(EG(EX(EF(EX((p63==1))))) U A((p6!=1) U (p29==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((p29==1)) U (!((p6!=1)) * !((p29==1)))) + EG(!((p29==1))))))))) * !(E(!(!((E(!((p29==1))...329
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t39, t40, t42, t43, t45, t46, t47, Intersection ...239
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,7.40131,231872,1,0,1054,1.26485e+06,164,630,1977,1.41454e+06,1211
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 80 transition count 55
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 62 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 61 transition count 53
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 39 place count 61 transition count 48
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 56 transition count 48
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 50 transition count 42
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 50 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 61 place count 50 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 48 transition count 40
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 93 place count 34 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 34 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 33 transition count 25
Applied a total of 95 rules in 13 ms. Remains 33 /81 variables (removed 48) and now considering 25/74 (removed 49) transitions.
// Phase 1: matrix 25 rows 33 cols
[2025-06-07 11:17:22] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 11:17:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 11:17:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 11:17:22] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-07 11:17:22] [INFO ] Invariant cache hit.
[2025-06-07 11:17:22] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 3/33 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 25/58 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/58 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 49 constraints, problems are : Problem set: 0 solved, 22 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 3/33 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 25/58 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 22/71 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 71 constraints, problems are : Problem set: 0 solved, 22 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 612ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/81 places, 25/74 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 707 ms. Remains : 33/81 places, 25/74 transitions.
[2025-06-07 11:17:23] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:17:23] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:17:23] [INFO ] Input system was already deterministic with 25 transitions.
[2025-06-07 11:17:23] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:23] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13173409450431597730.gal : 1 ms
[2025-06-07 11:17:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6208115234124617435.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/CTLFireability13173409450431597730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6208115234124617435.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,41472,0.055893,6556,2,197,5,12572,6,0,157,17989,0


Converting to forward existential form...Done !
original formula: (EG((p46!=1)) * A(AF((p60==1)) U ((p24==1) + EG(AG((p49==1))))))
=> equivalent forward existential formula: [(((Init * EG((p46!=1))) * !(EG(!(((p24==1) + EG(!(E(TRUE U !((p49==1)))))))))) * !(E(!(((p24==1) + EG(!(E(TRUE ...259
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.76024,66680,1,0,1126,394576,95,636,965,454491,1220
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 80 transition count 57
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 63 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 35 place count 63 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 47 place count 57 transition count 49
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 53 place count 51 transition count 43
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 51 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 59 place count 51 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 48 transition count 40
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 87 place count 37 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 37 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 36 transition count 28
Applied a total of 89 rules in 15 ms. Remains 36 /81 variables (removed 45) and now considering 28/74 (removed 46) transitions.
// Phase 1: matrix 28 rows 36 cols
[2025-06-07 11:17:24] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:24] [INFO ] Implicit Places using invariants in 34 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 35/81 places, 28/74 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 35 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 33 transition count 26
Applied a total of 4 rules in 3 ms. Remains 33 /35 variables (removed 2) and now considering 26/28 (removed 2) transitions.
// Phase 1: matrix 26 rows 33 cols
[2025-06-07 11:17:24] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:24] [INFO ] Implicit Places using invariants in 32 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 31/81 places, 26/74 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 30 transition count 25
Applied a total of 2 rules in 1 ms. Remains 30 /31 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 30 cols
[2025-06-07 11:17:24] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-07 11:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 30/81 places, 25/74 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 146 ms. Remains : 30/81 places, 25/74 transitions.
[2025-06-07 11:17:25] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:25] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:25] [INFO ] Input system was already deterministic with 25 transitions.
[2025-06-07 11:17:25] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:25] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12817685287008827985.gal : 0 ms
[2025-06-07 11:17:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13826680826287761167.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/CTLFireability12817685287008827985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13826680826287761167.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,5988,0.020891,4484,2,178,5,3451,6,0,147,4472,0


Converting to forward existential form...Done !
original formula: A(((EF((p68!=1)) * !((EG(((p49==1)||((p15==1)&&(p51==1)))) + (AG((p7==1)) * EF((p49==1)))))) * !(((p15==1)&&(p51==1)))) U (p72==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p72==1))))) * !(E(!((p72==1)) U (!(((E(TRUE U (p68!=1)) * !((EG(((p49==1)||((p15==1)&&(p51==1)...266
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t5, t12, t17, t19, t23, t24, Intersection with reachable at each step enabled. (...200
(forward)formula 0,0,0.277413,16692,1,0,441,73462,89,223,886,103805,498
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 80 transition count 52
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 59 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 58 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 57 transition count 49
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 47 place count 57 transition count 45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 55 place count 53 transition count 45
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 60 place count 48 transition count 40
Iterating global reduction 4 with 5 rules applied. Total rules applied 65 place count 48 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 65 place count 48 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 46 transition count 38
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 97 place count 32 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 31 transition count 23
Applied a total of 98 rules in 11 ms. Remains 31 /81 variables (removed 50) and now considering 23/74 (removed 51) transitions.
// Phase 1: matrix 23 rows 31 cols
[2025-06-07 11:17:25] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:25] [INFO ] Implicit Places using invariants in 31 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/81 places, 23/74 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 30 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 21
Applied a total of 4 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 21/23 (removed 2) transitions.
// Phase 1: matrix 21 rows 28 cols
[2025-06-07 11:17:25] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:25] [INFO ] Implicit Places using invariants in 29 ms returned [6, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 26/81 places, 21/74 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 19
Applied a total of 4 rules in 1 ms. Remains 24 /26 variables (removed 2) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 24 cols
[2025-06-07 11:17:25] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 11:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:25] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 24/81 places, 19/74 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 141 ms. Remains : 24/81 places, 19/74 transitions.
[2025-06-07 11:17:25] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:25] [INFO ] Flatten gal took : 0 ms
[2025-06-07 11:17:25] [INFO ] Input system was already deterministic with 19 transitions.
[2025-06-07 11:17:25] [INFO ] Flatten gal took : 0 ms
[2025-06-07 11:17:25] [INFO ] Flatten gal took : 0 ms
[2025-06-07 11:17:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12927621311215173697.gal : 0 ms
[2025-06-07 11:17:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11872313098170508319.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/CTLFireability12927621311215173697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11872313098170508319.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,2309,0.014892,4240,2,105,5,2431,6,0,117,3215,0


Converting to forward existential form...Done !
original formula: E(EF(AG((p59!=1))) U (p58==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(E(TRUE U !((p59!=1)))))) * (p58==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t8, t11, t18, Intersection with reachable at each step enabled. (destroyed/rever...185
(forward)formula 0,1,0.066372,6544,1,0,81,13835,62,36,717,16722,89
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 64
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 70 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 69 transition count 62
Applied a total of 24 rules in 7 ms. Remains 69 /81 variables (removed 12) and now considering 62/74 (removed 12) transitions.
// Phase 1: matrix 62 rows 69 cols
[2025-06-07 11:17:25] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-07 11:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:25] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-07 11:17: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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:26] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:26] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:26] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 61/148 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:27] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:27] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:27] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:28] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:28] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:28] [INFO ] Deduced a trap along path composed of 7 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:28] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:28] [INFO ] Deduced a trap along path composed of 4 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:28] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3207 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 4795ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4795ms
Starting structural reductions in LTL mode, iteration 1 : 69/81 places, 62/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4894 ms. Remains : 69/81 places, 62/74 transitions.
[2025-06-07 11:17:30] [INFO ] Flatten gal took : 4 ms
[2025-06-07 11:17:30] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:17:30] [INFO ] Input system was already deterministic with 62 transitions.
[2025-06-07 11:17:30] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:17:30] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8553126835707524476.gal : 1 ms
[2025-06-07 11:17:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12735975706859330615.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/CTLFireability8553126835707524476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12735975706859330615.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.7361e+06,0.193715,12820,2,1063,5,31680,6,0,340,57501,0


Converting to forward existential form...Done !
original formula: AX(!(A(!((E((p31==1) U (p38==1)) * EX((p43==1)))) U EX(((p42==1) * E((p75==1) U (p42==1)))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(EX(((p42==1) * E((p75==1) U (p42==1)))))))) * !(E(!(EX(((p42==1) * E((p75==1) U (p42==1))))...263
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t36, t38, t40, t41, t43, t44, t46, t47, t48, Intersection ...239
Using saturation style SCC detection
(forward)formula 0,1,23.6054,686528,1,0,1372,4.24417e+06,158,811,1932,5.09544e+06,1304
FORMULA ShieldPPPt-PT-001B-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 80 transition count 52
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 59 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 58 transition count 50
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 45 place count 58 transition count 47
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 51 place count 55 transition count 47
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 56 place count 50 transition count 42
Iterating global reduction 3 with 5 rules applied. Total rules applied 61 place count 50 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 61 place count 50 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 48 transition count 40
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 95 place count 33 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 32 transition count 24
Applied a total of 96 rules in 8 ms. Remains 32 /81 variables (removed 49) and now considering 24/74 (removed 50) transitions.
// Phase 1: matrix 24 rows 32 cols
[2025-06-07 11:17:54] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 11:17:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:54] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 11:17:54] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-07 11:17:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 24/56 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 44 constraints, problems are : Problem set: 0 solved, 22 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 24/56 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 22/66 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 66 constraints, problems are : Problem set: 0 solved, 22 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 544ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 545ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/81 places, 24/74 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 636 ms. Remains : 32/81 places, 24/74 transitions.
[2025-06-07 11:17:54] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:17:54] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:17:54] [INFO ] Input system was already deterministic with 24 transitions.
[2025-06-07 11:17:54] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:54] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:17:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4741021634619702718.gal : 0 ms
[2025-06-07 11:17:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17427819823880813264.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/CTLFireability4741021634619702718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17427819823880813264.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,54000,0.063845,6936,2,59,5,12882,6,0,155,21777,0


Converting to forward existential form...Done !
original formula: AG(!(E(AG(((p30==1) * EF((p37==1)))) U EG(EF((p43==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,TRUE),!(E(TRUE U !(((p30==1) * E(TRUE U (p37==1))))))),E(TRUE U (p43==1)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.078695,7192,1,0,14,12882,26,6,739,21777,20
FORMULA ShieldPPPt-PT-001B-CTLFireability-2023-12 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 : 81/81 places, 74/74 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 73 transition count 66
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 73 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 72 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 72 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 71 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 71 transition count 64
Applied a total of 20 rules in 6 ms. Remains 71 /81 variables (removed 10) and now considering 64/74 (removed 10) transitions.
// Phase 1: matrix 64 rows 71 cols
[2025-06-07 11:17:55] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:55] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 11:17:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:17:55] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-06-07 11:17:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:55] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/135 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:56] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 93 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1987 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/135 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 63/155 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:57] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:57] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:57] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:57] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:58] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:17:58] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/135 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 164 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4467 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 6459ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 6460ms
Starting structural reductions in LTL mode, iteration 1 : 71/81 places, 64/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6552 ms. Remains : 71/81 places, 64/74 transitions.
[2025-06-07 11:18:01] [INFO ] Flatten gal took : 6 ms
[2025-06-07 11:18:01] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:18:01] [INFO ] Input system was already deterministic with 64 transitions.
[2025-06-07 11:18:01] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:18:01] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:18:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1974523917827362130.gal : 0 ms
[2025-06-07 11:18:01] [INFO ] Time to serialize properties into /tmp/CTLFireability712605741720374829.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/CTLFireability1974523917827362130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability712605741720374829.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,8.71239e+06,0.434305,20408,2,1280,5,54900,6,0,350,111383,0


Converting to forward existential form...Done !
original formula: !(E(A(!((((p64==1)||(p76==1)) * AG(((p20==1)&&(p67==1))))) U ((AG((p59==1)) + AF(((p15==1)&&(p51==1)))) + ((p13==1)||(p68==1)))) U (!((((...299
=> equivalent forward existential formula: [(EY(((FwdU((FwdU(Init,!((E(!(((!(E(TRUE U !((p59==1)))) + !(EG(!(((p15==1)&&(p51==1)))))) + ((p13==1)||(p68==1)...575
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t16, t21, t22, t23, t26, t30, t34, t36, t37, t39, t40, t42, t43, t45, t46, t48, t49,...259
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-07 11:18:31] [INFO ] Flatten gal took : 8 ms
[2025-06-07 11:18:31] [INFO ] Applying decomposition
[2025-06-07 11:18:31] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10349769738300247882.txt' '-o' '/tmp/graph10349769738300247882.bin' '-w' '/tmp/graph10349769738300247882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10349769738300247882.bin' '-l' '-1' '-v' '-w' '/tmp/graph10349769738300247882.weights' '-q' '0' '-e' '0.001'
[2025-06-07 11:18:31] [INFO ] Decomposing Gal with order
[2025-06-07 11:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 11:18:31] [INFO ] Removed a total of 9 redundant transitions.
[2025-06-07 11:18:31] [INFO ] Flatten gal took : 5 ms
[2025-06-07 11:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 11:18:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3795757193614958758.gal : 2 ms
[2025-06-07 11:18:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10062282064127639567.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/CTLFireability3795757193614958758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10062282064127639567.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,8.71239e+06,0.051344,6192,228,23,4867,145,239,7264,45,315,0


Converting to forward existential form...Done !
original formula: !(E(A(!((((i7.u20.p64==1)||(i8.u24.p76==1)) * AG(((i2.u7.p20==1)&&(i7.u19.p67==1))))) U ((AG((i7.u21.p59==1)) + AF(((i2.u6.p15==1)&&(i6.u...434
=> equivalent forward existential formula: [(EY(((FwdU((FwdU(Init,!((E(!(((!(E(TRUE U !((i7.u21.p59==1)))) + !(EG(!(((i2.u6.p15==1)&&(i6.u16.p51==1)))))) +...782
Reverse transition relation is NOT exact ! Due to transitions t40, t43, t46, i0.u0.t50, i1.i1.u5.t49, i2.u6.t48, i3.u8.t45, i4.t42, i5.t37, i5.u12.t36, i5....353
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,3.34801,145200,1,0,308157,229,1382,384510,251,519,387011
FORMULA ShieldPPPt-PT-001B-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 80 transition count 57
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 63 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 61 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 39 place count 61 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 45 place count 58 transition count 50
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 50 place count 53 transition count 45
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 53 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 55 place count 53 transition count 42
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 61 place count 50 transition count 42
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 83 place count 39 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 38 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 37 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 85 place count 37 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 89 place count 35 transition count 28
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 90 place count 34 transition count 28
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 6 with 2 rules applied. Total rules applied 92 place count 33 transition count 27
Applied a total of 92 rules in 12 ms. Remains 33 /81 variables (removed 48) and now considering 27/74 (removed 47) transitions.
// Phase 1: matrix 27 rows 33 cols
[2025-06-07 11:18:35] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:18:35] [INFO ] Implicit Places using invariants in 32 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/81 places, 27/74 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 31 transition count 26
Applied a total of 2 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 26/27 (removed 1) transitions.
// Phase 1: matrix 26 rows 31 cols
[2025-06-07 11:18:35] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:18:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-07 11:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:18:35] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 31/81 places, 26/74 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 114 ms. Remains : 31/81 places, 26/74 transitions.
[2025-06-07 11:18:35] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:18:35] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:18:35] [INFO ] Input system was already deterministic with 26 transitions.
[2025-06-07 11:18:35] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:18:35] [INFO ] Flatten gal took : 1 ms
[2025-06-07 11:18:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1616161347082821968.gal : 0 ms
[2025-06-07 11:18:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2006083629729487700.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/CTLFireability1616161347082821968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2006083629729487700.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,12320,0.0148,4216,2,168,5,2042,6,0,151,2391,0


Converting to forward existential form...Done !
original formula: EF(((E(AG((p63==1)) U ((AF((p56==1)) + (p11==1)) + (p24==1))) * EF((p63==1))) * (A((p73==1) U (p53==1)) * AF(((p75==1)&&(p57==1))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (E(!(E(TRUE U !((p63==1)))) U ((!(EG(!((p56==1)))) + (p11==1)) + (p24==1))) * E(TRUE U (p6...278
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t13, t25, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
(forward)formula 0,0,0.490726,25020,1,0,800,133371,103,427,899,157609,1023
FORMULA ShieldPPPt-PT-001B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 63
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 61
Applied a total of 26 rules in 6 ms. Remains 68 /81 variables (removed 13) and now considering 61/74 (removed 13) transitions.
// Phase 1: matrix 61 rows 68 cols
[2025-06-07 11:18:35] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:18:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-07 11:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:18:35] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-07 11:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:36] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:36] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:36] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:36] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 86 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1510 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 60/146 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:37] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:37] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:38] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:38] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:18:38] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 152 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2797 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 4313ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4314ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 61/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4401 ms. Remains : 68/81 places, 61/74 transitions.
[2025-06-07 11:18:40] [INFO ] Flatten gal took : 5 ms
[2025-06-07 11:18:40] [INFO ] Flatten gal took : 3 ms
[2025-06-07 11:18:40] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-07 11:18:40] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:18:40] [INFO ] Flatten gal took : 2 ms
[2025-06-07 11:18:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8731508436451419722.gal : 0 ms
[2025-06-07 11:18:40] [INFO ] Time to serialize properties into /tmp/CTLFireability54174201603092225.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/CTLFireability8731508436451419722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability54174201603092225.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.77085e+06,0.189998,12368,2,1032,5,30101,6,0,335,54832,0


Converting to forward existential form...Done !
original formula: !(A(((AF(EG((p10==1))) + (p76==1)) * !(EX((EG((p31==1)) + AF(((p1==1)&&(p62==1))))))) U A(EG((p52==1)) U (!(AF(((p34==1)&&(p67==1)))) + (...195
=> equivalent forward existential formula: (([(((FwdU((FwdU(Init,!(!((E(!((!(!(EG(!(((p34==1)&&(p67==1)))))) + ((p54==1) * E(TRUE U ((p26==1)&&(p28==1)))))...1488
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t39, t40, t42, t43, t45, t46, t47, Intersection ...239
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-07 11:19:10] [INFO ] Flatten gal took : 5 ms
[2025-06-07 11:19:10] [INFO ] Applying decomposition
[2025-06-07 11:19:10] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1943133467706870596.txt' '-o' '/tmp/graph1943133467706870596.bin' '-w' '/tmp/graph1943133467706870596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1943133467706870596.bin' '-l' '-1' '-v' '-w' '/tmp/graph1943133467706870596.weights' '-q' '0' '-e' '0.001'
[2025-06-07 11:19:10] [INFO ] Decomposing Gal with order
[2025-06-07 11:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 11:19:10] [INFO ] Removed a total of 11 redundant transitions.
[2025-06-07 11:19:10] [INFO ] Flatten gal took : 4 ms
[2025-06-07 11:19:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 11:19:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1273188970525812080.gal : 1 ms
[2025-06-07 11:19:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7412633727436234861.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/CTLFireability1273188970525812080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7412633727436234861.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,6.77085e+06,0.031706,5208,193,28,2567,202,227,3478,49,438,0


Converting to forward existential form...Done !
original formula: !(A(((AF(EG((i1.i0.u4.p10==1))) + (i8.u24.p76==1)) * !(EX((EG((i4.u10.p31==1)) + AF(((i0.u0.p1==1)&&(i7.u20.p62==1))))))) U A(EG((i6.u15....271
=> equivalent forward existential formula: (([(((FwdU((FwdU(Init,!(!((E(!((!(!(EG(!(((i4.u10.p34==1)&&(i7.u20.p67==1)))))) + ((i6.u16.p54==1) * E(TRUE U ((...1984
Reverse transition relation is NOT exact ! Due to transitions t37, t40, t43, i0.u0.t47, i1.i0.u5.t46, i2.u6.t45, i3.u8.t42, i4.t39, i5.t34, i5.u12.t33, i6....305
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,3.29866,150360,1,0,297912,347,1339,401031,280,979,309976
FORMULA ShieldPPPt-PT-001B-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-07 11:19:13] [INFO ] Flatten gal took : 6 ms
[2025-06-07 11:19:13] [INFO ] Flatten gal took : 7 ms
Total runtime 297608 ms.

BK_STOP 1749295153617

--------------------
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="ShieldPPPt-PT-001B"
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 ShieldPPPt-PT-001B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533400786"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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