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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 14:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 14:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 56K 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 ShieldPPPt-PT-003B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717002771084

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 17:12:52] [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-29 17:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:12:52] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-29 17:12:52] [INFO ] Transformed 237 places.
[2024-05-29 17:12:52] [INFO ] Transformed 216 transitions.
[2024-05-29 17:12:52] [INFO ] Found NUPN structural information;
[2024-05-29 17:12:52] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 228 transition count 207
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 228 transition count 207
Applied a total of 18 rules in 36 ms. Remains 228 /237 variables (removed 9) and now considering 207/216 (removed 9) transitions.
// Phase 1: matrix 207 rows 228 cols
[2024-05-29 17:12:52] [INFO ] Computed 34 invariants in 22 ms
[2024-05-29 17:12:52] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-29 17:12:52] [INFO ] Invariant cache hit.
[2024-05-29 17:12:53] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-29 17:12:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:12:54] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 15 ms to minimize.
[2024-05-29 17:12:54] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:12:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:12:56] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:12:57] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:12:57] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 4 ms to minimize.
[2024-05-29 17:12:57] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:12:57] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:12:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:12:58] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:12:58] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 2 ms to minimize.
[2024-05-29 17:12:58] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 207/435 variables, 228/303 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:13:03] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 306 constraints, problems are : Problem set: 0 solved, 206 unsolved in 14414 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/435 variables, 228/306 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 206/512 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:13:10] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:13:10] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:13:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:13:10] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:13:10] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:13:10] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:13:10] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:13:11] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:13:11] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:13:11] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-29 17:13:12] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 11/523 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:13:14] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-29 17:13:15] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:13:17] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:13:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:13:18] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:13:19] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-29 17:13:21] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (OVERLAPS) 0/435 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 530 constraints, problems are : Problem set: 0 solved, 206 unsolved in 25459 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 62/62 constraints]
After SMT, in 39936ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 39965ms
Starting structural reductions in LTL mode, iteration 1 : 228/237 places, 207/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40476 ms. Remains : 228/237 places, 207/216 transitions.
Support contains 97 out of 228 places after structural reductions.
[2024-05-29 17:13:33] [INFO ] Flatten gal took : 59 ms
[2024-05-29 17:13:33] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:13:33] [INFO ] Input system was already deterministic with 207 transitions.
Support contains 93 out of 228 places (down from 97) after GAL structural reductions.
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1526 ms. (26 steps per ms) remains 3/53 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
[2024-05-29 17:13:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 209/228 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 207/435 variables, 228/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/435 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 262 constraints, problems are : Problem set: 0 solved, 3 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 209/228 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:13:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp42 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 12/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 207/435 variables, 228/274 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 2/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/435 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 276 constraints, problems are : Problem set: 1 solved, 2 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 963ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 16 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 207/207 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 228 transition count 161
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 182 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 180 transition count 159
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 96 place count 180 transition count 142
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 130 place count 163 transition count 142
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 141 place count 152 transition count 131
Iterating global reduction 3 with 11 rules applied. Total rules applied 152 place count 152 transition count 131
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 152 place count 152 transition count 126
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 162 place count 147 transition count 126
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 246 place count 105 transition count 84
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 264 place count 96 transition count 84
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 96 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 95 transition count 83
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 273 place count 95 transition count 83
Applied a total of 273 rules in 47 ms. Remains 95 /228 variables (removed 133) and now considering 83/207 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 95/228 places, 83/207 transitions.
RANDOM walk for 40000 steps (8 resets) in 561 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 518210 steps, run timeout after 3002 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 518210 steps, saw 356730 distinct states, run finished after 3006 ms. (steps per millisecond=172 ) properties seen :0
// Phase 1: matrix 83 rows 95 cols
[2024-05-29 17:13:38] [INFO ] Computed 34 invariants in 4 ms
[2024-05-29 17:13:38] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 79/95 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/178 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 19/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 79/95 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:13:38] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:13:38] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:13:38] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:13:38] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:13:38] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 83/178 variables, 95/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 19/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 395ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 16 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 83/83 transitions.
Applied a total of 0 rules in 9 ms. Remains 95 /95 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 95/95 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-29 17:13:38] [INFO ] Invariant cache hit.
[2024-05-29 17:13:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 17:13:38] [INFO ] Invariant cache hit.
[2024-05-29 17:13:39] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 17:13:39] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-29 17:13:39] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-29 17:13:39] [INFO ] Invariant cache hit.
[2024-05-29 17:13:39] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:13:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:13:40] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/178 variables, 95/146 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 19/165 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 165 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2219 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/178 variables, 95/146 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 19/165 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 82/247 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 247 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2374 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 17/17 constraints]
After SMT, in 4607ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4608ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4781 ms. Remains : 95/95 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 95 transition count 83
Applied a total of 16 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 83 rows 95 cols
[2024-05-29 17:13:43] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 17:13:43] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:13:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 17:13:43] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:13:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 17:13:43] [INFO ] After 19ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-29 17:13:43] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:13:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:13:43] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:13:43] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:13:44] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:13:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:13:44] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:13:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 245 ms
[2024-05-29 17:13:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:13:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:13:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-05-29 17:13:44] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-29 17:13:44] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 524 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-29 17:13:44] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:13:44] [INFO ] Flatten gal took : 19 ms
[2024-05-29 17:13:44] [INFO ] Input system was already deterministic with 207 transitions.
Computed a total of 57 stabilizing places and 57 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 205 transition count 184
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 203 transition count 182
Applied a total of 50 rules in 24 ms. Remains 203 /228 variables (removed 25) and now considering 182/207 (removed 25) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:13:44] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:13:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 17:13:44] [INFO ] Invariant cache hit.
[2024-05-29 17:13:44] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:13:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:13:45] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:13:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:13:45] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:13:45] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:13:45] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:13:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:13:48] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:13:48] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:13:48] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/385 variables, 203/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:13:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:13:52] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/385 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 266 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11457 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/385 variables, 203/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 181/447 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:13:58] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:13:58] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:13:58] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:13:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:13:59] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:13:59] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 6/453 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:14:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:14:02] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:14:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:14:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:14:06] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:14:10] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:14:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:14:13] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 461 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25231 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 43/43 constraints]
After SMT, in 36704ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 36706ms
Starting structural reductions in LTL mode, iteration 1 : 203/228 places, 182/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36925 ms. Remains : 203/228 places, 182/207 transitions.
[2024-05-29 17:14:21] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:14:21] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:14:21] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-29 17:14:21] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:14:21] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:14:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality13407560750559766569.gal : 4 ms
[2024-05-29 17:14:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality4049561577840577618.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/CTLCardinality13407560750559766569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4049561577840577618.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,3.99641e+19,8.03065,230496,2,11923,5,722977,6,0,996,1.60197e+06,0


Converting to forward existential form...Done !
original formula: EF((!(E((p177==0) U (EX((p173==1)) * (((p109==1)&&(p141==1))||(p61!=0))))) + AG(EF(((p166==0)||(p171==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((p177==0) U (EX((p173==1)) * (((p109==1)&&(p141==1))||(p61!=0))))))] != FALSE + [(FwdU(...228
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...444
Detected timeout of ITS tools.
[2024-05-29 17:14:51] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:14:51] [INFO ] Applying decomposition
[2024-05-29 17:14:51] [INFO ] Flatten gal took : 8 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/graph10292653703698486832.txt' '-o' '/tmp/graph10292653703698486832.bin' '-w' '/tmp/graph10292653703698486832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10292653703698486832.bin' '-l' '-1' '-v' '-w' '/tmp/graph10292653703698486832.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:14:51] [INFO ] Decomposing Gal with order
[2024-05-29 17:14:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:14:51] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-29 17:14:51] [INFO ] Flatten gal took : 74 ms
[2024-05-29 17:14:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-29 17:14:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5459360359813120997.gal : 15 ms
[2024-05-29 17:14:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16878092672323820021.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/CTLCardinality5459360359813120997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16878092672323820021.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,3.99641e+19,0.557659,24564,1110,50,39012,387,475,88569,61,960,0


Converting to forward existential form...Done !
original formula: EF((!(E((i12.i0.u55.p177==0) U (EX((i12.i0.u56.p173==1)) * (((i6.i1.u35.p109==1)&&(i10.u45.p141==1))||(i5.u21.p61!=0))))) + AG(EF(((i12.i...196
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((i12.i0.u55.p177==0) U (EX((i12.i0.u56.p173==1)) * (((i6.i1.u35.p109==1)&&(i10.u45.p141...297
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t89, t92, t136, t139, t165, t181, i0.i1.u59.t45, i1.t179, i1.i1.u11.t138, i1.i2.t10...747
(forward)formula 0,1,8.83701,268500,1,0,381441,510,2529,1.2685e+06,333,1638,331569
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 206 transition count 185
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 204 transition count 183
Applied a total of 48 rules in 23 ms. Remains 204 /228 variables (removed 24) and now considering 183/207 (removed 24) transitions.
// Phase 1: matrix 183 rows 204 cols
[2024-05-29 17:15:00] [INFO ] Computed 34 invariants in 3 ms
[2024-05-29 17:15:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 17:15:00] [INFO ] Invariant cache hit.
[2024-05-29 17:15:00] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-29 17:15:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:15:03] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
[2024-05-29 17:15:03] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:03] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:15:03] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:04] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:15:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:15:04] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/387 variables, 204/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:07] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:08] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:09] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:15:09] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:12] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:15:12] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/387 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 0/387 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 269 constraints, problems are : Problem set: 0 solved, 182 unsolved in 14925 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 31/65 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/387 variables, 204/269 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 182/451 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:17] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:15:18] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:15:18] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-29 17:15:18] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:15:18] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:15:19] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:21] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:15:21] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-29 17:15:21] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:15:23] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:15:28] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/387 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 0/387 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 463 constraints, problems are : Problem set: 0 solved, 182 unsolved in 21188 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 43/43 constraints]
After SMT, in 36130ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 36132ms
Starting structural reductions in LTL mode, iteration 1 : 204/228 places, 183/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36351 ms. Remains : 204/228 places, 183/207 transitions.
[2024-05-29 17:15:36] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:15:36] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:15:36] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-29 17:15:36] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:15:36] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:15:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality17739400774268565292.gal : 4 ms
[2024-05-29 17:15:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8842354812918362461.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/CTLCardinality17739400774268565292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8842354812918362461.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,4.6604e+19,7.42526,240412,2,15155,5,739413,6,0,1001,1.66764e+06,0


Converting to forward existential form...Done !
original formula: (AF(((p52==0)||(p183==1))) * AG((((p63==1) + AX((p143==0))) + ((p182==1) * AX(((p30!=0)&&(p165!=1)))))))
=> equivalent forward existential formula: ([FwdG(Init,!(((p52==0)||(p183==1))))] = FALSE * ([((FwdU(Init,TRUE) * !(((p63==1) + !(EX(!((p143==0))))))) * !(...278
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...456
(forward)formula 0,0,14.2272,298840,1,0,398,1.41278e+06,386,191,5521,1.89668e+06,376
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 205 transition count 184
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 203 transition count 182
Applied a total of 50 rules in 21 ms. Remains 203 /228 variables (removed 25) and now considering 182/207 (removed 25) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:15:51] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 17:15:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 17:15:51] [INFO ] Invariant cache hit.
[2024-05-29 17:15:51] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:15:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:15:52] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:15:52] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:15:52] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:15:52] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:15:53] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:54] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:15:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:15:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:55] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:15:55] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:15:55] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/385 variables, 203/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:16:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/385 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 266 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11675 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/385 variables, 203/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 181/447 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:16:05] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:16:05] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:16:05] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:16:06] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
[2024-05-29 17:16:06] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:16:06] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 6/453 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:16:09] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:16:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:16:10] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:16:13] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 3 ms to minimize.
[2024-05-29 17:16:14] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:16:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:16:18] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:16:20] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 461 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25698 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 43/43 constraints]
After SMT, in 37389ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 37391ms
Starting structural reductions in LTL mode, iteration 1 : 203/228 places, 182/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37643 ms. Remains : 203/228 places, 182/207 transitions.
[2024-05-29 17:16:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:16:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:16:28] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-29 17:16:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:16:28] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:16:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7392738725734553719.gal : 1 ms
[2024-05-29 17:16:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality12605268841795286917.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/CTLCardinality7392738725734553719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12605268841795286917.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,3.99641e+19,7.39535,230428,2,11923,5,722977,6,0,996,1.60197e+06,0


Converting to forward existential form...Done !
original formula: EG(EX((AX(((E((p68==0) U (p214==1)) + (p173==1)) + (p18==1))) + AF((p213==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX((!(EX(!(((E((p68==0) U (p214==1)) + (p173==1)) + (p18==1))))) + !(EG(!((p213==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...444
Detected timeout of ITS tools.
[2024-05-29 17:16:59] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:16:59] [INFO ] Applying decomposition
[2024-05-29 17:16:59] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15817198557615453052.txt' '-o' '/tmp/graph15817198557615453052.bin' '-w' '/tmp/graph15817198557615453052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15817198557615453052.bin' '-l' '-1' '-v' '-w' '/tmp/graph15817198557615453052.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:16:59] [INFO ] Decomposing Gal with order
[2024-05-29 17:16:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:16:59] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-29 17:16:59] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:16:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality2946077436004397067.gal : 4 ms
[2024-05-29 17:16:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality8447990128554438146.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/CTLCardinality2946077436004397067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8447990128554438146.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.99641e+19,0.577736,22748,1103,54,38219,477,458,72122,61,1144,0


Converting to forward existential form...Done !
original formula: EG(EX((AX(((E((i4.u21.p68==0) U (i12.u68.p214==1)) + (i11.i0.u55.p173==1)) + (i1.i1.u6.p18==1))) + AF((i10.u65.p213==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX((!(EX(!(((E((i4.u21.p68==0) U (i12.u68.p214==1)) + (i11.i0.u55.p173==1)) + (i1.i1.u6.p18==1))))) +...196
Reverse transition relation is NOT exact ! Due to transitions t49, t89, t92, t136, t139, t165, t181, i0.i0.u1.t146, i0.i1.u8.t141, i1.t142, i1.i0.u5.t145, ...756
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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 227 transition count 149
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 116 place count 170 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 169 transition count 147
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 117 place count 169 transition count 132
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 147 place count 154 transition count 132
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 163 place count 138 transition count 116
Iterating global reduction 3 with 16 rules applied. Total rules applied 179 place count 138 transition count 116
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 179 place count 138 transition count 110
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 132 transition count 110
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 279 place count 88 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 281 place count 86 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 282 place count 85 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 282 place count 85 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 286 place count 83 transition count 62
Applied a total of 286 rules in 37 ms. Remains 83 /228 variables (removed 145) and now considering 62/207 (removed 145) transitions.
// Phase 1: matrix 62 rows 83 cols
[2024-05-29 17:17:29] [INFO ] Computed 33 invariants in 0 ms
[2024-05-29 17:17:29] [INFO ] Implicit Places using invariants in 49 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/228 places, 62/207 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 60
Applied a total of 4 rules in 4 ms. Remains 79 /81 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 79 cols
[2024-05-29 17:17:29] [INFO ] Computed 31 invariants in 2 ms
[2024-05-29 17:17:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 17:17:29] [INFO ] Invariant cache hit.
[2024-05-29 17:17:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 79/228 places, 60/207 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 201 ms. Remains : 79/228 places, 60/207 transitions.
[2024-05-29 17:17:29] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:17:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:17:29] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-29 17:17:29] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:17:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:17:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14609665866223387669.gal : 1 ms
[2024-05-29 17:17:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality18206263518480983452.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/CTLCardinality14609665866223387669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18206263518480983452.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,7.08588e+11,0.138323,10496,2,140,5,30062,6,0,379,47378,0


Converting to forward existential form...Done !
original formula: EG(AF((p93==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p93==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 58/0/2
(forward)formula 0,1,25.8414,774832,1,0,374,2.86077e+06,24,369,1838,6.78954e+06,373
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 227 transition count 156
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 177 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 176 transition count 155
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 102 place count 176 transition count 140
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 132 place count 161 transition count 140
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 144 place count 149 transition count 128
Iterating global reduction 3 with 12 rules applied. Total rules applied 156 place count 149 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 158 place count 149 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 148 transition count 126
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 159 place count 148 transition count 123
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 165 place count 145 transition count 123
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 257 place count 99 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 97 transition count 75
Applied a total of 259 rules in 20 ms. Remains 97 /228 variables (removed 131) and now considering 75/207 (removed 132) transitions.
// Phase 1: matrix 75 rows 97 cols
[2024-05-29 17:17:55] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 17:17:55] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 17:17:55] [INFO ] Invariant cache hit.
[2024-05-29 17:17:55] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-29 17:17:55] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-29 17:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 4/97 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/172 variables, 97/131 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/172 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 131 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 4/97 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/172 variables, 97/131 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 71/202 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 202 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2306ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2306ms
Starting structural reductions in SI_CTL mode, iteration 1 : 97/228 places, 75/207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2522 ms. Remains : 97/228 places, 75/207 transitions.
[2024-05-29 17:17:57] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:17:57] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:17:57] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-29 17:17:57] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:17:57] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:17:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality5407121384612584292.gal : 1 ms
[2024-05-29 17:17:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality9343774142035579177.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/CTLCardinality5407121384612584292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9343774142035579177.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.75688e+13,1.0592,38612,2,443,5,136354,6,0,465,255257,0


Converting to forward existential form...Done !
original formula: AG((AF(!(A(((p151==0)||(p68==1)) U ((p68==0)||(p133==1))))) * (((p201==0)||(p71==0))||(((p73==0)&&(p140==1))||(((p129==1)&&(p80==0))&&(p1...166
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(!(!((E(!(((p68==0)||(p133==1))) U (!(((p151==0)||(p68==1))) * !(((p68==0)||(p133==1))))...322
(forward)formula 0,0,1.0618,38612,1,0,8,136354,9,2,505,255257,1
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 217 transition count 196
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 217 transition count 196
Applied a total of 22 rules in 3 ms. Remains 217 /228 variables (removed 11) and now considering 196/207 (removed 11) transitions.
// Phase 1: matrix 196 rows 217 cols
[2024-05-29 17:17:59] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:17:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 17:17:59] [INFO ] Invariant cache hit.
[2024-05-29 17:17:59] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-29 17:17:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:00] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:18:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:18:00] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:18:00] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:18:00] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:18:00] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:18:00] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:01] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 5 ms to minimize.
[2024-05-29 17:18:02] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
[2024-05-29 17:18:02] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:18:02] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:18:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:18:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:18:02] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:18:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:03] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:18:04] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:04] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:05] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:18:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 196/413 variables, 217/285 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:18:09] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:18:10] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:18:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:18:10] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:18:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:14] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:18:14] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/413 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (OVERLAPS) 0/413 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 294 constraints, problems are : Problem set: 0 solved, 195 unsolved in 18968 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 43/77 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/413 variables, 217/294 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 195/489 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:20] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 9 ms to minimize.
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-29 17:18:21] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 7/496 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:24] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-29 17:18:24] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 5/501 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:29] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:31] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-29 17:18:32] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:18:32] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:35] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-29 17:18:42] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:18:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/413 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/413 variables, and 508 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 62/62 constraints]
After SMT, in 49030ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 49032ms
Starting structural reductions in LTL mode, iteration 1 : 217/228 places, 196/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49211 ms. Remains : 217/228 places, 196/207 transitions.
[2024-05-29 17:18:48] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:18:48] [INFO ] Flatten gal took : 22 ms
[2024-05-29 17:18:48] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-29 17:18:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:18:48] [INFO ] Flatten gal took : 28 ms
[2024-05-29 17:18:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality3230248314750705216.gal : 2 ms
[2024-05-29 17:18:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality70236355188729623.ctl : 3 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/CTLCardinality3230248314750705216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality70236355188729623.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28272e+20,26.3349,609172,2,20071,5,1.89857e+06,6,0,1066,4.25886e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 17:19:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:19:18] [INFO ] Applying decomposition
[2024-05-29 17:19:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5627595027979983834.txt' '-o' '/tmp/graph5627595027979983834.bin' '-w' '/tmp/graph5627595027979983834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5627595027979983834.bin' '-l' '-1' '-v' '-w' '/tmp/graph5627595027979983834.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:19:18] [INFO ] Decomposing Gal with order
[2024-05-29 17:19:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:19:18] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-29 17:19:18] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:19:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:19:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality14784635645342631782.gal : 3 ms
[2024-05-29 17:19:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality6712688696617833160.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/CTLCardinality14784635645342631782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6712688696617833160.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28272e+20,3.52589,97308,1493,39,163377,274,502,422202,58,709,0


Converting to forward existential form...Done !
original formula: A((((!(EX(((i14.u72.p217==0)||(i15.u78.p228==1)))) + (i15.u76.p226==0)) + ((i15.u79.p229==1)||(!(((i12.u63.p195==0)||(i2.i0.u0.p1==1))||(...1057
=> equivalent forward existential formula: [((Init * !(EG(!(((i10.i0.u56.p170==1) + (((!(EX(!((((i12.u66.p202==0)||(i13.u67.p206==1))&&(i10.i2.u60.p183==1)...2506
Reverse transition relation is NOT exact ! Due to transitions t52, t102, t108, t150, t153, t179, t184, t195, i0.t143, i0.u14.t147, i1.t156, i1.i0.u6.t159, ...877
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 204 transition count 183
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 202 transition count 181
Applied a total of 52 rules in 12 ms. Remains 202 /228 variables (removed 26) and now considering 181/207 (removed 26) transitions.
// Phase 1: matrix 181 rows 202 cols
[2024-05-29 17:19:48] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 17:19:48] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 17:19:48] [INFO ] Invariant cache hit.
[2024-05-29 17:19:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-29 17:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:19:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:19:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:19:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:19:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:19:51] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:19:52] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:19:53] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:19:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:19:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/383 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:19:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/383 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 261 constraints, problems are : Problem set: 0 solved, 180 unsolved in 14153 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:05] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 10/452 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:09] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 454 constraints, problems are : Problem set: 0 solved, 180 unsolved in 15570 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 38/38 constraints]
After SMT, in 29737ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 29739ms
Starting structural reductions in LTL mode, iteration 1 : 202/228 places, 181/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29944 ms. Remains : 202/228 places, 181/207 transitions.
[2024-05-29 17:20:18] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:20:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:20:18] [INFO ] Input system was already deterministic with 181 transitions.
[2024-05-29 17:20:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:20:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:20:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality7218676937465409376.gal : 2 ms
[2024-05-29 17:20:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17552992571600604000.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/CTLCardinality7218676937465409376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17552992571600604000.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,3.52767e+19,7.30156,206700,2,10932,5,648203,6,0,991,1.41692e+06,0


Converting to forward existential form...Done !
original formula: EX(AF(((p141==0)&&(p96==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((p141==0)&&(p96==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...432
Detected timeout of ITS tools.
[2024-05-29 17:20:48] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:20:48] [INFO ] Applying decomposition
[2024-05-29 17:20:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2037136245112225547.txt' '-o' '/tmp/graph2037136245112225547.bin' '-w' '/tmp/graph2037136245112225547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2037136245112225547.bin' '-l' '-1' '-v' '-w' '/tmp/graph2037136245112225547.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:20:48] [INFO ] Decomposing Gal with order
[2024-05-29 17:20:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:20:48] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-29 17:20:48] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:20:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10700044058731578367.gal : 3 ms
[2024-05-29 17:20:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13112070469529361924.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/CTLCardinality10700044058731578367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13112070469529361924.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,3.52767e+19,1.14392,35144,1028,29,59126,345,407,126888,45,812,0


Converting to forward existential form...Done !
original formula: EX(AF(((i8.u44.p141==0)&&(i7.i1.u32.p96==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((i8.u44.p141==0)&&(i7.i1.u32.p96==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t89, t92, t135, t138, t164, t173, i0.t178, i0.i1.u11.t137, i0.i2.t106, i0.i2.u23.t1...720
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 227 transition count 152
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 173 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 172 transition count 150
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 111 place count 172 transition count 133
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 145 place count 155 transition count 133
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 160 place count 140 transition count 118
Iterating global reduction 3 with 15 rules applied. Total rules applied 175 place count 140 transition count 118
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 175 place count 140 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 185 place count 135 transition count 113
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 269 place count 93 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 91 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 90 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 272 place count 90 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 276 place count 88 transition count 67
Applied a total of 276 rules in 30 ms. Remains 88 /228 variables (removed 140) and now considering 67/207 (removed 140) transitions.
// Phase 1: matrix 67 rows 88 cols
[2024-05-29 17:21:18] [INFO ] Computed 33 invariants in 0 ms
[2024-05-29 17:21:18] [INFO ] Implicit Places using invariants in 53 ms returned [68, 72]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 86/228 places, 67/207 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 84 transition count 65
Applied a total of 4 rules in 3 ms. Remains 84 /86 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 84 cols
[2024-05-29 17:21:18] [INFO ] Computed 31 invariants in 0 ms
[2024-05-29 17:21:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 17:21:18] [INFO ] Invariant cache hit.
[2024-05-29 17:21:18] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 84/228 places, 65/207 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 267 ms. Remains : 84/228 places, 65/207 transitions.
[2024-05-29 17:21:18] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:21:18] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:21:18] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-29 17:21:18] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:21:18] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:21:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12182986142536031147.gal : 1 ms
[2024-05-29 17:21:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3093678799513708675.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/CTLCardinality12182986142536031147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3093678799513708675.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.51233e+12,0.610511,21092,2,283,5,67437,6,0,402,123686,0


Converting to forward existential form...Done !
original formula: E(AF(((p68==0)||(p151==1))) U AF(AG((((p108==0)||(p24==1))||(p99==1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((p68==0)||(p151==1)))))) * !(EG(!(!(E(TRUE U !((((p108==0)||(p24==1))||(p99==1)))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t17, t19, t21, t23, t27, t30, t32, t39, t45, t51, t64, Intersection with rea...231
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-29 17:21:49] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:21:49] [INFO ] Applying decomposition
[2024-05-29 17:21:49] [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/graph12616114893558464419.txt' '-o' '/tmp/graph12616114893558464419.bin' '-w' '/tmp/graph12616114893558464419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12616114893558464419.bin' '-l' '-1' '-v' '-w' '/tmp/graph12616114893558464419.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:21:49] [INFO ] Decomposing Gal with order
[2024-05-29 17:21:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:21:49] [INFO ] Removed a total of 7 redundant transitions.
[2024-05-29 17:21:49] [INFO ] Flatten gal took : 17 ms
[2024-05-29 17:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:21:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality8013996151298046349.gal : 1 ms
[2024-05-29 17:21:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality15134965068173556492.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/CTLCardinality8013996151298046349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15134965068173556492.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51233e+12,0.088171,7268,79,26,7323,172,216,16507,52,808,0


Converting to forward existential form...Done !
original formula: E(AF(((u7.p68==0)||(i11.u17.p151==1))) U AF(AG((((i11.u13.p108==0)||(i0.u3.p24==1))||(i5.u10.p99==1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((u7.p68==0)||(i11.u17.p151==1)))))) * !(EG(!(!(E(TRUE U !((((i11.u13.p108==0)||(i0.u3.p24==1...192
Reverse transition relation is NOT exact ! Due to transitions t45, t51, t64, u7.t23, u15.t30, i0.u3.t17, i1.u4.t1, i1.u8.t39, i2.u2.t0, i2.u6.t21, i5.u16.t...303
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
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 11
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 227 transition count 160
Reduce places removed 46 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 96 place count 181 transition count 156
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 177 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 177 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 132 place count 161 transition count 140
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 148 place count 145 transition count 124
Iterating global reduction 3 with 16 rules applied. Total rules applied 164 place count 145 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 166 place count 145 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 144 transition count 122
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 167 place count 144 transition count 117
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 177 place count 139 transition count 117
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 263 place count 96 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 94 transition count 72
Applied a total of 265 rules in 28 ms. Remains 94 /228 variables (removed 134) and now considering 72/207 (removed 135) transitions.
// Phase 1: matrix 72 rows 94 cols
[2024-05-29 17:22:19] [INFO ] Computed 34 invariants in 8 ms
[2024-05-29 17:22:19] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 17:22:19] [INFO ] Invariant cache hit.
[2024-05-29 17:22:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-29 17:22:19] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-29 17:22:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 3/94 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 17:22:19] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 17:22:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 72/166 variables, 94/130 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 130 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 3/94 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 72/166 variables, 94/130 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 69/199 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 17:22:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 200 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1589 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 3/3 constraints]
After SMT, in 3256ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3257ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/228 places, 72/207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3476 ms. Remains : 94/228 places, 72/207 transitions.
[2024-05-29 17:22:22] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:22:22] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:22:22] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-29 17:22:22] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:22] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality17038065820088883865.gal : 16 ms
[2024-05-29 17:22:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality5632121035150168149.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/CTLCardinality17038065820088883865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5632121035150168149.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,3.54294e+13,0.206066,12376,2,319,5,39537,6,0,450,60200,0


Converting to forward existential form...Done !
original formula: EF(((EG(E((p122==0) U (p42==1))) * (p201==1)) * (((p182==1)||(p169==0))||((((p224==0)&&(p110==1))&&((p114==0)&&(p191==0)))&&(p177==1)))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (((p182==1)||(p169==0))||((((p224==0)&&(p110==1))&&((p114==0)&&(p191==0)))&&(p177==1))...205
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t9, t26, t27, t28, t30, t32, t35, t38, t41, t49, t51, t53, t55, t...257
(forward)formula 0,1,3.16932,122848,1,0,404,555280,172,196,2630,1.13257e+06,376
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 227 transition count 155
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 104 place count 176 transition count 153
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 175 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 174 transition count 152
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 107 place count 174 transition count 137
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 137 place count 159 transition count 137
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 151 place count 145 transition count 123
Iterating global reduction 4 with 14 rules applied. Total rules applied 165 place count 145 transition count 123
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 165 place count 145 transition count 118
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 175 place count 140 transition count 118
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 261 place count 97 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 263 place count 95 transition count 73
Applied a total of 263 rules in 13 ms. Remains 95 /228 variables (removed 133) and now considering 73/207 (removed 134) transitions.
// Phase 1: matrix 73 rows 95 cols
[2024-05-29 17:22:25] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 17:22:26] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-29 17:22:26] [INFO ] Invariant cache hit.
[2024-05-29 17:22:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 17:22:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-29 17:22:26] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-29 17:22:26] [INFO ] Invariant cache hit.
[2024-05-29 17:22:26] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 4/95 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 17:22:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:22:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:22:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 73/168 variables, 95/132 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 134 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 4/95 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 73/168 variables, 95/132 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 69/203 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 17:22:28] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/168 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 204 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 4/4 constraints]
After SMT, in 2981ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2981ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/228 places, 73/207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3220 ms. Remains : 95/228 places, 73/207 transitions.
[2024-05-29 17:22:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:29] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-29 17:22:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality5831789444164691734.gal : 14 ms
[2024-05-29 17:22:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15152755530316766141.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/CTLCardinality5831789444164691734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15152755530316766141.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.5832e+13,0.39303,18976,2,311,5,63609,6,0,452,106606,0


Converting to forward existential form...Done !
original formula: (AG((p117==0)) + (EF(EG(((p202==0)&&(p144==1)))) * (A(AF((p172==0)) U !(((p105==0)||(p90==1)))) + EF(EG((p152==0))))))
=> equivalent forward existential formula: [(FwdU((Init * !((E(TRUE U EG(((p202==0)&&(p144==1)))) * (!((E(!(!(((p105==0)||(p90==1)))) U (!(!(EG(!((p172==0)...288
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t14, t15, t16, t40, Intersection with reachable at each step enabled. (destr...195
Detected timeout of ITS tools.
[2024-05-29 17:22:59] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:22:59] [INFO ] Applying decomposition
[2024-05-29 17:22:59] [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/graph7878143935743466553.txt' '-o' '/tmp/graph7878143935743466553.bin' '-w' '/tmp/graph7878143935743466553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7878143935743466553.bin' '-l' '-1' '-v' '-w' '/tmp/graph7878143935743466553.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:22:59] [INFO ] Decomposing Gal with order
[2024-05-29 17:22:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:22:59] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-29 17:22:59] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:22:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 17:22:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality9345813454830581683.gal : 1 ms
[2024-05-29 17:22:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality6916752606468184868.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/CTLCardinality9345813454830581683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6916752606468184868.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.5832e+13,0.07811,6532,71,31,6512,139,216,12737,52,618,0


Converting to forward existential form...Done !
original formula: (AG((i3.u14.p117==0)) + (EF(EG(((i7.u25.p202==0)&&(i5.u17.p144==1)))) * (A(AF((i7.u20.p172==0)) U !(((i3.u9.p105==0)||(i3.u10.p90==1)))) ...184
=> equivalent forward existential formula: [(FwdU((Init * !((E(TRUE U EG(((i7.u25.p202==0)&&(i5.u17.p144==1)))) * (!((E(!(!(((i3.u9.p105==0)||(i3.u10.p90==...362
Reverse transition relation is NOT exact ! Due to transitions t16, i3.t15, i3.u14.t14, i4.u15.t40, i7.u20.t8, i7.u22.t6, i7.u25.t7, i9.u18.t9, Intersectio...240
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 227 transition count 151
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 172 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 171 transition count 149
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 113 place count 171 transition count 134
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 143 place count 156 transition count 134
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 159 place count 140 transition count 118
Iterating global reduction 3 with 16 rules applied. Total rules applied 175 place count 140 transition count 118
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 175 place count 140 transition count 112
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 187 place count 134 transition count 112
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 267 place count 94 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 94 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 92 transition count 70
Applied a total of 270 rules in 37 ms. Remains 92 /228 variables (removed 136) and now considering 70/207 (removed 137) transitions.
// Phase 1: matrix 70 rows 92 cols
[2024-05-29 17:23:29] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 17:23:29] [INFO ] Implicit Places using invariants in 128 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/228 places, 70/207 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 91 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 68
Applied a total of 4 rules in 8 ms. Remains 89 /91 variables (removed 2) and now considering 68/70 (removed 2) transitions.
// Phase 1: matrix 68 rows 89 cols
[2024-05-29 17:23:29] [INFO ] Computed 33 invariants in 1 ms
[2024-05-29 17:23:29] [INFO ] Implicit Places using invariants in 131 ms returned [69, 73]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 87/228 places, 68/207 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 85 transition count 66
Applied a total of 4 rules in 2 ms. Remains 85 /87 variables (removed 2) and now considering 66/68 (removed 2) transitions.
// Phase 1: matrix 66 rows 85 cols
[2024-05-29 17:23:29] [INFO ] Computed 31 invariants in 0 ms
[2024-05-29 17:23:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 17:23:29] [INFO ] Invariant cache hit.
[2024-05-29 17:23:29] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 85/228 places, 66/207 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 463 ms. Remains : 85/228 places, 66/207 transitions.
[2024-05-29 17:23:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:23:29] [INFO ] Flatten gal took : 17 ms
[2024-05-29 17:23:29] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-29 17:23:29] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:23:29] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:23:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality10714192672190712584.gal : 13 ms
[2024-05-29 17:23:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12829809922691389125.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/CTLCardinality10714192672190712584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12829809922691389125.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.51166e+12,0.25365,14772,2,297,5,45083,6,0,407,77336,0


Converting to forward existential form...Done !
original formula: AF((EG((p31==1)) * E((((p163==0)||(p170==1))||((p26==0)||(p128==1))) U !(AF((p81==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((p31==1)) * E((((p163==0)||(p170==1))||((p26==0)||(p128==1))) U !(!(EG(!((p81==1)))))))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t21, t23, t24, t27, t30, t34, t38, t39, t42, t44, t46, t59, Intersec...244
Detected timeout of ITS tools.
[2024-05-29 17:23:59] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:23:59] [INFO ] Applying decomposition
[2024-05-29 17:23:59] [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/graph2570122431231678679.txt' '-o' '/tmp/graph2570122431231678679.bin' '-w' '/tmp/graph2570122431231678679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2570122431231678679.bin' '-l' '-1' '-v' '-w' '/tmp/graph2570122431231678679.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:23:59] [INFO ] Decomposing Gal with order
[2024-05-29 17:23:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:23:59] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 17:23:59] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:23:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-29 17:23:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality17604375017011772289.gal : 3 ms
[2024-05-29 17:23:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13924204641229640674.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/CTLCardinality17604375017011772289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13924204641229640674.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.51166e+12,0.10471,8092,96,26,9285,192,245,18332,50,964,0


Converting to forward existential form...Done !
original formula: AF((EG((i3.u5.p31==1)) * E((((i9.u18.p163==0)||(i8.u19.p170==1))||((i2.i0.u4.p26==0)||(i6.u15.p128==1))) U !(AF((i3.u9.p81==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((i3.u5.p31==1)) * E((((i9.u18.p163==0)||(i8.u19.p170==1))||((i2.i0.u4.p26==0)||(i6.u15.p128==1)...200
Reverse transition relation is NOT exact ! Due to transitions t46, t59, i0.u2.t0, i0.u7.t24, i1.u6.t23, i1.u12.t3, i2.i0.u3.t1, i2.i1.u8.t38, i3.u5.t21, i3...355
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 227 transition count 150
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 171 transition count 148
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 170 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 169 transition count 147
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 117 place count 169 transition count 132
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 147 place count 154 transition count 132
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 162 place count 139 transition count 117
Iterating global reduction 4 with 15 rules applied. Total rules applied 177 place count 139 transition count 117
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 177 place count 139 transition count 112
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 187 place count 134 transition count 112
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 275 place count 90 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 277 place count 88 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 278 place count 87 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 278 place count 87 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 282 place count 85 transition count 64
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 283 place count 84 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 6 with 2 rules applied. Total rules applied 285 place count 83 transition count 63
Applied a total of 285 rules in 22 ms. Remains 83 /228 variables (removed 145) and now considering 63/207 (removed 144) transitions.
// Phase 1: matrix 63 rows 83 cols
[2024-05-29 17:24:30] [INFO ] Computed 32 invariants in 1 ms
[2024-05-29 17:24:30] [INFO ] Implicit Places using invariants in 126 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/228 places, 63/207 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 62
Applied a total of 2 rules in 2 ms. Remains 81 /82 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 81 cols
[2024-05-29 17:24:30] [INFO ] Computed 31 invariants in 0 ms
[2024-05-29 17:24:30] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 17:24:30] [INFO ] Invariant cache hit.
[2024-05-29 17:24:30] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 81/228 places, 62/207 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 278 ms. Remains : 81/228 places, 62/207 transitions.
[2024-05-29 17:24:30] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:24:30] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:24:30] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-29 17:24:30] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:24:30] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:24:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7562585871763416085.gal : 15 ms
[2024-05-29 17:24:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality411555985647048116.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/CTLCardinality7562585871763416085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality411555985647048116.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.41718e+12,0.084999,6812,2,248,5,14059,6,0,389,20066,0


Converting to forward existential form...Done !
original formula: AG((AF(((p157==1) + AG((p176==1)))) + EG((p37==0))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG((p37==0)))),!(((p157==1) + !(E(TRUE U !((p176==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 60/0/2
(forward)formula 0,0,6.61841,232892,1,0,94,1.09528e+06,30,68,1971,1.67189e+06,73
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 206 transition count 185
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 204 transition count 183
Applied a total of 48 rules in 13 ms. Remains 204 /228 variables (removed 24) and now considering 183/207 (removed 24) transitions.
// Phase 1: matrix 183 rows 204 cols
[2024-05-29 17:24:36] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:24:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 17:24:37] [INFO ] Invariant cache hit.
[2024-05-29 17:24:37] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-29 17:24:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 5 ms to minimize.
[2024-05-29 17:24:41] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/387 variables, 204/270 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:43] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/387 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 0/387 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 273 constraints, problems are : Problem set: 0 solved, 182 unsolved in 14032 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 35/69 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/387 variables, 204/273 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 182/455 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:24:54] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:56] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:24:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:24:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 3/462 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:24:58] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:24:59] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:24:59] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 465 constraints, problems are : Problem set: 0 solved, 182 unsolved in 16575 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 45/45 constraints]
After SMT, in 30620ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 30624ms
Starting structural reductions in LTL mode, iteration 1 : 204/228 places, 183/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30883 ms. Remains : 204/228 places, 183/207 transitions.
[2024-05-29 17:25:07] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:25:07] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:25:07] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-29 17:25:07] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:25:07] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:25:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality13090274225565991924.gal : 1 ms
[2024-05-29 17:25:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17635017215447189190.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/CTLCardinality13090274225565991924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17635017215447189190.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,4.10332e+19,9.05551,259416,2,12639,5,791913,6,0,1001,1.80949e+06,0


Converting to forward existential form...Done !
original formula: EG(AF(((AX((p174==0)) * (p176==1)) * (((p83==0)||(p0==1))||((p48==1)||((p2==0)&&(p129==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(EX(!((p174==0)))) * (p176==1)) * (((p83==0)||(p0==1))||((p48==1)||((p2==0)&&(p129==1))))))...168
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...448
Detected timeout of ITS tools.
[2024-05-29 17:25:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:25:37] [INFO ] Applying decomposition
[2024-05-29 17:25:37] [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/graph7360831941853149298.txt' '-o' '/tmp/graph7360831941853149298.bin' '-w' '/tmp/graph7360831941853149298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7360831941853149298.bin' '-l' '-1' '-v' '-w' '/tmp/graph7360831941853149298.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:25:37] [INFO ] Decomposing Gal with order
[2024-05-29 17:25:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:25:37] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-29 17:25:37] [INFO ] Flatten gal took : 24 ms
[2024-05-29 17:25:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:25:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality6337732966024485928.gal : 2 ms
[2024-05-29 17:25:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality14871516267353712057.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/CTLCardinality6337732966024485928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14871516267353712057.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,4.10332e+19,1.36375,48088,1084,30,86072,364,450,180084,48,923,0


Converting to forward existential form...Done !
original formula: EG(AF(((AX((i13.i1.u55.p174==0)) * (i13.i1.u55.p176==1)) * (((i5.i0.u26.p83==0)||(i1.i0.u0.p0==1))||((i2.u15.p48==1)||((i1.i0.u0.p2==0)&&...180
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(EX(!((i13.i1.u55.p174==0)))) * (i13.i1.u55.p176==1)) * (((i5.i0.u26.p83==0)||(i1.i0.u0.p0=...235
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t90, t93, t137, t140, t166, t175, i0.t143, i0.i1.u5.t146, i0.i2.u6.t145, i0.i3.t121...763
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 207/207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 227 transition count 150
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 171 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 170 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 115 place count 170 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 145 place count 155 transition count 133
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 161 place count 139 transition count 117
Iterating global reduction 3 with 16 rules applied. Total rules applied 177 place count 139 transition count 117
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 177 place count 139 transition count 111
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 189 place count 133 transition count 111
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 277 place count 89 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 279 place count 87 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 86 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 280 place count 86 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 284 place count 84 transition count 63
Applied a total of 284 rules in 11 ms. Remains 84 /228 variables (removed 144) and now considering 63/207 (removed 144) transitions.
// Phase 1: matrix 63 rows 84 cols
[2024-05-29 17:26:08] [INFO ] Computed 33 invariants in 1 ms
[2024-05-29 17:26:08] [INFO ] Implicit Places using invariants in 50 ms returned [64, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/228 places, 63/207 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 80 transition count 61
Applied a total of 4 rules in 2 ms. Remains 80 /82 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 80 cols
[2024-05-29 17:26:08] [INFO ] Computed 31 invariants in 0 ms
[2024-05-29 17:26:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 17:26:08] [INFO ] Invariant cache hit.
[2024-05-29 17:26:08] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 80/228 places, 61/207 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 192 ms. Remains : 80/228 places, 61/207 transitions.
[2024-05-29 17:26:08] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:26:08] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:26:08] [INFO ] Input system was already deterministic with 61 transitions.
RANDOM walk for 510 steps (0 resets) in 5 ms. (85 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-003B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 17:26:08] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:26:08] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:26:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2946342985735878186.gal : 1 ms
[2024-05-29 17:26:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13311961872883640605.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/ReachabilityCardinality2946342985735878186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13311961872883640605.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 17:26:08] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:26:08] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:26:08] [INFO ] Applying decomposition
[2024-05-29 17:26: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/graph17648714334249297087.txt' '-o' '/tmp/graph17648714334249297087.bin' '-w' '/tmp/graph17648714334249297087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17648714334249297087.bin' '-l' '-1' '-v' '-w' '/tmp/graph17648714334249297087.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:26:08] [INFO ] Decomposing Gal with order
[2024-05-29 17:26:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:26:08] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-29 17:26:08] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:26:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality2794530296275997168.gal : 2 ms
[2024-05-29 17:26:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality3841235293187337218.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/CTLCardinality2794530296275997168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3841235293187337218.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 7 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.76416e+20,51.0446,911764,3885,57,1.4095e+06,415,525,3.31068e+06,60,1186,0


Converting to forward existential form...Done !
original formula: EG(EX((AX(((E((i2.u24.p68==0) U (i11.u79.p214==1)) + (i10.i0.u62.p173==1)) + (i0.i0.u6.p18==1))) + AF((i10.i1.u71.p213==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX((!(EX(!(((E((i2.u24.p68==0) U (i11.u79.p214==1)) + (i10.i0.u62.p173==1)) + (i0.i0.u6.p18==1))))) +...199
Reverse transition relation is NOT exact ! Due to transitions t60, t112, t115, t164, t167, t190, i0.i0.u6.t169, i0.i1.t149, i0.i1.t150, i0.i1.u19.t148, i0....1017
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 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
Detected timeout of ITS tools.
[2024-05-29 17:50:33] [INFO ] Applying decomposition
[2024-05-29 17:50:33] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:50:33] [INFO ] Decomposing Gal with order
[2024-05-29 17:50:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:50:33] [INFO ] Removed a total of 4 redundant transitions.
[2024-05-29 17:50:33] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:50:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-29 17:50:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9875742722692464040.gal : 4 ms
[2024-05-29 17:50:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality113761621623440231.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/CTLCardinality9875742722692464040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality113761621623440231.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 7 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.76416e+20,385.642,9342336,9676,300,1.79423e+07,715,310,7.49419e+07,116,5719,0


Converting to forward existential form...Done !
original formula: EG(EX((AX(((E((i0.i0.i1.i0.u23.p68==0) U (i1.i0.u65.p214==1)) + (i1.i0.i0.i0.i0.i0.i0.i1.u80.p173==1)) + (i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u...199
=> equivalent forward existential formula: [FwdG(Init,EX((!(EX(!(((E((i0.i0.i1.i0.u23.p68==0) U (i1.i0.u65.p214==1)) + (i1.i0.i0.i0.i0.i0.i0.i1.u80.p173==1...254
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t171, i0.i0.i1.u24.t122, i0.i0.i1.u24.t123, i0.i0.i1.u24.t127, i0.i0.i1.u24.t129, i0...1755
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

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="ShieldPPPt-PT-003B"
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 ShieldPPPt-PT-003B, 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-171683761400569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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