Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683762100922.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is ShieldRVt-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762100922
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 21:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 11 21:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 21:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 21:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-003B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717075590165

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 13:26:31] [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]
[2024-05-30 13:26:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:26:31] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-30 13:26:31] [INFO ] Transformed 153 places.
[2024-05-30 13:26:31] [INFO ] Transformed 153 transitions.
[2024-05-30 13:26:31] [INFO ] Found NUPN structural information;
[2024-05-30 13:26:31] [INFO ] Parsed PT model containing 153 places and 153 transitions and 360 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 94 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 146 transition count 146
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 146
Applied a total of 14 rules in 25 ms. Remains 146 /153 variables (removed 7) and now considering 146/153 (removed 7) transitions.
// Phase 1: matrix 146 rows 146 cols
[2024-05-30 13:26:31] [INFO ] Computed 13 invariants in 15 ms
[2024-05-30 13:26:31] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-30 13:26:31] [INFO ] Invariant cache hit.
[2024-05-30 13:26:31] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-30 13:26:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 8 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:34] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:35] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:35] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:26:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:26:35] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 146/292 variables, 146/181 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:37] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 0/292 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 183 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8895 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:41] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:26:42] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/292 variables, 146/186 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 145/331 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 4 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:26:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:26:44] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:26:44] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:26:44] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:26:44] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 15/346 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:26:45] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:26:45] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:26:45] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:26:45] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:26:45] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:26:46] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:49] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/292 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 13:26:53] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:26:53] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:26:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:26:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:26:54] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/292 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (OVERLAPS) 0/292 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 361 constraints, problems are : Problem set: 0 solved, 145 unsolved in 18234 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 57/57 constraints]
After SMT, in 27189ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 27214ms
Starting structural reductions in LTL mode, iteration 1 : 146/153 places, 146/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27625 ms. Remains : 146/153 places, 146/153 transitions.
Support contains 94 out of 146 places after structural reductions.
[2024-05-30 13:26:59] [INFO ] Flatten gal took : 29 ms
[2024-05-30 13:26:59] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:26:59] [INFO ] Input system was already deterministic with 146 transitions.
RANDOM walk for 40000 steps (11 resets) in 1282 ms. (31 steps per ms) remains 3/82 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/2 properties
[2024-05-30 13:27:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 30/292 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/13 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-30 13:27:00] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:27:00] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:27:00] [INFO ] Input system was already deterministic with 146 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 120 transition count 120
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 118 transition count 118
Applied a total of 56 rules in 20 ms. Remains 118 /146 variables (removed 28) and now considering 118/146 (removed 28) transitions.
// Phase 1: matrix 118 rows 118 cols
[2024-05-30 13:27:00] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 13:27:00] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 13:27:00] [INFO ] Invariant cache hit.
[2024-05-30 13:27:00] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-30 13:27:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:27:00] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2547 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:27:04] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:27:04] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:27:04] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:27:04] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 10/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:27:04] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:27:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:27:04] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:27:05] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:27:05] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:27:05] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:27:05] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:27:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:27:06] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 270 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5773 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 22/22 constraints]
After SMT, in 8335ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 8338ms
Starting structural reductions in LTL mode, iteration 1 : 118/146 places, 118/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8489 ms. Remains : 118/146 places, 118/146 transitions.
[2024-05-30 13:27:08] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:27:08] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:27:08] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-30 13:27:08] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:27:08] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:27:08] [INFO ] Time to serialize gal into /tmp/CTLFireability3724117802821423975.gal : 7 ms
[2024-05-30 13:27:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2390052050146126829.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3724117802821423975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2390052050146126829.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.5348e+10,0.192789,11888,2,934,5,27807,6,0,592,54532,0


Converting to forward existential form...Done !
original formula: AG(A((p32==1) U !(EX(((p99==1)||(p86==1))))))
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,TRUE),!(!(EX(((p99==1)||(p86==1)))))) * !((p32==1)))) * ((p99==1)||(p86==1)))] = FALSE * [...217
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...293
(forward)formula 0,0,0.480433,21324,1,0,281,82237,258,124,3232,90352,296
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 145 transition count 106
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 106 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 104 transition count 99
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 91 place count 100 transition count 99
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 91 place count 100 transition count 85
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 119 place count 86 transition count 85
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 133 place count 72 transition count 71
Iterating global reduction 4 with 14 rules applied. Total rules applied 147 place count 72 transition count 71
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 147 place count 72 transition count 65
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 159 place count 66 transition count 65
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 197 place count 47 transition count 46
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 198 place count 47 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 45 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 44 transition count 44
Applied a total of 201 rules in 34 ms. Remains 44 /146 variables (removed 102) and now considering 44/146 (removed 102) transitions.
// Phase 1: matrix 44 rows 44 cols
[2024-05-30 13:27:09] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 13:27:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 13:27:09] [INFO ] Invariant cache hit.
[2024-05-30 13:27:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-30 13:27:09] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-30 13:27:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 13:27:09] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-30 13:27:09] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 44/88 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 58 constraints, problems are : Problem set: 0 solved, 42 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 44/88 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 100 constraints, problems are : Problem set: 0 solved, 42 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints]
After SMT, in 906ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 907ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/146 places, 44/146 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1038 ms. Remains : 44/146 places, 44/146 transitions.
[2024-05-30 13:27:10] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:27:10] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:27:10] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 13:27:10] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:27:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:27:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1021802575037741697.gal : 1 ms
[2024-05-30 13:27:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4214449563868263393.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1021802575037741697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4214449563868263393.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.05014e+06,0.012542,3944,2,131,5,2150,6,0,222,2607,0


Converting to forward existential form...Done !
original formula: AF(((EG(((EF((p50==1)) * (p81==1)) * (p124==1))) * E(((p50!=1)||((p47==1)&&(p138==1))) U (p138==1))) * (AF((p92==1)) * AG(AF((p93==0)))))...156
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((E(TRUE U (p50==1)) * (p81==1)) * (p124==1))) * E(((p50!=1)||((p47==1)&&(p138==1))) U (p138==...231
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t9, t10, t12, t14, t19, t21, t23, t28, t30, t37, Intersection with reachable at each...217
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.59678,147008,1,0,578,666368,138,303,1487,1.33366e+06,675
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 122 transition count 122
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 122 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 121 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 120 transition count 120
Applied a total of 52 rules in 8 ms. Remains 120 /146 variables (removed 26) and now considering 120/146 (removed 26) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-05-30 13:27:13] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 13:27:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 13:27:13] [INFO ] Invariant cache hit.
[2024-05-30 13:27:14] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-30 13:27:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:27:15] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 138 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3125 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 119/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:27:17] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 11/268 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:27:19] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:27:19] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:27:19] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:27:19] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:27:19] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:27:19] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:27:19] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:27:19] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:27:20] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:27:21] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:27:21] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/240 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:27:23] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 280 constraints, problems are : Problem set: 0 solved, 119 unsolved in 9443 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 28/28 constraints]
After SMT, in 12584ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 12586ms
Starting structural reductions in LTL mode, iteration 1 : 120/146 places, 120/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12701 ms. Remains : 120/146 places, 120/146 transitions.
[2024-05-30 13:27:26] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:27:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:27:26] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 13:27:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:27:26] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:27:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14617834160982118208.gal : 2 ms
[2024-05-30 13:27:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6344547614790039360.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14617834160982118208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6344547614790039360.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13277e+11,0.235679,13548,2,1003,5,31539,6,0,602,65650,0


Converting to forward existential form...Done !
original formula: !(E(EX(EX(EG((p148==1)))) U (AX(AF((p38==1))) * !((AF((p75==1)) * !(((p45==1)||(p116==1))))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,EX(EX(EG((p148==1))))) * !(EX(!(!(EG(!((p38==1)))))))),!((p75==1)))] = FALSE * [((FwdU(Init,EX...242
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t28, t30, t31, t33, t37, t41, t46, t50, t55, t59, t62, t66, t72, ...307
Detected timeout of ITS tools.
[2024-05-30 13:27:56] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:27:56] [INFO ] Applying decomposition
[2024-05-30 13:27:56] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph17610427987222602402.txt' '-o' '/tmp/graph17610427987222602402.bin' '-w' '/tmp/graph17610427987222602402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17610427987222602402.bin' '-l' '-1' '-v' '-w' '/tmp/graph17610427987222602402.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:27:56] [INFO ] Decomposing Gal with order
[2024-05-30 13:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:27:56] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-30 13:27:56] [INFO ] Flatten gal took : 35 ms
[2024-05-30 13:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:27:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14880998587664662362.gal : 3 ms
[2024-05-30 13:27:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4316277371280286778.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14880998587664662362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4316277371280286778.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.13277e+11,0.069211,6592,298,23,6383,251,285,8081,40,491,0


Converting to forward existential form...Done !
original formula: !(E(EX(EX(EG((i12.u46.p148==1)))) U (AX(AF((i3.u12.p38==1))) * !((AF((i7.i1.u23.p75==1)) * !(((i4.u16.p45==1)||(i9.u34.p116==1))))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,EX(EX(EG((i12.u46.p148==1))))) * !(EX(!(!(EG(!((i3.u12.p38==1)))))))),!((i7.i1.u23.p75==1)))] ...296
Reverse transition relation is NOT exact ! Due to transitions t109, i0.i0.u1.t105, i1.t98, i1.u4.t102, i2.t95, i2.t91, i3.t82, i3.u12.t86, i4.t77, i4.u14.t...456
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,6.9805,258184,1,0,462391,347,1757,787341,212,1127,353984
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 123 transition count 123
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 123 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 122 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 122 transition count 122
Applied a total of 48 rules in 6 ms. Remains 122 /146 variables (removed 24) and now considering 122/146 (removed 24) transitions.
// Phase 1: matrix 122 rows 122 cols
[2024-05-30 13:28:03] [INFO ] Computed 13 invariants in 4 ms
[2024-05-30 13:28:03] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 13:28:03] [INFO ] Invariant cache hit.
[2024-05-30 13:28:04] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-30 13:28:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/244 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/244 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 139 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2726 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:28:07] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/244 variables, 122/140 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 121/261 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:28:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:28:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 3 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 13/274 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:28:09] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:28:09] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:28:09] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:28:09] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:28:09] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:28:10] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:28:10] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 7/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:28:11] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:28:11] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:28:11] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 284 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8202 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 28/28 constraints]
After SMT, in 10939ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 10940ms
Starting structural reductions in LTL mode, iteration 1 : 122/146 places, 122/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11060 ms. Remains : 122/146 places, 122/146 transitions.
[2024-05-30 13:28:15] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:28:15] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:28:15] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-30 13:28:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4094355219978996227.gal : 1 ms
[2024-05-30 13:28:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2552747638893131798.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4094355219978996227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2552747638893131798.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.33013e+11,0.237825,13860,2,1036,5,31533,6,0,612,68355,0


Converting to forward existential form...Done !
original formula: E((p136==1) U (!((((EF((p65==1)) + A((p91!=1) U ((p75==1)&&(p46==1)))) + (EG(!(A((p87==1) U (p148==1)))) + (p113==1))) + ((p50==1)||(p98=...224
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,(p136==1)) * !((((E(TRUE U (p65==1)) + !((E(!(((p75==1)&&(p46==1))) U (!((p91!=1)) * !(((p75=...713
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t30, t31, t37, t41, t47, t52, t56, t60, t63, t69, t74, t78, t80, ...304
Detected timeout of ITS tools.
[2024-05-30 13:28:45] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:28:45] [INFO ] Applying decomposition
[2024-05-30 13:28:45] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10096100597916344616.txt' '-o' '/tmp/graph10096100597916344616.bin' '-w' '/tmp/graph10096100597916344616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10096100597916344616.bin' '-l' '-1' '-v' '-w' '/tmp/graph10096100597916344616.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:28:45] [INFO ] Decomposing Gal with order
[2024-05-30 13:28:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:28:45] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-30 13:28:45] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:28:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:28:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14933290170444135858.gal : 3 ms
[2024-05-30 13:28:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9062371060364632073.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14933290170444135858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9062371060364632073.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.33013e+11,0.058185,6104,271,23,4755,225,293,6881,46,480,0


Converting to forward existential form...Done !
original formula: E((i10.u45.p136==1) U (!((((EF((i5.u21.p65==1)) + A((i7.u30.p91!=1) U ((i6.u24.p75==1)&&(i3.u17.p46==1)))) + (EG(!(A((i7.u28.p87==1) U (i...330
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,(i10.u45.p136==1)) * !((((E(TRUE U (i5.u21.p65==1)) + !((E(!(((i6.u24.p75==1)&&(i3.u17.p46==1...979
Reverse transition relation is NOT exact ! Due to transitions t111, t114, i0.t100, i0.u4.t104, i1.t97, i1.t93, i2.t84, i2.u11.t88, i3.t78, i3.u14.t74, i3.u...443
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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,0,17.0839,574704,1,0,967401,389,2051,1.94382e+06,261,1274,727619
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 121 transition count 121
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 119 transition count 119
Applied a total of 54 rules in 11 ms. Remains 119 /146 variables (removed 27) and now considering 119/146 (removed 27) transitions.
// Phase 1: matrix 119 rows 119 cols
[2024-05-30 13:29:02] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 13:29:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 13:29:02] [INFO ] Invariant cache hit.
[2024-05-30 13:29:02] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-30 13:29:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/238 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 135 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2548 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/238 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 118/253 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:29:05] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:29:05] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:29:05] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 11/274 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:29:08] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:29:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:29:08] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:29:08] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:29:08] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:29:08] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 6/286 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 0/238 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 287 constraints, problems are : Problem set: 0 solved, 118 unsolved in 8689 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 37/37 constraints]
After SMT, in 11247ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 11249ms
Starting structural reductions in LTL mode, iteration 1 : 119/146 places, 119/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11397 ms. Remains : 119/146 places, 119/146 transitions.
[2024-05-30 13:29:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:29:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:29:13] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-30 13:29:13] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:29:13] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:29:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16385769313361110657.gal : 1 ms
[2024-05-30 13:29:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11707435451697813024.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16385769313361110657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11707435451697813024.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.04361e+11,0.193474,12784,2,1022,5,29626,6,0,597,60231,0


Converting to forward existential form...Done !
original formula: EF((EX((((p93==1)||(p13==1))||(p125==1))) * ((p38==1) + EG(EF((p76==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EX((((p93==1)||(p13==1))||(p125==1)))) * (p38==1))] != FALSE + [FwdG((FwdU(Init,TRUE) * EX...222
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...293
(forward)formula 0,1,0.423916,18472,1,0,236,74452,255,123,3179,80801,246
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 128
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 128
Applied a total of 36 rules in 2 ms. Remains 128 /146 variables (removed 18) and now considering 128/146 (removed 18) transitions.
// Phase 1: matrix 128 rows 128 cols
[2024-05-30 13:29:14] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 13:29:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 13:29:14] [INFO ] Invariant cache hit.
[2024-05-30 13:29:14] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-30 13:29:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-30 13:29:14] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:29:14] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:29:15] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-30 13:29:15] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:29:15] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/256 variables, 128/146 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 146 constraints, problems are : Problem set: 0 solved, 127 unsolved in 2971 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/256 variables, 128/146 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 127/273 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:29:18] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:29:19] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:29:19] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:29:19] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:29:19] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:29:19] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 17/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-30 13:29:19] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:29:19] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:29:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:29:20] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-30 13:29:21] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:29:21] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:29:21] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:29:21] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:29:21] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 299 constraints, problems are : Problem set: 0 solved, 127 unsolved in 7647 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 31/31 constraints]
After SMT, in 10629ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 10631ms
Starting structural reductions in LTL mode, iteration 1 : 128/146 places, 128/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10744 ms. Remains : 128/146 places, 128/146 transitions.
[2024-05-30 13:29:24] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:29:24] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:29:24] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-30 13:29:24] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:29:24] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:29:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12389327678840081217.gal : 1 ms
[2024-05-30 13:29:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13897581936091310093.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12389327678840081217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13897581936091310093.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12341e+11,0.273808,15468,2,1465,5,36953,6,0,642,79637,0


Converting to forward existential form...Done !
original formula: E(AF(((A(((p140==1)||(p118==1)) U !((((p63==1)&&(p117==1))&&(p151==1)))) + A((A((p50==1) U (p42==1)) * A((p138==1) U (p26==1))) U !((((p9...303
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(EG(!(((!((E(!(!((((p63==1)&&(p117==1))&&(p151==1)))) U (!(((p140==1)||(p118==1))) * !(!((((p6...682
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t13, t19, t20, t24, t28, t29, t32, t37, t42, t46, t51, t55, t56, t57, t61, t65, t68, ...335
Detected timeout of ITS tools.
[2024-05-30 13:29:55] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:29:55] [INFO ] Applying decomposition
[2024-05-30 13:29:55] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph14448513990356321876.txt' '-o' '/tmp/graph14448513990356321876.bin' '-w' '/tmp/graph14448513990356321876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14448513990356321876.bin' '-l' '-1' '-v' '-w' '/tmp/graph14448513990356321876.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:29:55] [INFO ] Decomposing Gal with order
[2024-05-30 13:29:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:29:55] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-30 13:29:55] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:29:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:29:55] [INFO ] Time to serialize gal into /tmp/CTLFireability471309601011197237.gal : 2 ms
[2024-05-30 13:29:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17991851997239432574.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability471309601011197237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17991851997239432574.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12341e+11,0.051254,5924,405,25,4308,166,316,6427,43,359,0


Converting to forward existential form...Done !
original formula: E(AF(((A(((i12.u53.p140==1)||(i10.u44.p118==1)) U !((((i5.u23.p63==1)&&(i10.u44.p117==1))&&(i9.u55.p151==1)))) + A((A((i4.u18.p50==1) U (...442
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(EG(!(((!((E(!(!((((i5.u23.p63==1)&&(i10.u44.p117==1))&&(i9.u55.p151==1)))) U (!(((i12.u53.p14...937
Reverse transition relation is NOT exact ! Due to transitions t120, i0.i0.u1.t113, i1.t102, i1.t98, i2.t111, i2.u4.t110, i2.u6.t106, i3.t94, i3.u13.t93, i3...512
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,27.5097,987008,1,0,1.84709e+06,301,2329,3.11636e+06,221,860,1740365
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 145 transition count 101
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 101 transition count 98
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 99 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 98 transition count 97
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 95 place count 98 transition count 86
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 117 place count 87 transition count 86
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 134 place count 70 transition count 69
Iterating global reduction 4 with 17 rules applied. Total rules applied 151 place count 70 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 151 place count 70 transition count 62
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 165 place count 63 transition count 62
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 201 place count 45 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 44 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 43 transition count 43
Applied a total of 203 rules in 14 ms. Remains 43 /146 variables (removed 103) and now considering 43/146 (removed 103) transitions.
// Phase 1: matrix 43 rows 43 cols
[2024-05-30 13:30:22] [INFO ] Computed 12 invariants in 0 ms
[2024-05-30 13:30:22] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 13:30:22] [INFO ] Invariant cache hit.
[2024-05-30 13:30:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-30 13:30:22] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-30 13:30:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 43/86 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/86 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 55 constraints, problems are : Problem set: 0 solved, 41 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 43/86 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 41/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 96 constraints, problems are : Problem set: 0 solved, 41 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 903ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/146 places, 43/146 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 993 ms. Remains : 43/146 places, 43/146 transitions.
[2024-05-30 13:30:23] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:30:23] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:23] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-30 13:30:23] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:30:23] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:30:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6002990254739266092.gal : 1 ms
[2024-05-30 13:30:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3541627282933673113.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6002990254739266092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3541627282933673113.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.31717e+06,0.017774,3972,2,133,5,2674,6,0,217,3468,0


Converting to forward existential form...Done !
original formula: EF(AG(E(!(((((p2==1)&&(p39==1))||(p55==1))||(p122==1))) U (p88!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(!(((((p2==1)&&(p39==1))||(p55==1))||(p122==1))) U (p88!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t23, t26, t42, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,1,0.090877,7404,1,0,113,21505,112,53,1365,23901,123
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 122 transition count 122
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 122 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 121 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 120 transition count 120
Applied a total of 52 rules in 8 ms. Remains 120 /146 variables (removed 26) and now considering 120/146 (removed 26) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-05-30 13:30:23] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 13:30:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 13:30:23] [INFO ] Invariant cache hit.
[2024-05-30 13:30:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-30 13:30:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:30:24] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:30:24] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:30:24] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:30:26] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/240 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 137 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3268 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 119/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 15/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:30:33] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/240 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:30:34] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 284 constraints, problems are : Problem set: 0 solved, 119 unsolved in 9850 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 32/32 constraints]
After SMT, in 13133ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13135ms
Starting structural reductions in LTL mode, iteration 1 : 120/146 places, 120/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13249 ms. Remains : 120/146 places, 120/146 transitions.
[2024-05-30 13:30:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:37] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 13:30:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3196265308973209029.gal : 1 ms
[2024-05-30 13:30:37] [INFO ] Time to serialize properties into /tmp/CTLFireability13783423656193900847.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3196265308973209029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13783423656193900847.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17402e+11,0.19617,12256,2,953,5,28408,6,0,602,56254,0


Converting to forward existential form...Done !
original formula: AF((EX((((p120==1)&&(p38==1)) + AX((p141==1)))) + ((AX((p148==1)) * (p79==1)) * AG(A((p24==1) U (p100==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX((((p120==1)&&(p38==1)) + !(EX(!((p141==1)))))) + ((!(EX(!((p148==1)))) * (p79==1)) * !(E(TRUE U...244
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t55, t60, t62, t66, t72, t76, t81, ...298
Detected timeout of ITS tools.
[2024-05-30 13:31:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:31:07] [INFO ] Applying decomposition
[2024-05-30 13:31:07] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph18357530377186962958.txt' '-o' '/tmp/graph18357530377186962958.bin' '-w' '/tmp/graph18357530377186962958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18357530377186962958.bin' '-l' '-1' '-v' '-w' '/tmp/graph18357530377186962958.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:31:07] [INFO ] Decomposing Gal with order
[2024-05-30 13:31:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:31:07] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-30 13:31:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:31:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:31:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1660569128715788375.gal : 2 ms
[2024-05-30 13:31:07] [INFO ] Time to serialize properties into /tmp/CTLFireability152008765144993529.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1660569128715788375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability152008765144993529.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17402e+11,0.06081,6340,285,22,5883,247,255,7478,38,477,0


Converting to forward existential form...Done !
original formula: AF((EX((((i10.u37.p120==1)&&(i3.u12.p38==1)) + AX((i11.u41.p141==1)))) + ((AX((i12.u45.p148==1)) * (i5.u22.p79==1)) * AG(A((i2.u10.p24==1...183
=> equivalent forward existential formula: [FwdG(Init,!((EX((((i10.u37.p120==1)&&(i3.u12.p38==1)) + !(EX(!((i11.u41.p141==1)))))) + ((!(EX(!((i12.u45.p148=...319
Reverse transition relation is NOT exact ! Due to transitions t109, t112, i0.i0.u1.t105, i1.t98, i1.u5.t102, i2.t95, i2.u10.t94, i3.t81, i3.u12.t85, i4.t76...430
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,8.04522,273244,1,0,520001,372,1698,819172,211,1117,533664
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 126 transition count 126
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 126 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 125 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 125 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 124 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 124 transition count 124
Applied a total of 44 rules in 3 ms. Remains 124 /146 variables (removed 22) and now considering 124/146 (removed 22) transitions.
// Phase 1: matrix 124 rows 124 cols
[2024-05-30 13:31:15] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 13:31:15] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 13:31:15] [INFO ] Invariant cache hit.
[2024-05-30 13:31:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-30 13:31:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:31:15] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:31:16] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:31:16] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:31:16] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/248 variables, 124/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:31:17] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 142 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3342 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:31:19] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/248 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 123/266 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:31:19] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:31:19] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:31:19] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:31:20] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:31:21] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:31:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:31:22] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:31:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:31:23] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:31:23] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:31:23] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:31:23] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:31:24] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/248 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 291 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 31/31 constraints]
After SMT, in 12373ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 12374ms
Starting structural reductions in LTL mode, iteration 1 : 124/146 places, 124/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12478 ms. Remains : 124/146 places, 124/146 transitions.
[2024-05-30 13:31:27] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:31:27] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:31:27] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-30 13:31:27] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:31:27] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:31:27] [INFO ] Time to serialize gal into /tmp/CTLFireability3509296244791389975.gal : 0 ms
[2024-05-30 13:31:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2650771942337823801.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3509296244791389975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2650771942337823801.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.67293e+11,0.256919,15448,2,1173,5,36235,6,0,622,78983,0


Converting to forward existential form...Done !
original formula: E(((!(E((((p70==1)||(p20==1)) * EG((p128==1))) U (p45==1))) + AF(EG(AG((p128==1))))) + (EG(E((p142==1) U (p57==1))) * (A(AX((p56==1)) U (...196
=> equivalent forward existential formula: [(FwdU(Init,((!(E((((p70==1)||(p20==1)) * EG((p128==1))) U (p45==1))) + !(EG(!(EG(!(E(TRUE U !((p128==1)))))))))...311
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t22, t27, t30, t31, t37, t41, t43, t47, t51, t56, t60, t62, t64, t68, t74, ...320
Detected timeout of ITS tools.
[2024-05-30 13:31:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:31:57] [INFO ] Applying decomposition
[2024-05-30 13:31:57] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph791921964447620485.txt' '-o' '/tmp/graph791921964447620485.bin' '-w' '/tmp/graph791921964447620485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph791921964447620485.bin' '-l' '-1' '-v' '-w' '/tmp/graph791921964447620485.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:31:57] [INFO ] Decomposing Gal with order
[2024-05-30 13:31:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:31:57] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-30 13:31:57] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:31:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 13:31:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7430562610807107281.gal : 1 ms
[2024-05-30 13:31:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10349707002848356189.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7430562610807107281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10349707002848356189.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.67293e+11,0.062615,6392,324,23,5465,220,313,8510,40,417,0


Converting to forward existential form...Done !
original formula: E(((!(E((((i5.u23.p70==1)||(i2.u8.p20==1)) * EG((i9.u43.p128==1))) U (i1.u17.p45==1))) + AF(EG(AG((i9.u43.p128==1))))) + (EG(E((i12.u48.p...278
=> equivalent forward existential formula: [(FwdU(Init,((!(E((((i5.u23.p70==1)||(i2.u8.p20==1)) * EG((i9.u43.p128==1))) U (i1.u17.p45==1))) + !(EG(!(EG(!(E...407
Reverse transition relation is NOT exact ! Due to transitions t116, i0.i0.u1.t109, i1.t79, i1.u16.t74, i1.u17.t81, i2.t107, i2.u5.t102, i2.u5.t108, i2.u8.t...485
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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,10.8561,398272,1,0,746590,379,2151,1.24341e+06,233,1139,698341
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 122 transition count 122
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 122 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 121 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 120 transition count 120
Applied a total of 52 rules in 5 ms. Remains 120 /146 variables (removed 26) and now considering 120/146 (removed 26) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-05-30 13:32:08] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 13:32:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 13:32:08] [INFO ] Invariant cache hit.
[2024-05-30 13:32:08] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-30 13:32:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:09] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:32:09] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:32:09] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 136 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2605 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 119/255 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 12/267 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:32:14] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:32:14] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 7/274 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:15] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:32:15] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:16] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:16] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:17] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 280 constraints, problems are : Problem set: 0 solved, 119 unsolved in 9293 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 28/28 constraints]
After SMT, in 11907ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 11909ms
Starting structural reductions in LTL mode, iteration 1 : 120/146 places, 120/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12019 ms. Remains : 120/146 places, 120/146 transitions.
[2024-05-30 13:32:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:32:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:32:20] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 13:32:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:32:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:32:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10012941113388282395.gal : 1 ms
[2024-05-30 13:32:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12272078462232504309.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10012941113388282395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12272078462232504309.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.22508e+11,0.224019,13576,2,1045,5,31631,6,0,602,65398,0


Converting to forward existential form...Done !
original formula: EF((((p84==0) * EG(((p21==1)||(((p63==1)&&(p117==1))&&(p151==1))))) * (AX(E((p31==1) U (p136==1))) + !(A(((!((p139==1)&&(p151==1)))||((p1...190
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((p84==0) * EG(((p21==1)||(((p63==1)&&(p117==1))&&(p151==1)))))) * !(EX(!(E((p31==1) U (p1...486
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t26, t30, t31, t37, t41, t46, t50, t51, t56, t60, t63, t67, t73, ...303
(forward)formula 0,1,14.1931,489168,1,0,1056,2.44561e+06,268,468,3288,4.53783e+06,1165
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 126 transition count 126
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 126 transition count 126
Applied a total of 40 rules in 4 ms. Remains 126 /146 variables (removed 20) and now considering 126/146 (removed 20) transitions.
// Phase 1: matrix 126 rows 126 cols
[2024-05-30 13:32:35] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 13:32:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 13:32:35] [INFO ] Invariant cache hit.
[2024-05-30 13:32:35] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-30 13:32:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 13:32:35] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:32:35] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:32:35] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:32:36] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:32:36] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:32:36] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 13:32:36] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/252 variables, 126/146 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 146 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3268 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 13:32:39] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:32:39] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/252 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 125/273 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 13:32:39] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:32:39] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:32:39] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:32:39] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:32:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:39] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:32:40] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:32:41] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 13:32:41] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:32:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:32:41] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:41] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:41] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 13:32:42] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:32:43] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 13:32:43] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:32:43] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:43] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:32:43] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:32:44] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 305 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9215 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 41/41 constraints]
After SMT, in 12492ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 12494ms
Starting structural reductions in LTL mode, iteration 1 : 126/146 places, 126/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12607 ms. Remains : 126/146 places, 126/146 transitions.
[2024-05-30 13:32:47] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:32:47] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:32:47] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-30 13:32:47] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:32:47] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:32:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3813379400721331361.gal : 1 ms
[2024-05-30 13:32:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12411790711713432085.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3813379400721331361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12411790711713432085.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93506e+11,0.262902,15196,2,1261,5,35983,6,0,632,77589,0


Converting to forward existential form...Done !
original formula: EX(((EF(AX((p22==1))) + AG(((((p76==0)&&((p3==0)||(p36==0)))&&((p11==0)&&(p95==0)))&&(p89==0)))) + ((p0==1) * (((p145==1) + AG((p118==1))...187
=> equivalent forward existential formula: (([(FwdU(EY(Init),TRUE) * !(EX(!((p22==1)))))] != FALSE + [(EY(Init) * !(E(TRUE U !(((((p76==0)&&((p3==0)||(p36=...387
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t13, t17, t22, t26, t35, t41, t45, t47, t51, t56, t58, t61, t65, t68, t72, t78, t...321
(forward)formula 0,1,0.880801,34340,1,0,254,137256,270,129,3597,178309,262
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-10 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 : 146/146 places, 146/146 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 122 transition count 122
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 122 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 121 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 120 transition count 120
Applied a total of 52 rules in 3 ms. Remains 120 /146 variables (removed 26) and now considering 120/146 (removed 26) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-05-30 13:32:48] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 13:32:48] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 13:32:48] [INFO ] Invariant cache hit.
[2024-05-30 13:32:48] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-30 13:32:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:49] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:32:49] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:32:49] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:32:49] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:32:49] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:49] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/240 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 139 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2927 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:52] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:32:52] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/240 variables, 120/141 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 119/260 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:52] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:32:52] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:32:52] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 14/274 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:54] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:32:54] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:54] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:32:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:32:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:55] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:32:57] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/240 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:32:58] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:32:58] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:32:58] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/240 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 285 constraints, problems are : Problem set: 0 solved, 119 unsolved in 9709 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 33/33 constraints]
After SMT, in 12652ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 12654ms
Starting structural reductions in LTL mode, iteration 1 : 120/146 places, 120/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12783 ms. Remains : 120/146 places, 120/146 transitions.
[2024-05-30 13:33:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:33:01] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:33:01] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 13:33:01] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:33:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:33:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1493304295715038698.gal : 1 ms
[2024-05-30 13:33:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9192386704500240646.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1493304295715038698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9192386704500240646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.15954e+11,0.233268,13580,2,1148,5,31692,6,0,602,66025,0


Converting to forward existential form...Done !
original formula: EF((AF((E((p35==1) U (p37==1)) * (p82==0))) + EG((EX(AG((p2==1))) * EX(EG((p77==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!((E((p35==1) U (p37==1)) * (p82==0))))))] != FALSE + [FwdG(FwdU(Init,TRUE),(EX(!(E(TR...205
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t50, t52, t55, t59, t62, t66, t72, t76, ...313
Detected timeout of ITS tools.
[2024-05-30 13:33:31] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:33:31] [INFO ] Applying decomposition
[2024-05-30 13:33:31] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph13557110976963982919.txt' '-o' '/tmp/graph13557110976963982919.bin' '-w' '/tmp/graph13557110976963982919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13557110976963982919.bin' '-l' '-1' '-v' '-w' '/tmp/graph13557110976963982919.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:33:31] [INFO ] Decomposing Gal with order
[2024-05-30 13:33:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:33:31] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-30 13:33:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:33:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:33:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6276937133101482012.gal : 2 ms
[2024-05-30 13:33:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15528321582159619508.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6276937133101482012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15528321582159619508.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.15954e+11,0.066173,6620,336,23,6189,252,298,8313,40,482,0


Converting to forward existential form...Done !
original formula: EF((AF((E((i3.u12.p35==1) U (i3.u13.p37==1)) * (i7.u29.p82==0))) + EG((EX(AG((i0.i0.u0.p2==1))) * EX(EG((i5.i1.u26.p77==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!((E((i3.u12.p35==1) U (i3.u13.p37==1)) * (i7.u29.p82==0))))))] != FALSE + [FwdG(FwdU(...245
Reverse transition relation is NOT exact ! Due to transitions t109, t112, i0.i0.u1.t105, i1.t98, i1.u5.t102, i2.t95, i2.t91, i3.t87, i3.t81, i3.u12.t85, i3...454
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 129 transition count 129
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 129 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 128 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 128 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 127 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 127 transition count 127
Applied a total of 38 rules in 7 ms. Remains 127 /146 variables (removed 19) and now considering 127/146 (removed 19) transitions.
// Phase 1: matrix 127 rows 127 cols
[2024-05-30 13:34:01] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 13:34:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 13:34:01] [INFO ] Invariant cache hit.
[2024-05-30 13:34:01] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-30 13:34:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:02] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:34:02] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:34:02] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:34:02] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:34:02] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:34:02] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:34:02] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:03] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:03] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:03] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:34:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:34:03] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:34:04] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:34:04] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:04] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:34:04] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 127/254 variables, 127/156 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 156 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4764 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/254 variables, 127/156 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 126/282 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:34:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:34:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:34:08] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 12/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:10] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:34:10] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:34:11] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 298 constraints, problems are : Problem set: 0 solved, 126 unsolved in 8160 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 32/32 constraints]
After SMT, in 12934ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 12937ms
Starting structural reductions in LTL mode, iteration 1 : 127/146 places, 127/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13077 ms. Remains : 127/146 places, 127/146 transitions.
[2024-05-30 13:34:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:34:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:34:14] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-30 13:34:14] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:34:14] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:34:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17428246317539549622.gal : 1 ms
[2024-05-30 13:34:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13800777966295014839.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17428246317539549622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13800777966295014839.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.88194e+11,0.319664,17580,2,1480,5,43167,6,0,637,96820,0


Converting to forward existential form...Done !
original formula: E((((p147==1)&&(p45==1)) * (A(AF((p2!=1)) U !(((p103==1)||(p50==1)))) + EF(((!((p54==1)||(p72==1)))||(p65==1))))) U A((AF((!(((p78==1)&&(...459
=> equivalent forward existential formula: [((FwdU(Init,(((p147==1)&&(p45==1)) * (!((E(!(!(((p103==1)||(p50==1)))) U (!(!(EG(!((p2!=1))))) * !(!(((p103==1)...1037
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t13, t17, t20, t23, t27, t29, t31, t33, t34, t36, t41, t45, t46, t50, t54, t59, ...351
Detected timeout of ITS tools.
[2024-05-30 13:34:44] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:34:44] [INFO ] Applying decomposition
[2024-05-30 13:34:44] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph3832945619653853285.txt' '-o' '/tmp/graph3832945619653853285.bin' '-w' '/tmp/graph3832945619653853285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3832945619653853285.bin' '-l' '-1' '-v' '-w' '/tmp/graph3832945619653853285.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:34:44] [INFO ] Decomposing Gal with order
[2024-05-30 13:34:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:34:44] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-30 13:34:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:34:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 13:34:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4201231787335871831.gal : 1 ms
[2024-05-30 13:34:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13599795393678867000.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4201231787335871831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13599795393678867000.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.88194e+11,0.048198,5596,347,33,3999,296,312,5771,52,635,0


Converting to forward existential form...Done !
original formula: E((((i9.u45.p147==1)&&(i4.u14.p45==1)) * (A(AF((i0.i0.u0.p2!=1)) U !(((i8.u32.p103==1)||(i4.u15.p50==1)))) + EF(((!((i4.u16.p54==1)||(i5....696
=> equivalent forward existential formula: [((FwdU(Init,(((i9.u45.p147==1)&&(i4.u14.p45==1)) * (!((E(!(!(((i8.u32.p103==1)||(i4.u15.p50==1)))) U (!(!(EG(!(...1502
Reverse transition relation is NOT exact ! Due to transitions t20, t116, i0.i0.u1.t112, i1.t104, i1.u4.t109, i1.u5.t105, i1.u5.t111, i2.t101, i2.t97, i3.t8...572
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 120 transition count 120
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 118 transition count 118
Applied a total of 56 rules in 2 ms. Remains 118 /146 variables (removed 28) and now considering 118/146 (removed 28) transitions.
// Phase 1: matrix 118 rows 118 cols
[2024-05-30 13:35:14] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 13:35:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 13:35:14] [INFO ] Invariant cache hit.
[2024-05-30 13:35:14] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-30 13:35:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:35:15] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:35:15] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:35:15] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:35:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:35:19] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 10/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:35:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:35:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:35:19] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:35:19] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:35:19] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:35:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:35:20] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:35:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:35:20] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 270 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5761 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 22/22 constraints]
After SMT, in 8346ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 8347ms
Starting structural reductions in LTL mode, iteration 1 : 118/146 places, 118/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8451 ms. Remains : 118/146 places, 118/146 transitions.
[2024-05-30 13:35:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:35:23] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:35:23] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-30 13:35:23] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:35:23] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:35:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16076338707229526835.gal : 1 ms
[2024-05-30 13:35:23] [INFO ] Time to serialize properties into /tmp/CTLFireability9689569056174662067.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16076338707229526835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9689569056174662067.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9.5348e+10,0.200911,11988,2,934,5,27807,6,0,592,54532,0


Converting to forward existential form...Done !
original formula: AX(EG(EX((((p120==0)&&(p98==0))||((p125==0)&&(p87==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(EX((((p120==0)&&(p98==0))||((p125==0)&&(p87==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...293
Using saturation style SCC detection
(forward)formula 0,1,11.9412,401100,1,0,647,2.47513e+06,260,399,3389,2.66024e+06,759
FORMULA ShieldRVt-PT-003B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 145 transition count 106
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 106 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 88 place count 104 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 93 place count 99 transition count 98
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 93 place count 99 transition count 85
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 119 place count 86 transition count 85
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 135 place count 70 transition count 69
Iterating global reduction 4 with 16 rules applied. Total rules applied 151 place count 70 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 151 place count 70 transition count 62
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 165 place count 63 transition count 62
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 201 place count 45 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 43 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 42 transition count 42
Applied a total of 204 rules in 25 ms. Remains 42 /146 variables (removed 104) and now considering 42/146 (removed 104) transitions.
// Phase 1: matrix 42 rows 42 cols
[2024-05-30 13:35:35] [INFO ] Computed 12 invariants in 0 ms
[2024-05-30 13:35:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-30 13:35:35] [INFO ] Invariant cache hit.
[2024-05-30 13:35:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-30 13:35:35] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 13:35:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 54 constraints, problems are : Problem set: 0 solved, 40 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 40/94 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 94 constraints, problems are : Problem set: 0 solved, 40 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 878ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/146 places, 42/146 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 977 ms. Remains : 42/146 places, 42/146 transitions.
[2024-05-30 13:35:36] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:35:36] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:35:36] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-30 13:35:36] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:35:36] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:35:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1964354756309660355.gal : 1 ms
[2024-05-30 13:35:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12795183431555245068.ctl : 4 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1964354756309660355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12795183431555245068.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32972e+06,0.016151,3948,2,108,5,2396,6,0,212,3242,0


Converting to forward existential form...Done !
original formula: EF((((p70==1) * ((p58==1) + AF(AG((p16==0))))) * (E((p65==1) U (p47==1)) + AF((p58==0)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * ((p70==1) * ((p58==1) + !(EG(!(!(E(TRUE U !((p16==0)))))))))),(p65==1)) * (p47==1))] ...281
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t12, t14, t19, t24, t38, Intersection with reachable at each step enabled. (destroye...192
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 39/0/3
(forward)formula 0,1,0.778891,35644,1,0,173,162456,124,100,1368,230035,209
FORMULA ShieldRVt-PT-003B-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 146/146 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 122 transition count 122
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 122 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 121 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 120 transition count 120
Applied a total of 52 rules in 6 ms. Remains 120 /146 variables (removed 26) and now considering 120/146 (removed 26) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-05-30 13:35:37] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 13:35:37] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 13:35:37] [INFO ] Invariant cache hit.
[2024-05-30 13:35:37] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-30 13:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:35:37] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:35:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:35:38] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:35:39] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 137 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3148 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/240 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 119/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:35:41] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 9/265 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:35:42] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:35:42] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:35:42] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:35:42] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:35:42] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 5/270 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:35:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:35:43] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:35:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 13:35:45] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 274 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8100 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
After SMT, in 11257ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 11259ms
Starting structural reductions in LTL mode, iteration 1 : 120/146 places, 120/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11374 ms. Remains : 120/146 places, 120/146 transitions.
[2024-05-30 13:35:48] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:35:48] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:35:48] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 13:35:48] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:35:48] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:35:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15541358574313950089.gal : 1 ms
[2024-05-30 13:35:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16444776898039982905.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15541358574313950089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16444776898039982905.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.15101e+11,0.217635,13052,2,1005,5,30545,6,0,602,62934,0


Converting to forward existential form...Done !
original formula: EX(EG(((AG((p87==0)) * (p45==0)) * (p69==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),((!(E(TRUE U !((p87==0)))) * (p45==0)) * (p69==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t62, t67, t72, t77, t79, ...297
(forward)formula 0,0,2.9204,109168,1,0,331,569202,270,148,3362,662440,355
FORMULA ShieldRVt-PT-003B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 13:35:51] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:35:51] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:35:51] [INFO ] Applying decomposition
[2024-05-30 13:35:51] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph5124904038193893381.txt' '-o' '/tmp/graph5124904038193893381.bin' '-w' '/tmp/graph5124904038193893381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5124904038193893381.bin' '-l' '-1' '-v' '-w' '/tmp/graph5124904038193893381.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:35:51] [INFO ] Decomposing Gal with order
[2024-05-30 13:35:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:35:51] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-30 13:35:51] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:35:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 13:35:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16552219251806357782.gal : 2 ms
[2024-05-30 13:35:51] [INFO ] Time to serialize properties into /tmp/CTLFireability9391232496759224252.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16552219251806357782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9391232496759224252.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 2 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.46253e+11,0.151837,10296,588,26,13783,188,332,21632,40,437,0


Converting to forward existential form...Done !
original formula: EF((AF((E((i3.u17.p35==1) U (i3.u16.p37==1)) * (i7.u33.p82==0))) + EG((EX(AG((i0.i0.u0.p2==1))) * EX(EG((i5.u32.p77==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!((E((i3.u17.p35==1) U (i3.u16.p37==1)) * (i7.u33.p82==0))))))] != FALSE + [FwdG(FwdU(...242
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u1.t131, i1.i1.t118, i1.i1.t119, i1.i1.u11.t117, i1.i1.u12.t113, i2.t129, i2.t122, i2.u...716
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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,81.1497,1957244,1,0,2.87618e+06,342,2193,6.26965e+06,197,640,2459007
FORMULA ShieldRVt-PT-003B-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((((i12.u60.p147==1)&&(i4.u22.p45==1)) * (A(AF((i0.i0.u0.p2!=1)) U !(((i8.u42.p103==1)||(i4.u19.p50==1)))) + EF(((!((i4.u18.p54==1)||(i5...690
=> equivalent forward existential formula: [((FwdU(Init,(((i12.u60.p147==1)&&(i4.u22.p45==1)) * (!((E(!(!(((i8.u42.p103==1)||(i4.u19.p50==1)))) U (!(!(EG(!...1488
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 1,0,212.601,2578452,1,0,3.97207e+06,383,1099,8.03648e+06,108,704,257182
FORMULA ShieldRVt-PT-003B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 773058 ms.

BK_STOP 1717076364436

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-003B"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-003B, 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 r356-tall-171683762100922"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-003B.tgz
mv ShieldRVt-PT-003B 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;