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-171683762200953.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-005B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762200953
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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 May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 21:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 21:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 60K 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-005B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-005B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717076181134

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 13:36:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:36:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:36:22] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-30 13:36:22] [INFO ] Transformed 253 places.
[2024-05-30 13:36:22] [INFO ] Transformed 253 transitions.
[2024-05-30 13:36:22] [INFO ] Found NUPN structural information;
[2024-05-30 13:36:22] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 221 transition count 221
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 221 transition count 221
Applied a total of 64 rules in 41 ms. Remains 221 /253 variables (removed 32) and now considering 221/253 (removed 32) transitions.
// Phase 1: matrix 221 rows 221 cols
[2024-05-30 13:36:22] [INFO ] Computed 21 invariants in 15 ms
[2024-05-30 13:36:22] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-30 13:36:22] [INFO ] Invariant cache hit.
[2024-05-30 13:36:22] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-30 13:36:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:24] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 13 ms to minimize.
[2024-05-30 13:36:25] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-05-30 13:36:25] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:36:25] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:36:25] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-30 13:36:25] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:36:25] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:36:26] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:36:26] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:36:26] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:36:26] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:36:26] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 7 ms to minimize.
[2024-05-30 13:36:26] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:27] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:36:27] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:28] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:36:29] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:36:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 221/442 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 261 constraints, problems are : Problem set: 0 solved, 220 unsolved in 13225 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/442 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 220/482 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:39] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-30 13:36:39] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:36:39] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:36:39] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:36:41] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 3 ms to minimize.
[2024-05-30 13:36:41] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:36:41] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:36:41] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-30 13:36:41] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:36:41] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:43] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:36:43] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:36:43] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:36:43] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:36:43] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:36:44] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:36:44] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:36:44] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:36:44] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:36:44] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:36:45] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 11/513 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:46] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 3 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 10 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:36:49] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:36:49] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:36:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 13/526 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:36:52] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:36:52] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:36:52] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:36:52] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:36:53] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:36:53] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:36:53] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 12/538 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:36:57] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:36:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-30 13:37:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:37:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/442 variables, and 542 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 80/80 constraints]
After SMT, in 43309ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 43325ms
Starting structural reductions in LTL mode, iteration 1 : 221/253 places, 221/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43800 ms. Remains : 221/253 places, 221/253 transitions.
Support contains 74 out of 221 places after structural reductions.
[2024-05-30 13:37:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 13:37:06] [INFO ] Flatten gal took : 38 ms
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:37:06] [INFO ] Flatten gal took : 18 ms
[2024-05-30 13:37:06] [INFO ] Input system was already deterministic with 221 transitions.
Support contains 72 out of 221 places (down from 74) after GAL structural reductions.
RANDOM walk for 36724 steps (9 resets) in 1168 ms. (31 steps per ms) remains 0/51 properties
[2024-05-30 13:37:07] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:37:07] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:37:07] [INFO ] Input system was already deterministic with 221 transitions.
Computed a total of 67 stabilizing places and 67 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 220 transition count 154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 154 transition count 154
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 132 place count 154 transition count 125
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 190 place count 125 transition count 125
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 203 place count 112 transition count 112
Iterating global reduction 2 with 13 rules applied. Total rules applied 216 place count 112 transition count 112
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 216 place count 112 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 228 place count 106 transition count 106
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 310 place count 65 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 311 place count 65 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 64 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 61 transition count 61
Applied a total of 316 rules in 44 ms. Remains 61 /221 variables (removed 160) and now considering 61/221 (removed 160) transitions.
// Phase 1: matrix 61 rows 61 cols
[2024-05-30 13:37:07] [INFO ] Computed 20 invariants in 5 ms
[2024-05-30 13:37:07] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 13:37:07] [INFO ] Invariant cache hit.
[2024-05-30 13:37:07] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-30 13:37:07] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-30 13:37:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 13:37:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 61/122 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 82 constraints, problems are : Problem set: 0 solved, 59 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 61/122 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 59/141 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 141 constraints, problems are : Problem set: 0 solved, 59 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 1563ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1564ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/221 places, 61/221 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1732 ms. Remains : 61/221 places, 61/221 transitions.
[2024-05-30 13:37:08] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:37:08] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:37:08] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-30 13:37:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:37:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:37:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality14583209172006706022.gal : 1 ms
[2024-05-30 13:37:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7903036603369747225.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/CTLCardinality14583209172006706022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7903036603369747225.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,2.32453e+09,0.030259,4292,2,140,5,3669,6,0,307,4768,0


Converting to forward existential form...Done !
original formula: EF(EG((p154==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p154==0))] != FALSE
Hit Full ! (commute/partial/dont) 59/0/2
(forward)formula 0,1,0.044252,4544,1,0,8,5624,19,3,1541,4768,8
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 200 transition count 200
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 200 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 199 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 198 transition count 198
Applied a total of 46 rules in 21 ms. Remains 198 /221 variables (removed 23) and now considering 198/221 (removed 23) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:37:08] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:37:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 13:37:09] [INFO ] Invariant cache hit.
[2024-05-30 13:37:09] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:37:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:10] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:37:10] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:37:10] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:37:10] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:37:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:37:10] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:37:11] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 226 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6701 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/423 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:17] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:37:17] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 3 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:37:19] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:37:19] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:37:19] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:37:19] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:37:19] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:19] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:37:19] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:37:19] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 19/442 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 12/454 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:37:25] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:37:25] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:27] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:37:27] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:37:27] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:30] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:37:30] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:37:30] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:37:30] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:37:31] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 5/465 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:33] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:37:34] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:39] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-30 13:37:39] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/396 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:45] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:37:45] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 474 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 58/58 constraints]
After SMT, in 36746ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36749ms
Starting structural reductions in LTL mode, iteration 1 : 198/221 places, 198/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36935 ms. Remains : 198/221 places, 198/221 transitions.
[2024-05-30 13:37:45] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:37:45] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:37:45] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-30 13:37:45] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:37:45] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:37:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2890955297128063503.gal : 6 ms
[2024-05-30 13:37:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality18212206409084346961.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/CTLCardinality2890955297128063503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18212206409084346961.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.30961e+18,1.48162,51384,2,1853,5,137910,6,0,992,338644,0


Converting to forward existential form...Done !
original formula: AX(!(E((p160==0) U (p216!=0))))
=> equivalent forward existential formula: [(FwdU(EY(Init),(p160==0)) * (p216!=0))] = FALSE
Hit Full ! (commute/partial/dont) 196/0/2
(forward)formula 0,0,1.89717,51384,1,0,11,137910,15,1,1899,338644,5
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 201 transition count 201
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 201 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 200 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 200 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 199 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 199 transition count 199
Applied a total of 44 rules in 15 ms. Remains 199 /221 variables (removed 22) and now considering 199/221 (removed 22) transitions.
// Phase 1: matrix 199 rows 199 cols
[2024-05-30 13:37:47] [INFO ] Computed 21 invariants in 5 ms
[2024-05-30 13:37:47] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 13:37:47] [INFO ] Invariant cache hit.
[2024-05-30 13:37:48] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-30 13:37:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 2 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/398 variables, 199/228 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 228 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7442 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/398 variables, 199/228 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 198/426 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:37:57] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:37:57] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:37:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:37:57] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:37:57] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:37:57] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:58] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:58] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-30 13:37:58] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:37:58] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:37:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:37:58] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 19/465 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:03] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:38:04] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:38:05] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:07] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:09] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:38:09] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:38:09] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:12] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:15] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:38:15] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:38:16] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:38:16] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:19] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:22] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:38:22] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:38:24] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 481 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 63/63 constraints]
After SMT, in 37474ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 37477ms
Starting structural reductions in LTL mode, iteration 1 : 199/221 places, 199/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37677 ms. Remains : 199/221 places, 199/221 transitions.
[2024-05-30 13:38:25] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:38:25] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:38:25] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-30 13:38:25] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:38:25] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:38:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality3603644335409234663.gal : 2 ms
[2024-05-30 13:38:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality7019247265497423192.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/CTLCardinality3603644335409234663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7019247265497423192.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.29972e+18,1.57673,52520,2,2261,5,138813,6,0,997,348532,0


Converting to forward existential form...Done !
original formula: (AF(((AG(AX((p92==1))) + (p189==1)) * (p167==0))) * EX((AG(EX(((p80==0)&&(p142==1)))) + EF((p18==0)))))
=> equivalent forward existential formula: ([FwdG(Init,!(((!(E(TRUE U !(!(EX(!((p92==1))))))) + (p189==1)) * (p167==0))))] = FALSE * [(Init * !(EX((!(E(TRU...224
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, t63, t67, t69, ...421
(forward)formula 0,0,12.7737,350852,1,0,897,1.71664e+06,430,496,5718,2.37878e+06,828
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 220 transition count 154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 154 transition count 154
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 132 place count 154 transition count 125
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 190 place count 125 transition count 125
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 203 place count 112 transition count 112
Iterating global reduction 2 with 13 rules applied. Total rules applied 216 place count 112 transition count 112
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 216 place count 112 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 228 place count 106 transition count 106
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 310 place count 65 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 311 place count 65 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 64 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 61 transition count 61
Applied a total of 316 rules in 30 ms. Remains 61 /221 variables (removed 160) and now considering 61/221 (removed 160) transitions.
// Phase 1: matrix 61 rows 61 cols
[2024-05-30 13:38:38] [INFO ] Computed 20 invariants in 0 ms
[2024-05-30 13:38:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 13:38:38] [INFO ] Invariant cache hit.
[2024-05-30 13:38:38] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-30 13:38:38] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-30 13:38:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 61/122 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 82 constraints, problems are : Problem set: 0 solved, 59 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 61/122 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 59/141 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 141 constraints, problems are : Problem set: 0 solved, 59 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 1418ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1418ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/221 places, 61/221 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1542 ms. Remains : 61/221 places, 61/221 transitions.
[2024-05-30 13:38:40] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:38:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:38:40] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-30 13:38:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:38:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:38:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality11682216609680491735.gal : 1 ms
[2024-05-30 13:38:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality14190516918449081393.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/CTLCardinality11682216609680491735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14190516918449081393.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.32488e+09,0.030518,4360,2,128,5,4528,6,0,307,6410,0


Converting to forward existential form...Done !
original formula: AF(EG((p105==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p105==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t7, t10, t12, t15, t42, t44, t51, Intersection with reachable at each step enabled. ...201
Detected timeout of ITS tools.
[2024-05-30 13:39:10] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:39:10] [INFO ] Applying decomposition
[2024-05-30 13:39:10] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14244712569444986827.txt' '-o' '/tmp/graph14244712569444986827.bin' '-w' '/tmp/graph14244712569444986827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14244712569444986827.bin' '-l' '-1' '-v' '-w' '/tmp/graph14244712569444986827.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:39:10] [INFO ] Decomposing Gal with order
[2024-05-30 13:39:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:39:10] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-30 13:39:10] [INFO ] Flatten gal took : 35 ms
[2024-05-30 13:39:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:39:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7550913801663636978.gal : 1 ms
[2024-05-30 13:39:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality11080628349244353626.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/CTLCardinality7550913801663636978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11080628349244353626.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,2.32488e+09,0.014569,3888,42,13,1004,62,132,1387,26,103,0


Converting to forward existential form...Done !
original formula: AF(EG((i4.u8.p105==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((i4.u8.p105==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, u5.t44, u7.t15, i0.u1.t5, i0.u3.t10, i1.u2.t7, i1.u4.t42, i4.t1, i4.u6.t12, Intersectio...240
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,0.313715,19192,1,0,33609,82,803,58308,127,103,31073
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 206 transition count 206
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 206 transition count 206
Applied a total of 30 rules in 6 ms. Remains 206 /221 variables (removed 15) and now considering 206/221 (removed 15) transitions.
// Phase 1: matrix 206 rows 206 cols
[2024-05-30 13:39:10] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:39:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 13:39:10] [INFO ] Invariant cache hit.
[2024-05-30 13:39:10] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-30 13:39:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:12] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:39:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:39:12] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:39:12] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:39:12] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:39:12] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/412 variables, 206/238 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/412 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 238 constraints, problems are : Problem set: 0 solved, 205 unsolved in 8069 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/412 variables, 206/238 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 205/443 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:20] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:39:20] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:39:20] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:39:20] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 3 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:23] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:39:25] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:25] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:39:25] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:39:25] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:39:25] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:39:25] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 19/482 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:27] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:39:28] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:39:28] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:39:28] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:39:28] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:39:30] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:39:30] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 14/496 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:32] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:39:32] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:39:32] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:39:32] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:39:32] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 7/503 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:36] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:39:43] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:39:43] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:39:43] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:39:45] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 509 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 77/77 constraints]
After SMT, in 38113ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 38118ms
Starting structural reductions in LTL mode, iteration 1 : 206/221 places, 206/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38300 ms. Remains : 206/221 places, 206/221 transitions.
[2024-05-30 13:39:48] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:39:48] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:39:48] [INFO ] Input system was already deterministic with 206 transitions.
[2024-05-30 13:39:48] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:39:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:39:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5808190713827437404.gal : 1 ms
[2024-05-30 13:39:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality6269611551028781305.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/CTLCardinality5808190713827437404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6269611551028781305.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,3.1065e+18,1.7851,58424,2,2071,5,153476,6,0,1032,394719,0


Converting to forward existential form...Done !
original formula: ((EG(!(A((((p134==0)||(p34==1))||((((p180==0)||(p211==1))||((p26==0)||(p17==1)))&&(p63!=0))) U ((AX((p157==1)) * (p62==1)) * (p211==1))))...315
=> equivalent forward existential formula: [(EY((FwdU((Init * (EG(!(!((E(!(((!(EX(!((p157==1)))) * (p62==1)) * (p211==1))) U (!((((p134==0)||(p34==1))||(((...506
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t26, t29, t33, t34, t40, t44, t49, t53, t58, t62, t65, t66, t70, ...433
Detected timeout of ITS tools.
[2024-05-30 13:40:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:40:18] [INFO ] Applying decomposition
[2024-05-30 13:40:19] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph779041083768772224.txt' '-o' '/tmp/graph779041083768772224.bin' '-w' '/tmp/graph779041083768772224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph779041083768772224.bin' '-l' '-1' '-v' '-w' '/tmp/graph779041083768772224.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:40:19] [INFO ] Decomposing Gal with order
[2024-05-30 13:40:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:40:19] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-30 13:40:19] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:40:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:40:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9403472091809300472.gal : 3 ms
[2024-05-30 13:40:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality4363842274160058954.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/CTLCardinality9403472091809300472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4363842274160058954.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,3.1065e+18,0.13836,9276,420,38,10666,329,418,19172,49,712,0


Converting to forward existential form...Done !
original formula: ((EG(!(A((((i11.u45.p134==0)||(i0.i2.u14.p34==1))||((((i13.i1.u57.p180==0)||(i16.u68.p211==1))||((i2.u9.p26==0)||(i1.u5.p17==1)))&&(i5.u2...459
=> equivalent forward existential formula: [(EY((FwdU((Init * (EG(!(!((E(!(((!(EX(!((i13.i0.u50.p157==1)))) * (i5.u21.p62==1)) * (i16.u68.p211==1))) U (!((...702
Reverse transition relation is NOT exact ! Due to transitions t192, t194, i0.i0.u2.t183, i0.i2.t159, i0.i2.u12.t163, i1.t176, i1.u5.t180, i2.t173, i2.u9.t1...750
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 196 transition count 196
Applied a total of 50 rules in 12 ms. Remains 196 /221 variables (removed 25) and now considering 196/221 (removed 25) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-30 13:40:49] [INFO ] Computed 21 invariants in 5 ms
[2024-05-30 13:40:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 13:40:49] [INFO ] Invariant cache hit.
[2024-05-30 13:40:49] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:40:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6476 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:41:00] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:41:00] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:41:02] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:02] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:02] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:13] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:17] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:41:17] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:24] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:41:24] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36512ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36515ms
Starting structural reductions in LTL mode, iteration 1 : 196/221 places, 196/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36709 ms. Remains : 196/221 places, 196/221 transitions.
[2024-05-30 13:41:25] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:41:25] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:41:25] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-30 13:41:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:41:25] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:41:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality1573488654688372033.gal : 1 ms
[2024-05-30 13:41:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality2302645819379479662.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/CTLCardinality1573488654688372033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2302645819379479662.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.13628e+18,1.19347,43704,2,1831,5,118079,6,0,982,280217,0


Converting to forward existential form...Done !
original formula: EX(AF(EG((p38!=0))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG((p38!=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, ...401
Detected timeout of ITS tools.
[2024-05-30 13:41:55] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:41:55] [INFO ] Applying decomposition
[2024-05-30 13:41:55] [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/graph15198108830254113547.txt' '-o' '/tmp/graph15198108830254113547.bin' '-w' '/tmp/graph15198108830254113547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15198108830254113547.bin' '-l' '-1' '-v' '-w' '/tmp/graph15198108830254113547.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:41:56] [INFO ] Decomposing Gal with order
[2024-05-30 13:41:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:41:56] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-30 13:41:56] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:41:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality14960327876180166323.gal : 2 ms
[2024-05-30 13:41:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality11240189553390928550.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/CTLCardinality14960327876180166323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11240189553390928550.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13628e+18,0.162989,10236,385,31,13273,463,378,21835,47,822,0


Converting to forward existential form...Done !
original formula: EX(AF(EG((i2.u13.p38!=0))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG((i2.u13.p38!=0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t177, t179, t182, t184, i0.i1.t163, i0.i2.t145, i0.i2.u15.t141, i1.t166, i1.u5.t170, i2.t150,...628
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
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 220 transition count 158
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 158 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 157 transition count 157
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 126 place count 157 transition count 127
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 186 place count 127 transition count 127
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 201 place count 112 transition count 112
Iterating global reduction 3 with 15 rules applied. Total rules applied 216 place count 112 transition count 112
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 216 place count 112 transition count 105
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 230 place count 105 transition count 105
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 308 place count 66 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 309 place count 66 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 311 place count 65 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 313 place count 63 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 62 transition count 62
Applied a total of 314 rules in 35 ms. Remains 62 /221 variables (removed 159) and now considering 62/221 (removed 159) transitions.
// Phase 1: matrix 62 rows 62 cols
[2024-05-30 13:42:26] [INFO ] Computed 20 invariants in 2 ms
[2024-05-30 13:42:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 13:42:26] [INFO ] Invariant cache hit.
[2024-05-30 13:42:26] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-30 13:42:26] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-30 13:42:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 62/124 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 62/124 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 60/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1384ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1385ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/221 places, 62/221 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1519 ms. Remains : 62/221 places, 62/221 transitions.
[2024-05-30 13:42:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:42:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:42:27] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-30 13:42:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:42:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:42:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality17532240760697626121.gal : 3 ms
[2024-05-30 13:42:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12466417702692502344.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/CTLCardinality17532240760697626121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12466417702692502344.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,5.16561e+09,0.020861,4392,2,105,5,3768,6,0,313,4618,0


Converting to forward existential form...Done !
original formula: AF(AG((EF(EG(((p138==0)&&(p141==1)))) + AG(EF((p183==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U EG(((p138==0)&&(p141==1)))) + !(E(TRUE U !(E(TRUE U (p183==1)))))))))))] = F...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 56/6/6
(forward)formula 0,0,8.07637,237916,1,0,158,725075,28,175,1612,2.17637e+06,188
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 199 transition count 199
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 197 transition count 197
Applied a total of 48 rules in 6 ms. Remains 197 /221 variables (removed 24) and now considering 197/221 (removed 24) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:42:35] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 13:42:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:42:35] [INFO ] Invariant cache hit.
[2024-05-30 13:42:35] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:42:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:37] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:42:37] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
[2024-05-30 13:42:37] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:42:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:42:37] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 223 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6545 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/419 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:44] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:47] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:47] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-30 13:42:48] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:48] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:42:48] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:49] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 12/451 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:50] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:42:51] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:42:51] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:42:51] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:42:52] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:42:55] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:00] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:00] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 3 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:10] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 475 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 61/61 constraints]
After SMT, in 36579ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36581ms
Starting structural reductions in LTL mode, iteration 1 : 197/221 places, 197/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36749 ms. Remains : 197/221 places, 197/221 transitions.
[2024-05-30 13:43:12] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:43:12] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:43:12] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-30 13:43:12] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:43:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:43:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6795989025130471836.gal : 1 ms
[2024-05-30 13:43:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality5958350892592622698.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/CTLCardinality6795989025130471836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5958350892592622698.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.29859e+18,1.39578,48248,2,1935,5,125867,6,0,987,316121,0


Converting to forward existential form...Done !
original formula: EG(((((p79==0) * EX(AG((p184==0)))) + (AG(EX(((p9==0)&&(p57==1)))) * (p151==0))) + ((p114==1)&&((p89==0)||(p197==1)))))
=> equivalent forward existential formula: [FwdG(Init,((((p79==0) * EX(!(E(TRUE U !((p184==0)))))) + (!(E(TRUE U !(EX(((p9==0)&&(p57==1)))))) * (p151==0)))...204
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t50, t55, t59, t62, t66, t72, t76, ...406
(forward)formula 0,0,24.1817,693636,1,0,545,3.55768e+06,426,242,5665,4.59308e+06,582
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 200 transition count 200
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 200 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 199 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 198 transition count 198
Applied a total of 46 rules in 5 ms. Remains 198 /221 variables (removed 23) and now considering 198/221 (removed 23) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:43:36] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:43:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 13:43:36] [INFO ] Invariant cache hit.
[2024-05-30 13:43:37] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:43:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:43:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:43:38] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:43:38] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:43:38] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:43:38] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:43:39] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 225 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6795 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/422 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:43:45] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:43:45] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:43:45] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:43:45] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:47] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:43:47] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:43:47] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:43:47] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:43:47] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:43:47] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:47] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:43:48] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:49] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:49] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:43:49] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:43:49] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:43:50] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:50] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:43:50] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:43:50] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:43:50] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 18/460 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:43:51] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:43:52] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:43:52] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:43:52] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:43:52] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:43:52] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:43:52] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:43:53] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:43:53] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:43:53] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:43:53] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:43:54] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:43:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 13/473 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:43:55] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:43:56] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:43:56] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (OVERLAPS) 0/396 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 476 constraints, problems are : Problem set: 0 solved, 197 unsolved in 21951 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 60/60 constraints]
After SMT, in 28765ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 28767ms
Starting structural reductions in LTL mode, iteration 1 : 198/221 places, 198/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28930 ms. Remains : 198/221 places, 198/221 transitions.
[2024-05-30 13:44:05] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:44:05] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:44:05] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-30 13:44:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:44:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:44:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality7532325710646240181.gal : 1 ms
[2024-05-30 13:44:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15278357759829614410.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/CTLCardinality7532325710646240181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15278357759829614410.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.33871e+18,1.31378,45996,2,1857,5,121676,6,0,992,295476,0


Converting to forward existential form...Done !
original formula: EG(EF((EX(TRUE) * E((AF(((p75==0)||(p45==1))) * E((p92==0) U (p22==1))) U ((p239==0)||(p66==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (EX(TRUE) * E((!(EG(!(((p75==0)||(p45==1))))) * E((p92==0) U (p22==1))) U ((p239==0)||(p66==...172
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, ...401
Detected timeout of ITS tools.
[2024-05-30 13:44:35] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:44:35] [INFO ] Applying decomposition
[2024-05-30 13:44:35] [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/graph18088981521477455885.txt' '-o' '/tmp/graph18088981521477455885.bin' '-w' '/tmp/graph18088981521477455885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18088981521477455885.bin' '-l' '-1' '-v' '-w' '/tmp/graph18088981521477455885.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:44:35] [INFO ] Decomposing Gal with order
[2024-05-30 13:44:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:44:36] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-30 13:44:36] [INFO ] Flatten gal took : 14 ms
[2024-05-30 13:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:44:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15260074581853780785.gal : 3 ms
[2024-05-30 13:44:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality10158816992678933340.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/CTLCardinality15260074581853780785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10158816992678933340.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33871e+18,0.123635,8652,382,38,9950,636,405,16029,53,1210,0


Converting to forward existential form...Done !
original formula: EG(EF((EX(TRUE) * E((AF(((i5.u25.p75==0)||(i3.i1.u14.p45==1))) * E((i7.u27.p92==0) U (i1.u7.p22==1))) U ((i19.u73.p239==0)||(i6.u21.p66==...162
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (EX(TRUE) * E((!(EG(!(((i5.u25.p75==0)||(i3.i1.u14.p45==1))))) * E((i7.u27.p92==0) U (i1.u7....217
Reverse transition relation is NOT exact ! Due to transitions t179, t184, t186, i1.t173, i1.u7.t168, i2.t164, i3.i0.u2.t175, i3.i1.t151, i3.i1.u12.t155, i4...643
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 220 transition count 154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 154 transition count 154
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 132 place count 154 transition count 125
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 190 place count 125 transition count 125
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 203 place count 112 transition count 112
Iterating global reduction 2 with 13 rules applied. Total rules applied 216 place count 112 transition count 112
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 216 place count 112 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 228 place count 106 transition count 106
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 310 place count 65 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 311 place count 65 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 64 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 61 transition count 61
Applied a total of 316 rules in 17 ms. Remains 61 /221 variables (removed 160) and now considering 61/221 (removed 160) transitions.
// Phase 1: matrix 61 rows 61 cols
[2024-05-30 13:45:06] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:45:06] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 13:45:06] [INFO ] Invariant cache hit.
[2024-05-30 13:45:06] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-30 13:45:06] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-30 13:45:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 61/122 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 81 constraints, problems are : Problem set: 0 solved, 60 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 61/122 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 60/141 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 141 constraints, problems are : Problem set: 0 solved, 60 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1294ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1295ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/221 places, 61/221 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1452 ms. Remains : 61/221 places, 61/221 transitions.
[2024-05-30 13:45:07] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:45:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:45:07] [INFO ] Input system was already deterministic with 61 transitions.
RANDOM walk for 835 steps (0 resets) in 12 ms. (64 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-005B-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 13:45:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:45:07] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:45:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4984844245137256258.gal : 1 ms
[2024-05-30 13:45:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12896854037148939493.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4984844245137256258.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12896854037148939493.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 196 transition count 196
Applied a total of 50 rules in 5 ms. Remains 196 /221 variables (removed 25) and now considering 196/221 (removed 25) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-30 13:45:07] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:45:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 13:45:07] [INFO ] Invariant cache hit.
[2024-05-30 13:45:07] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:45:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:09] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:45:09] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:45:09] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:45:09] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:45:09] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6497 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-30 13:45:16] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:45:17] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:18] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:45:18] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:45:18] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:45:18] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:18] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-30 13:45:19] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 2 ms to minimize.
[2024-05-30 13:45:20] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:45:20] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:45:20] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:45:20] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:45:20] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:45:20] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:45:20] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:45:22] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:45:23] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:45:23] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:45:23] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:27] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:45:28] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:45:28] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:31] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:36] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:45:36] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:45:42] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:45:42] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36531ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36532ms
Starting structural reductions in LTL mode, iteration 1 : 196/221 places, 196/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36801 ms. Remains : 196/221 places, 196/221 transitions.
[2024-05-30 13:45:44] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:45:44] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:45:44] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-30 13:45:44] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:45:44] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:45:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16208803125948153811.gal : 1 ms
[2024-05-30 13:45:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality43925625934970540.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/CTLCardinality16208803125948153811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality43925625934970540.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13628e+18,1.14056,43704,2,1831,5,118079,6,0,982,280217,0


Converting to forward existential form...Done !
original formula: EX(AG(EX(TRUE)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(TRUE)))))] != 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, ...401
Detected timeout of ITS tools.
[2024-05-30 13:46:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:46:14] [INFO ] Applying decomposition
[2024-05-30 13:46:14] [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/graph7531323360367697912.txt' '-o' '/tmp/graph7531323360367697912.bin' '-w' '/tmp/graph7531323360367697912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7531323360367697912.bin' '-l' '-1' '-v' '-w' '/tmp/graph7531323360367697912.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:46:14] [INFO ] Decomposing Gal with order
[2024-05-30 13:46:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:46:14] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-30 13:46:14] [INFO ] Flatten gal took : 24 ms
[2024-05-30 13:46:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:46:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5413731282887538476.gal : 6 ms
[2024-05-30 13:46:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5598643627166896153.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/CTLCardinality5413731282887538476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5598643627166896153.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,1.13628e+18,0.135919,9724,328,22,11860,286,351,20024,38,570,0


Converting to forward existential form...Done !
original formula: EX(AG(EX(TRUE)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(TRUE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t177, t179, t182, t184, i0.t166, i0.u6.t170, i1.i0.u2.t173, i1.i2.t150, i1.i2.u13.t154, i2.t1...642
(forward)formula 0,0,25.8317,636248,1,0,775656,286,2209,2.71103e+06,187,914,638643
FORMULA ShieldRVt-PT-005B-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 196 transition count 196
Applied a total of 50 rules in 10 ms. Remains 196 /221 variables (removed 25) and now considering 196/221 (removed 25) transitions.
[2024-05-30 13:46:40] [INFO ] Invariant cache hit.
[2024-05-30 13:46:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 13:46:40] [INFO ] Invariant cache hit.
[2024-05-30 13:46:40] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:46:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:46:42] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:46:42] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:46:42] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:46:42] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6546 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:48] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 19 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:46:51] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:46:51] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:51] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:46:51] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:46:52] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:46:52] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:46:52] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:46:52] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:46:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:46:53] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:46:55] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:46:55] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:46:55] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:46:55] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:46:55] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:46:56] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:46:56] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:47:00] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:47:01] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:47:01] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:47:04] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:47:09] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:47:09] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:47:15] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:47:15] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36586ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36589ms
Starting structural reductions in LTL mode, iteration 1 : 196/221 places, 196/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36790 ms. Remains : 196/221 places, 196/221 transitions.
[2024-05-30 13:47:17] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:47:17] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:47:17] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-30 13:47:17] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:47:17] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:47:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13385605651257339249.gal : 2 ms
[2024-05-30 13:47:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality13680867753886218988.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/CTLCardinality13385605651257339249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13680867753886218988.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.13628e+18,1.19519,43964,2,1831,5,118079,6,0,982,280217,0


Converting to forward existential form...Done !
original formula: (EF((p157==1)) * !(A((AX(EX(((p193==0)||(p4==1)))) + AX((p163==1))) U !(EF((((p237==1)&&(p144==1))&&((p19==0)||(p198==1))))))))
=> equivalent forward existential formula: ([(FwdU((FwdU((Init * E(TRUE U (p157==1))),!(!(E(TRUE U (((p237==1)&&(p144==1))&&((p19==0)||(p198==1))))))) * !(...395
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, ...401
(forward)formula 0,1,8.62684,276696,1,0,1312,1.13463e+06,428,1044,5911,2.28809e+06,1361
FORMULA ShieldRVt-PT-005B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 220 transition count 161
Reduce places removed 59 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 161 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 159 transition count 159
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 122 place count 159 transition count 129
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 182 place count 129 transition count 129
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 197 place count 114 transition count 114
Iterating global reduction 3 with 15 rules applied. Total rules applied 212 place count 114 transition count 114
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 212 place count 114 transition count 107
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 226 place count 107 transition count 107
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 302 place count 69 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 69 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 305 place count 68 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 66 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 65 transition count 65
Applied a total of 308 rules in 23 ms. Remains 65 /221 variables (removed 156) and now considering 65/221 (removed 156) transitions.
// Phase 1: matrix 65 rows 65 cols
[2024-05-30 13:47:26] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:47:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 13:47:26] [INFO ] Invariant cache hit.
[2024-05-30 13:47:26] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-30 13:47:26] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-30 13:47:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 13:47:26] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 65/130 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 86 constraints, problems are : Problem set: 0 solved, 62 unsolved in 884 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 65/130 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 62/148 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 148 constraints, problems are : Problem set: 0 solved, 62 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 1/1 constraints]
After SMT, in 1743ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 1744ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/221 places, 65/221 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1899 ms. Remains : 65/221 places, 65/221 transitions.
[2024-05-30 13:47:27] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:47:27] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:47:27] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-30 13:47:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:47:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:47:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality4495014501516946876.gal : 0 ms
[2024-05-30 13:47:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality6341781791955894140.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/CTLCardinality4495014501516946876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6341781791955894140.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,7.43734e+09,0.035736,4968,2,122,5,5992,6,0,327,8612,0


Converting to forward existential form...Done !
original formula: EG((EG(EF(((p9==0)||(p164==1)))) + (((p248==0)&&(p150==1)) * EF(((p80==0)||(p7==1))))))
=> equivalent forward existential formula: [FwdG(Init,(EG(E(TRUE U ((p9==0)||(p164==1)))) + (((p248==0)&&(p150==1)) * E(TRUE U ((p80==0)||(p7==1))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t57, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,1.79369,75992,1,0,349,306654,156,172,2152,592503,495
FORMULA ShieldRVt-PT-005B-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 221/221 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 205 transition count 205
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 205 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 204 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 204 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 203 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 203 transition count 203
Applied a total of 36 rules in 4 ms. Remains 203 /221 variables (removed 18) and now considering 203/221 (removed 18) transitions.
// Phase 1: matrix 203 rows 203 cols
[2024-05-30 13:47:29] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:47:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 13:47:29] [INFO ] Invariant cache hit.
[2024-05-30 13:47:29] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-30 13:47:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:47:31] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:47:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:47:31] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:47:31] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 5 ms to minimize.
[2024-05-30 13:47:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:47:32] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:47:32] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:47:32] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:47:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/406 variables, 203/233 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 233 constraints, problems are : Problem set: 0 solved, 202 unsolved in 8529 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/406 variables, 203/233 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 202/435 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-30 13:47:44] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:47:44] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:47:44] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:47:44] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:47:44] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:47:48] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:47:48] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:47:48] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:47:49] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:47:49] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:47:49] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:47:49] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:47:49] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:47:49] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:47:53] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:47:53] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:47:53] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:47:53] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:47:55] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:47:57] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:47:57] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:48:00] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-30 13:48:00] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:48:00] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 489 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 63/63 constraints]
After SMT, in 38565ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 38567ms
Starting structural reductions in LTL mode, iteration 1 : 203/221 places, 203/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38737 ms. Remains : 203/221 places, 203/221 transitions.
[2024-05-30 13:48:08] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:48:08] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:48:08] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-30 13:48:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:48:08] [INFO ] Flatten gal took : 24 ms
[2024-05-30 13:48:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6596183479453020785.gal : 1 ms
[2024-05-30 13:48:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality13971958955698860094.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/CTLCardinality6596183479453020785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13971958955698860094.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,2.0672e+18,1.6113,57272,2,2249,5,147983,6,0,1017,385181,0


Converting to forward existential form...Done !
original formula: EG(((A(AF(((p58==0)||(p100==1))) U ((((p47==0)||(p179==1))&&(p170==1))||((p15==1)&&((p225==0)||(p138==1))))) * AF(EX((p139==1)))) * (AF((...385
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(((((p47==0)||(p179==1))&&(p170==1))||((p15==1)&&((p225==0)||(p138==1))))) U (!(!(EG(!(((p58=...755
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t28, t30, t31, t33, t37, t41, t47, t52, t57, t62, t64, t68, t74, ...429
Detected timeout of ITS tools.
[2024-05-30 13:48:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:48:38] [INFO ] Applying decomposition
[2024-05-30 13:48:38] [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/graph3591236073637589345.txt' '-o' '/tmp/graph3591236073637589345.bin' '-w' '/tmp/graph3591236073637589345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3591236073637589345.bin' '-l' '-1' '-v' '-w' '/tmp/graph3591236073637589345.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:48:38] [INFO ] Decomposing Gal with order
[2024-05-30 13:48:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:48:38] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-30 13:48:38] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:48:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:48:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality15822271582739381467.gal : 2 ms
[2024-05-30 13:48:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality6710064972272704212.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/CTLCardinality15822271582739381467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6710064972272704212.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,2.0672e+18,0.246198,13480,452,29,19806,349,433,32515,53,733,0


Converting to forward existential form...Done !
original formula: EG(((A(AF(((i7.i0.u20.p58==0)||(i7.i1.u34.p100==1))) U ((((i3.u19.p47==0)||(i13.u58.p179==1))&&(i14.u53.p170==1))||((i1.u9.p15==1)&&((i18...599
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(((((i3.u19.p47==0)||(i13.u58.p179==1))&&(i14.u53.p170==1))||((i1.u9.p15==1)&&((i18.i1.u71.p2...1117
Reverse transition relation is NOT exact ! Due to transitions t184, t189, i0.i1.t165, i0.i1.t169, i1.t172, i1.u6.t177, i1.u9.t176, i2.t156, i2.u15.t160, i3...724
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
[2024-05-30 13:49:08] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:49:08] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:49:08] [INFO ] Applying decomposition
[2024-05-30 13:49:08] [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/graph17605406930991921112.txt' '-o' '/tmp/graph17605406930991921112.bin' '-w' '/tmp/graph17605406930991921112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17605406930991921112.bin' '-l' '-1' '-v' '-w' '/tmp/graph17605406930991921112.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:49:08] [INFO ] Decomposing Gal with order
[2024-05-30 13:49:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:49:08] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-30 13:49:08] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:49:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-05-30 13:49:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality8803946783002465700.gal : 3 ms
[2024-05-30 13:49:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality11912963372325723087.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/CTLCardinality8803946783002465700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11912963372325723087.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.53114e+18,0.251049,12508,660,35,16584,273,454,32662,49,649,0


Converting to forward existential form...Done !
original formula: ((EG(!(A((((i8.u46.p134==0)||(i0.i2.u14.p34==1))||((((i13.u61.p180==0)||(i16.u76.p211==1))||((i1.u10.p26==0)||(i2.u5.p17==1)))&&(i5.u24.p...456
=> equivalent forward existential formula: [(EY((FwdU((Init * (EG(!(!((E(!(((!(EX(!((i11.i0.u55.p157==1)))) * (i5.u23.p62==1)) * (i16.u76.p211==1))) U (!((...699
Reverse transition relation is NOT exact ! Due to transitions t207, i0.i0.u2.t198, i0.i2.t172, i0.i2.u15.t176, i1.t187, i1.t186, i1.u10.t185, i1.u13.t181, ...920
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
[2024-05-30 14:13:24] [INFO ] Applying decomposition
[2024-05-30 14:13:24] [INFO ] Flatten gal took : 5 ms
[2024-05-30 14:13:24] [INFO ] Decomposing Gal with order
[2024-05-30 14:13:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:13:24] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-30 14:13:24] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:13:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 14:13:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13626161601725724663.gal : 2 ms
[2024-05-30 14:13:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality11293799018277687715.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13626161601725724663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11293799018277687715.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 -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.53114e+18,3.91751,112024,829,326,180566,810,297,909680,129,8018,0


Converting to forward existential form...Done !
original formula: ((EG(!(A((((i0.i0.i1.i0.u25.p134==0)||(i0.i0.i0.i0.i1.i0.u11.p34==1))||((((i0.i1.i0.i0.u31.p180==0)||(i1.i0.i0.u37.p211==1))||((i0.i0.i0....629
=> equivalent forward existential formula: [(EY((FwdU((Init * (EG(!(!((E(!(((!(EX(!((i0.i1.i0.u58.p157==1)))) * (i0.i0.i0.i1.i0.i0.u16.p62==1)) * (i1.i0.i0...916
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t207, i0.i0.i0.i0.u5.t198, i0.i0.i0.i0.i1.u12.t162, i0.i0.i0.i0.i1.u12.t163, i0.i0.i0.i...1614

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-005B"
export BK_EXAMINATION="CTLCardinality"
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-005B, examination is CTLCardinality"
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-171683762200953"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-005B.tgz
mv ShieldRVt-PT-005B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;