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.r136-tall-171631132500386.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 DiscoveryGPU-PT-07b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:42 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 DiscoveryGPU-PT-07b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-07b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716374488205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 10:41:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 10:41:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:41:29] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-22 10:41:29] [INFO ] Transformed 212 places.
[2024-05-22 10:41:29] [INFO ] Transformed 224 transitions.
[2024-05-22 10:41:29] [INFO ] Found NUPN structural information;
[2024-05-22 10:41:29] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 109 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 224
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 25 place count 187 transition count 213
Iterating global reduction 1 with 11 rules applied. Total rules applied 36 place count 187 transition count 213
Applied a total of 36 rules in 33 ms. Remains 187 /212 variables (removed 25) and now considering 213/224 (removed 11) transitions.
// Phase 1: matrix 213 rows 187 cols
[2024-05-22 10:41:29] [INFO ] Computed 2 invariants in 16 ms
[2024-05-22 10:41:29] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 10:41:29] [INFO ] Invariant cache hit.
[2024-05-22 10:41:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-22 10:41:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 213/400 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 10:41:33] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 28 ms to minimize.
[2024-05-22 10:41:33] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 4 ms to minimize.
[2024-05-22 10:41:33] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-22 10:41:33] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 128 places in 68 ms of which 1 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 128 places in 62 ms of which 2 ms to minimize.
[2024-05-22 10:41:34] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 18/207 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 10:41:36] [INFO ] Deduced a trap composed of 107 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 208 constraints, problems are : Problem set: 0 solved, 212 unsolved in 10992 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/400 variables, 187/208 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 212/420 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 420 constraints, problems are : Problem set: 0 solved, 212 unsolved in 9306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 19/19 constraints]
After SMT, in 20423ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 20444ms
Starting structural reductions in LTL mode, iteration 1 : 187/212 places, 213/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20880 ms. Remains : 187/212 places, 213/224 transitions.
Support contains 109 out of 187 places after structural reductions.
[2024-05-22 10:41:50] [INFO ] Flatten gal took : 40 ms
[2024-05-22 10:41:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 10:41:50] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 108 out of 187 places (down from 109) after GAL structural reductions.
RANDOM walk for 40000 steps (173 resets) in 1973 ms. (20 steps per ms) remains 8/85 properties
BEST_FIRST walk for 40003 steps (33 resets) in 359 ms. (111 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (28 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (35 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (35 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (34 resets) in 86 ms. (459 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 81 ms. (487 steps per ms) remains 4/6 properties
[2024-05-22 10:41:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 92/120 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 229/349 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp49 is UNSAT
At refinement iteration 7 (OVERLAPS) 48/397 variables, 41/186 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 9 (OVERLAPS) 3/400 variables, 3/189 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/400 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 189 constraints, problems are : Problem set: 3 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/100 variables, 19/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/340 variables, 117/138 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 1/139 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/396 variables, 47/186 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/400 variables, 4/190 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/400 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 190 constraints, problems are : Problem set: 3 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 111 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-22 10:41:52] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:41:52] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:41:52] [INFO ] Input system was already deterministic with 213 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 341 edges and 187 vertex of which 178 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 158 transition count 184
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 158 transition count 184
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 151 transition count 177
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 146 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 146 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 141 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 141 transition count 165
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 136 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 136 transition count 157
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 131 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 131 transition count 152
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 115 place count 128 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 118 place count 128 transition count 149
Applied a total of 118 rules in 34 ms. Remains 128 /187 variables (removed 59) and now considering 149/213 (removed 64) transitions.
// Phase 1: matrix 149 rows 128 cols
[2024-05-22 10:41:52] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 10:41:52] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 10:41:52] [INFO ] Invariant cache hit.
[2024-05-22 10:41:52] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-22 10:41:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/277 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:41:54] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 14/144 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/277 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 144 constraints, problems are : Problem set: 0 solved, 148 unsolved in 4596 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/277 variables, 128/144 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 148/292 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/277 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 292 constraints, problems are : Problem set: 0 solved, 148 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 14/14 constraints]
After SMT, in 9129ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 9131ms
Starting structural reductions in LTL mode, iteration 1 : 128/187 places, 149/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9382 ms. Remains : 128/187 places, 149/213 transitions.
[2024-05-22 10:42:01] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:42:01] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:42:01] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-22 10:42:01] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:42:01] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:42:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13807305011506355130.gal : 3 ms
[2024-05-22 10:42:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9564027796543790462.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/CTLFireability13807305011506355130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9564027796543790462.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.
Detected timeout of ITS tools.
[2024-05-22 10:42:31] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:42:31] [INFO ] Applying decomposition
[2024-05-22 10:42:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17281161810400108465.txt' '-o' '/tmp/graph17281161810400108465.bin' '-w' '/tmp/graph17281161810400108465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17281161810400108465.bin' '-l' '-1' '-v' '-w' '/tmp/graph17281161810400108465.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:42:31] [INFO ] Decomposing Gal with order
[2024-05-22 10:42:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:42:32] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 10:42:32] [INFO ] Flatten gal took : 39 ms
[2024-05-22 10:42:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-22 10:42:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3926269473818058314.gal : 5 ms
[2024-05-22 10:42:32] [INFO ] Time to serialize properties into /tmp/CTLFireability17096960841077216518.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/CTLFireability3926269473818058314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17096960841077216518.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Graph (complete) has 341 edges and 187 vertex of which 179 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 179 transition count 166
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 140 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 139 transition count 165
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 81 place count 139 transition count 151
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 109 place count 125 transition count 151
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 120 place count 114 transition count 140
Iterating global reduction 3 with 11 rules applied. Total rules applied 131 place count 114 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 131 place count 114 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 113 transition count 139
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 108 transition count 134
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 108 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 147 place count 104 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 104 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 101 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 101 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 98 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 98 transition count 121
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 197 place count 81 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 80 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 80 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 79 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 79 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 78 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 78 transition count 100
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 204 place count 78 transition count 100
Applied a total of 204 rules in 51 ms. Remains 78 /187 variables (removed 109) and now considering 100/213 (removed 113) transitions.
// Phase 1: matrix 100 rows 78 cols
[2024-05-22 10:43:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:43:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 10:43:02] [INFO ] Invariant cache hit.
[2024-05-22 10:43:02] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 10:43:02] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-22 10:43:02] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 10:43:02] [INFO ] Invariant cache hit.
[2024-05-22 10:43:02] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/178 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 91 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1875 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/178 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 99/190 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 190 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3543ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3544ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/187 places, 100/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3707 ms. Remains : 78/187 places, 100/213 transitions.
[2024-05-22 10:43:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:43:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:43:05] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-22 10:43:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:43:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:43:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7929514362283489243.gal : 2 ms
[2024-05-22 10:43:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12152220297142483887.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/CTLFireability7929514362283489243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12152220297142483887.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.49998e+08,0.248917,14420,2,3115,5,67173,6,0,405,46835,0


Converting to forward existential form...Done !
original formula: EF(((EG(((p162==1)&&(p203==1))) * EG(AG((((p108==1)&&(p203==1))&&((p43==1)&&((p160==1)||(p86==1))))))) * ((p196==1)||(p151==0))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * ((p196==1)||(p151==0))) * EG(((p162==1)&&(p203==1)))),!(E(TRUE U !((((p108==1)&&(p203=...209
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t10, t14, t16, t20, t22, t27, t29, t33, t36, t37, t41, t43, t44, t45, t67, t68, t...258
(forward)formula 0,0,4.23846,144968,1,0,326,896398,233,141,2669,817207,370
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 157 transition count 183
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 157 transition count 183
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 150 transition count 176
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 150 transition count 176
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 145 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 145 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 141 transition count 165
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 141 transition count 165
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 137 transition count 159
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 137 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 133 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 133 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 131 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 131 transition count 153
Applied a total of 112 rules in 15 ms. Remains 131 /187 variables (removed 56) and now considering 153/213 (removed 60) transitions.
// Phase 1: matrix 153 rows 131 cols
[2024-05-22 10:43:10] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:43:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 10:43:10] [INFO ] Invariant cache hit.
[2024-05-22 10:43:10] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-22 10:43:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 153/284 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-22 10:43:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 9 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:43:12] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 145 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/284 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 152/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/284 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 297 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4434 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 12/12 constraints]
After SMT, in 9057ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 9060ms
Starting structural reductions in LTL mode, iteration 1 : 131/187 places, 153/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9206 ms. Remains : 131/187 places, 153/213 transitions.
[2024-05-22 10:43:19] [INFO ] Flatten gal took : 14 ms
[2024-05-22 10:43:19] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:43:19] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-22 10:43:19] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:43:19] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11506253076394166238.gal : 3 ms
[2024-05-22 10:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9637006302371144121.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/CTLFireability11506253076394166238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9637006302371144121.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.
Detected timeout of ITS tools.
[2024-05-22 10:43:49] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:43:49] [INFO ] Applying decomposition
[2024-05-22 10:43:49] [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/graph5762006176403105585.txt' '-o' '/tmp/graph5762006176403105585.bin' '-w' '/tmp/graph5762006176403105585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5762006176403105585.bin' '-l' '-1' '-v' '-w' '/tmp/graph5762006176403105585.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:43:49] [INFO ] Decomposing Gal with order
[2024-05-22 10:43:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:43:49] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-22 10:43:49] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:43:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 10:43:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3856676380926067629.gal : 2 ms
[2024-05-22 10:43:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12062807966283322451.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/CTLFireability3856676380926067629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12062807966283322451.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Graph (complete) has 341 edges and 187 vertex of which 179 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 178 transition count 163
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 137 transition count 163
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 83 place count 137 transition count 150
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 109 place count 124 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 119 place count 114 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 129 place count 114 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 129 place count 114 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 112 transition count 138
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 108 transition count 134
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 108 transition count 134
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 104 transition count 129
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 104 transition count 129
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 100 transition count 122
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 100 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 97 transition count 119
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 97 transition count 119
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 199 place count 79 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 200 place count 78 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 78 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 202 place count 77 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 203 place count 77 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 204 place count 76 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 76 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 74 transition count 95
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 86 edges and 72 vertex of which 68 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 75 edges and 68 vertex of which 28 / 68 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 2 with 27 rules applied. Total rules applied 234 place count 54 transition count 67
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 39 rules applied. Total rules applied 273 place count 31 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 30 transition count 51
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 279 place count 25 transition count 41
Iterating global reduction 5 with 5 rules applied. Total rules applied 284 place count 25 transition count 41
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 289 place count 20 transition count 31
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 20 transition count 31
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 299 place count 15 transition count 21
Iterating global reduction 5 with 5 rules applied. Total rules applied 304 place count 15 transition count 21
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 309 place count 10 transition count 16
Iterating global reduction 5 with 5 rules applied. Total rules applied 314 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 315 place count 10 transition count 15
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 5 with 1 rules applied. Total rules applied 316 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 317 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 319 place count 7 transition count 12
Applied a total of 319 rules in 66 ms. Remains 7 /187 variables (removed 180) and now considering 12/213 (removed 201) transitions.
[2024-05-22 10:44:19] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2024-05-22 10:44:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:44:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 10:44:19] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-22 10:44:19] [INFO ] Invariant cache hit.
[2024-05-22 10:44:19] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-22 10:44:19] [INFO ] Redundant transitions in 1 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 10:44:19] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-22 10:44:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 63 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/187 places, 12/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 263 ms. Remains : 7/187 places, 12/213 transitions.
[2024-05-22 10:44:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:44:19] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:19] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-22 10:44:19] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:19] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11788585676079493419.gal : 1 ms
[2024-05-22 10:44:19] [INFO ] Time to serialize properties into /tmp/CTLFireability6165061817855892406.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/CTLFireability11788585676079493419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6165061817855892406.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,168,0.002288,3356,2,18,5,105,6,0,34,96,0


Converting to forward existential form...Done !
original formula: AG(AF((p93==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p93==0)))] = FALSE
Hit Full ! (commute/partial/dont) 10/0/2
(forward)formula 0,0,0.003347,3676,1,0,8,193,20,2,169,175,8
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 161 transition count 187
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 161 transition count 187
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 155 transition count 181
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 155 transition count 181
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 150 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 150 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 147 transition count 171
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 147 transition count 171
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 144 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 144 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 141 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 141 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 140 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 140 transition count 163
Applied a total of 94 rules in 30 ms. Remains 140 /187 variables (removed 47) and now considering 163/213 (removed 50) transitions.
// Phase 1: matrix 163 rows 140 cols
[2024-05-22 10:44:19] [INFO ] Computed 2 invariants in 10 ms
[2024-05-22 10:44:20] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 10:44:20] [INFO ] Invariant cache hit.
[2024-05-22 10:44:20] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-22 10:44:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 163/303 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:44:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 15/157 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 157 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/303 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 162/319 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 319 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 15/15 constraints]
After SMT, in 10699ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 10700ms
Starting structural reductions in LTL mode, iteration 1 : 140/187 places, 163/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10954 ms. Remains : 140/187 places, 163/213 transitions.
[2024-05-22 10:44:30] [INFO ] Flatten gal took : 14 ms
[2024-05-22 10:44:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:30] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-22 10:44:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11640499015093969894.gal : 1 ms
[2024-05-22 10:44:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8757133491505119774.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/CTLFireability11640499015093969894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8757133491505119774.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.
Detected timeout of ITS tools.
[2024-05-22 10:45:00] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:45:00] [INFO ] Applying decomposition
[2024-05-22 10:45:00] [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/graph17033186831773601871.txt' '-o' '/tmp/graph17033186831773601871.bin' '-w' '/tmp/graph17033186831773601871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17033186831773601871.bin' '-l' '-1' '-v' '-w' '/tmp/graph17033186831773601871.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:45:00] [INFO ] Decomposing Gal with order
[2024-05-22 10:45:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:45:01] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-22 10:45:01] [INFO ] Flatten gal took : 24 ms
[2024-05-22 10:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 10:45:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4659152543215536551.gal : 4 ms
[2024-05-22 10:45:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15319194947382520285.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/CTLFireability4659152543215536551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15319194947382520285.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Graph (complete) has 341 edges and 187 vertex of which 179 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 178 transition count 167
Reduce places removed 37 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 141 transition count 164
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 138 transition count 164
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 81 place count 138 transition count 152
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 105 place count 126 transition count 152
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 115 place count 116 transition count 142
Iterating global reduction 3 with 10 rules applied. Total rules applied 125 place count 116 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 125 place count 116 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 115 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 110 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 110 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 142 place count 105 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 147 place count 105 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 152 place count 100 transition count 121
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 100 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 96 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 96 transition count 117
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 201 place count 78 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 77 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 77 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 76 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 76 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 75 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 75 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 74 transition count 94
Applied a total of 208 rules in 50 ms. Remains 74 /187 variables (removed 113) and now considering 94/213 (removed 119) transitions.
// Phase 1: matrix 94 rows 74 cols
[2024-05-22 10:45:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:45:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 10:45:31] [INFO ] Invariant cache hit.
[2024-05-22 10:45:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 10:45:31] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-22 10:45:31] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 10:45:31] [INFO ] Invariant cache hit.
[2024-05-22 10:45:31] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 94/167 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 85 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 94/167 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 92/176 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 10:45:33] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-22 10:45:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-22 10:45:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-22 10:45:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:45:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/168 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 10:45:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:45:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 184 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints]
After SMT, in 4740ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4741ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/187 places, 94/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4904 ms. Remains : 74/187 places, 94/213 transitions.
[2024-05-22 10:45:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:45:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:45:36] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-22 10:45:36] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:36] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7710036471028897588.gal : 2 ms
[2024-05-22 10:45:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1755021996139964771.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/CTLFireability7710036471028897588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1755021996139964771.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22324e+08,0.157678,10612,2,1756,5,43112,6,0,376,28435,0


Converting to forward existential form...Done !
original formula: E((p107!=1) U A(A(AG((p161!=1)) U AF(AG((p106==1)))) U (!(AF((p197!=1))) * A(EF(((p60==1)&&(p203==1))) U EF(((p60==1)&&(p203==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,(p107!=1)) * !(EG(!((!(!(EG(!((p197!=1))))) * !((E(!(E(TRUE U ((p60==1)&&(p203==1)))) U (!(E(TRUE U...840
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t9, t10, t14, t16, t21, t25, t27, t32, t34, t38, t40, t57, t60, t93, Intersection wi...237
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,13.69,381528,1,0,959,2.44424e+06,228,586,2592,2.4025e+06,986
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 159 transition count 185
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 159 transition count 185
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 152 transition count 178
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 146 transition count 172
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 146 transition count 172
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 140 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 140 transition count 164
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 134 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 134 transition count 154
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 129 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 129 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 125 transition count 145
Applied a total of 124 rules in 13 ms. Remains 125 /187 variables (removed 62) and now considering 145/213 (removed 68) transitions.
// Phase 1: matrix 145 rows 125 cols
[2024-05-22 10:45:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:45:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 10:45:49] [INFO ] Invariant cache hit.
[2024-05-22 10:45:49] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 10:45:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/270 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:45:51] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:45:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:45:52] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:45:52] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:45:52] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:45:52] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 16/143 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 143 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4438 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/270 variables, 125/143 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 144/287 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/270 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 287 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 16/16 constraints]
After SMT, in 8938ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 8939ms
Starting structural reductions in LTL mode, iteration 1 : 125/187 places, 145/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9095 ms. Remains : 125/187 places, 145/213 transitions.
[2024-05-22 10:45:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:45:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:45:58] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 10:45:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:45:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:45:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15685043683873409337.gal : 1 ms
[2024-05-22 10:45:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11388680574273513559.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/CTLFireability15685043683873409337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11388680574273513559.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.
Detected timeout of ITS tools.
[2024-05-22 10:46:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:46:29] [INFO ] Applying decomposition
[2024-05-22 10:46:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9553815367345897238.txt' '-o' '/tmp/graph9553815367345897238.bin' '-w' '/tmp/graph9553815367345897238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9553815367345897238.bin' '-l' '-1' '-v' '-w' '/tmp/graph9553815367345897238.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:46:29] [INFO ] Decomposing Gal with order
[2024-05-22 10:46:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:46:29] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-22 10:46:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:46:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2024-05-22 10:46:29] [INFO ] Time to serialize gal into /tmp/CTLFireability570474549256966906.gal : 1 ms
[2024-05-22 10:46:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2440236985411501103.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/CTLFireability570474549256966906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2440236985411501103.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Graph (complete) has 341 edges and 187 vertex of which 178 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 177 transition count 167
Reduce places removed 36 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 141 transition count 164
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 138 transition count 164
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 79 place count 138 transition count 151
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 105 place count 125 transition count 151
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 116 place count 114 transition count 140
Iterating global reduction 3 with 11 rules applied. Total rules applied 127 place count 114 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 127 place count 114 transition count 138
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 112 transition count 138
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 136 place count 107 transition count 133
Iterating global reduction 3 with 5 rules applied. Total rules applied 141 place count 107 transition count 133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 146 place count 102 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 151 place count 102 transition count 127
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 97 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 97 transition count 118
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 165 place count 93 transition count 114
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 93 transition count 114
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 201 place count 77 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 76 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 76 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 75 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 75 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 74 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 74 transition count 94
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 208 place count 74 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 210 place count 72 transition count 92
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 84 edges and 70 vertex of which 66 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 61 edges and 66 vertex of which 22 / 66 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 21 rules applied. Total rules applied 231 place count 55 transition count 70
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 31 rules applied. Total rules applied 262 place count 38 transition count 56
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 265 place count 35 transition count 56
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 270 place count 30 transition count 46
Iterating global reduction 6 with 5 rules applied. Total rules applied 275 place count 30 transition count 46
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 279 place count 26 transition count 38
Iterating global reduction 6 with 4 rules applied. Total rules applied 283 place count 26 transition count 38
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 286 place count 23 transition count 32
Iterating global reduction 6 with 3 rules applied. Total rules applied 289 place count 23 transition count 32
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 291 place count 21 transition count 30
Iterating global reduction 6 with 2 rules applied. Total rules applied 293 place count 21 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 295 place count 21 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 297 place count 20 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 301 place count 16 transition count 23
Applied a total of 301 rules in 38 ms. Remains 16 /187 variables (removed 171) and now considering 23/213 (removed 190) transitions.
[2024-05-22 10:46:59] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
// Phase 1: matrix 20 rows 16 cols
[2024-05-22 10:46:59] [INFO ] Computed 0 invariants in 14 ms
[2024-05-22 10:46:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 10:46:59] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
[2024-05-22 10:46:59] [INFO ] Invariant cache hit.
[2024-05-22 10:46:59] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-22 10:46:59] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-22 10:46:59] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
[2024-05-22 10:46:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 5/35 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/36 variables, and 16 constraints, problems are : Problem set: 0 solved, 16 unsolved in 88 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/36 variables, and 32 constraints, problems are : Problem set: 0 solved, 16 unsolved in 80 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 172ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/187 places, 23/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 275 ms. Remains : 16/187 places, 23/213 transitions.
[2024-05-22 10:46:59] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:46:59] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:46:59] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-22 10:46:59] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:46:59] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:46:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2206199212980599235.gal : 1 ms
[2024-05-22 10:46:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6780835091659000892.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/CTLFireability2206199212980599235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6780835091659000892.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,4902,0.004209,3420,2,80,5,390,6,0,81,348,0


Converting to forward existential form...Done !
original formula: E(!(((p107==1) * (!(((p29!=1) * EF((p153==1)))) + !(E((p30==1) U (p194==1)))))) U (p111==1))
=> equivalent forward existential formula: [(FwdU(Init,!(((p107==1) * (!(((p29!=1) * E(TRUE U (p153==1)))) + !(E((p30==1) U (p194==1))))))) * (p111==1))] !...162
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t8, t19, t21, t22, Intersection with reachable at each step enabled. (destroyed/...190
(forward)formula 0,1,0.036148,5060,1,0,105,7617,75,82,443,12895,142
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 158 transition count 184
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 158 transition count 184
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 151 transition count 177
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 151 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 147 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 147 transition count 173
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 143 transition count 168
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 143 transition count 168
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 139 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 139 transition count 161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 135 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 135 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 132 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 132 transition count 154
Applied a total of 110 rules in 10 ms. Remains 132 /187 variables (removed 55) and now considering 154/213 (removed 59) transitions.
// Phase 1: matrix 154 rows 132 cols
[2024-05-22 10:46:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:46:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 10:46:59] [INFO ] Invariant cache hit.
[2024-05-22 10:46:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-05-22 10:46:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/286 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:47:01] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 148 constraints, problems are : Problem set: 0 solved, 153 unsolved in 4706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/286 variables, 132/148 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 153/301 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 301 constraints, problems are : Problem set: 0 solved, 153 unsolved in 4676 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 14/14 constraints]
After SMT, in 9415ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 9417ms
Starting structural reductions in LTL mode, iteration 1 : 132/187 places, 154/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9547 ms. Remains : 132/187 places, 154/213 transitions.
[2024-05-22 10:47:09] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:47:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:47:09] [INFO ] Input system was already deterministic with 154 transitions.
[2024-05-22 10:47:09] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:47:09] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:47:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9562067835408251976.gal : 4 ms
[2024-05-22 10:47:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6323932009749021947.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/CTLFireability9562067835408251976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6323932009749021947.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.
Detected timeout of ITS tools.
[2024-05-22 10:47:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:47:39] [INFO ] Applying decomposition
[2024-05-22 10:47:39] [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/graph17841711614505555272.txt' '-o' '/tmp/graph17841711614505555272.bin' '-w' '/tmp/graph17841711614505555272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17841711614505555272.bin' '-l' '-1' '-v' '-w' '/tmp/graph17841711614505555272.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:47:39] [INFO ] Decomposing Gal with order
[2024-05-22 10:47:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:47:39] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-22 10:47:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:47:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2024-05-22 10:47:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7145197067513993132.gal : 2 ms
[2024-05-22 10:47:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3296763696543885552.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/CTLFireability7145197067513993132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3296763696543885552.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Graph (complete) has 341 edges and 187 vertex of which 178 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 177 transition count 168
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 142 transition count 168
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 71 place count 142 transition count 152
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 103 place count 126 transition count 152
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 114 place count 115 transition count 141
Iterating global reduction 2 with 11 rules applied. Total rules applied 125 place count 115 transition count 141
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 110 transition count 136
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 110 transition count 136
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 140 place count 105 transition count 130
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 105 transition count 130
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 101 transition count 122
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 101 transition count 122
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 157 place count 97 transition count 118
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 97 transition count 118
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 189 place count 83 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 190 place count 82 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 82 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 192 place count 81 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 81 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 194 place count 80 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 195 place count 80 transition count 100
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 196 place count 80 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 79 transition count 99
Applied a total of 197 rules in 19 ms. Remains 79 /187 variables (removed 108) and now considering 99/213 (removed 114) transitions.
// Phase 1: matrix 99 rows 79 cols
[2024-05-22 10:48:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:48:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 10:48:09] [INFO ] Invariant cache hit.
[2024-05-22 10:48:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 10:48:09] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-22 10:48:09] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-22 10:48:09] [INFO ] Invariant cache hit.
[2024-05-22 10:48:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 2/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 99/177 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/178 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 82 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1696 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 2/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 99/177 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 96/177 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/178 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 178 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4040ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4041ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/187 places, 99/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4166 ms. Remains : 79/187 places, 99/213 transitions.
[2024-05-22 10:48:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:48:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:48:13] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-22 10:48:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:48:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:48:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17699775855884224623.gal : 1 ms
[2024-05-22 10:48:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5799502286407179683.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/CTLFireability17699775855884224623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5799502286407179683.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.51453e+08,0.696436,28264,2,4817,5,119796,6,0,410,135267,0


Converting to forward existential form...Done !
original formula: A(E(EG((((p74==1)&&(p203==1))&&((p48==1)&&((p200==1)||((p17==1)&&(p210==1)))))) U !(AF(EG((p110==1))))) U (p2==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p2==1))))) * !(E(!((p2==1)) U (!(E(EG((((p74==1)&&(p203==1))&&((p48==1)&&((p200==1)||((p17==1)...229
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t5, t6, t7, t9, t11, t12, t13, t15, t17, t18, t19, t22, t24, t25, t27, t29, t30, t32,...314
Detected timeout of ITS tools.
[2024-05-22 10:48:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:48:43] [INFO ] Applying decomposition
[2024-05-22 10:48:43] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph823392487936812284.txt' '-o' '/tmp/graph823392487936812284.bin' '-w' '/tmp/graph823392487936812284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph823392487936812284.bin' '-l' '-1' '-v' '-w' '/tmp/graph823392487936812284.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:48:43] [INFO ] Decomposing Gal with order
[2024-05-22 10:48:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:48:43] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 10:48:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:48:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 1 ms.
[2024-05-22 10:48:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2038960992765712997.gal : 2 ms
[2024-05-22 10:48:43] [INFO ] Time to serialize properties into /tmp/CTLFireability1703630230226812890.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/CTLFireability2038960992765712997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1703630230226812890.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,4.51453e+08,1.78146,72588,1316,129,72614,669,266,674266,55,3427,0


Converting to forward existential form...Done !
original formula: A(E(EG((((i7.u9.p74==1)&&(u24.p203==1))&&((i4.u6.p48==1)&&((u24.p200==1)||((i2.u2.p17==1)&&(i1.u25.p210==1)))))) U !(AF(EG((i8.u14.p110==...178
=> equivalent forward existential formula: [((Init * !(EG(!((i0.u0.p2==1))))) * !(E(!((i0.u0.p2==1)) U (!(E(EG((((i7.u9.p74==1)&&(u24.p203==1))&&((i4.u6.p4...287
Reverse transition relation is NOT exact ! Due to transitions t37, t52, t54, t80, u8.t39, u24.t0, u24.t86, i0.u22.t3, i0.u23.t7, i2.u3.t47, i3.u4.t41, i3.u...479
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 a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Graph (complete) has 341 edges and 187 vertex of which 178 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 177 transition count 165
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 139 transition count 165
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 77 place count 139 transition count 150
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 107 place count 124 transition count 150
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 118 place count 113 transition count 139
Iterating global reduction 2 with 11 rules applied. Total rules applied 129 place count 113 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 129 place count 113 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 112 transition count 138
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 136 place count 107 transition count 133
Iterating global reduction 2 with 5 rules applied. Total rules applied 141 place count 107 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 146 place count 102 transition count 127
Iterating global reduction 2 with 5 rules applied. Total rules applied 151 place count 102 transition count 127
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 156 place count 97 transition count 118
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 97 transition count 118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 165 place count 93 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 93 transition count 114
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 203 place count 76 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 204 place count 75 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 75 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 206 place count 74 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 74 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 73 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 73 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 71 transition count 91
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 102 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 71 edges and 69 vertex of which 28 / 69 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 10 rules applied. Total rules applied 221 place count 55 transition count 83
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 242 place count 48 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 242 place count 48 transition count 62
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 256 place count 41 transition count 62
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 262 place count 35 transition count 50
Iterating global reduction 4 with 6 rules applied. Total rules applied 268 place count 35 transition count 50
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 274 place count 29 transition count 38
Iterating global reduction 4 with 6 rules applied. Total rules applied 280 place count 29 transition count 38
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 285 place count 24 transition count 33
Iterating global reduction 4 with 5 rules applied. Total rules applied 290 place count 24 transition count 33
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 295 place count 19 transition count 23
Iterating global reduction 4 with 5 rules applied. Total rules applied 300 place count 19 transition count 23
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 305 place count 14 transition count 18
Iterating global reduction 4 with 5 rules applied. Total rules applied 310 place count 14 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 12 transition count 16
Applied a total of 312 rules in 20 ms. Remains 12 /187 variables (removed 175) and now considering 16/213 (removed 197) transitions.
[2024-05-22 10:49:13] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2024-05-22 10:49:13] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:49:13] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 10:49:13] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 10:49:13] [INFO ] Invariant cache hit.
[2024-05-22 10:49:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-22 10:49:13] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-22 10:49:13] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 10:49:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 13/23 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/25 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 13 constraints, problems are : Problem set: 0 solved, 11 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 13/23 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/25 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 193ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/187 places, 16/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 268 ms. Remains : 12/187 places, 16/213 transitions.
[2024-05-22 10:49:13] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:49:13] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:49:13] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-22 10:49:13] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:49:13] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:49:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4257779500297131417.gal : 0 ms
[2024-05-22 10:49:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3092398056449039710.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/CTLFireability4257779500297131417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3092398056449039710.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,17144,0.012337,3724,2,74,5,2000,6,0,60,2135,0


Converting to forward existential form...Done !
original formula: EG(((p55==0)||(p210==0)))
=> equivalent forward existential formula: [FwdG(Init,((p55==0)||(p210==0)))] != FALSE
Hit Full ! (commute/partial/dont) 10/0/6
(forward)formula 0,1,0.022825,3988,1,0,9,2977,19,3,335,3455,8
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 164 transition count 190
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 164 transition count 190
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 158 transition count 184
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 158 transition count 184
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 153 transition count 179
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 153 transition count 179
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 148 transition count 173
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 148 transition count 173
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 145 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 145 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 143 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 143 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 142 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 142 transition count 165
Applied a total of 90 rules in 13 ms. Remains 142 /187 variables (removed 45) and now considering 165/213 (removed 48) transitions.
// Phase 1: matrix 165 rows 142 cols
[2024-05-22 10:49:13] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:49:13] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 10:49:13] [INFO ] Invariant cache hit.
[2024-05-22 10:49:14] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-22 10:49:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/307 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 10:49:15] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/307 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 158 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/307 variables, 142/158 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 164/322 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 322 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 14/14 constraints]
After SMT, in 10692ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 10693ms
Starting structural reductions in LTL mode, iteration 1 : 142/187 places, 165/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10854 ms. Remains : 142/187 places, 165/213 transitions.
[2024-05-22 10:49:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:49:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:49:24] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-22 10:49:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:49:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:49:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5948827298114638828.gal : 1 ms
[2024-05-22 10:49:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11461561585494609088.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/CTLFireability5948827298114638828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11461561585494609088.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.
Detected timeout of ITS tools.
[2024-05-22 10:49:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:49:54] [INFO ] Applying decomposition
[2024-05-22 10:49:54] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13853227606478119857.txt' '-o' '/tmp/graph13853227606478119857.bin' '-w' '/tmp/graph13853227606478119857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13853227606478119857.bin' '-l' '-1' '-v' '-w' '/tmp/graph13853227606478119857.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:49:54] [INFO ] Decomposing Gal with order
[2024-05-22 10:49:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:49:54] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-22 10:49:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:49:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2024-05-22 10:49:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9083927603478213145.gal : 1 ms
[2024-05-22 10:49:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10259279248005394299.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/CTLFireability9083927603478213145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10259279248005394299.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 157 transition count 183
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 157 transition count 183
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 149 transition count 175
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 149 transition count 175
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 143 transition count 169
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 143 transition count 169
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 138 transition count 163
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 138 transition count 163
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 133 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 133 transition count 154
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 128 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 128 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 124 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 124 transition count 145
Applied a total of 126 rules in 6 ms. Remains 124 /187 variables (removed 63) and now considering 145/213 (removed 68) transitions.
// Phase 1: matrix 145 rows 124 cols
[2024-05-22 10:50:24] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:50:24] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 10:50:24] [INFO ] Invariant cache hit.
[2024-05-22 10:50:25] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 10:50:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/269 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:50:27] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-22 10:50:27] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:50:27] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:50:27] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:50:27] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 16/142 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 142 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/269 variables, 124/142 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 144/286 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 286 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4428 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 16/16 constraints]
After SMT, in 8772ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 8774ms
Starting structural reductions in LTL mode, iteration 1 : 124/187 places, 145/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8921 ms. Remains : 124/187 places, 145/213 transitions.
[2024-05-22 10:50:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:50:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:50:33] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 10:50:33] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:50:33] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:50:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15774889489497427980.gal : 1 ms
[2024-05-22 10:50:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9559442097591121707.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/CTLFireability15774889489497427980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9559442097591121707.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.
Detected timeout of ITS tools.
[2024-05-22 10:51:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:51:03] [INFO ] Applying decomposition
[2024-05-22 10:51:03] [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/graph15642524245433534395.txt' '-o' '/tmp/graph15642524245433534395.bin' '-w' '/tmp/graph15642524245433534395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15642524245433534395.bin' '-l' '-1' '-v' '-w' '/tmp/graph15642524245433534395.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:51:03] [INFO ] Decomposing Gal with order
[2024-05-22 10:51:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:51:03] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-22 10:51:03] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:51:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:51:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10792544936987187440.gal : 1 ms
[2024-05-22 10:51:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12357024954666113022.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/CTLFireability10792544936987187440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12357024954666113022.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.20836e+10,16.4911,415268,5154,177,707354,9581,352,3.04934e+06,54,66695,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 160 transition count 186
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 160 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 153 transition count 179
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 153 transition count 179
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 148 transition count 174
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 148 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 144 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 144 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 140 transition count 162
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 140 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 136 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 136 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 133 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 133 transition count 155
Applied a total of 108 rules in 7 ms. Remains 133 /187 variables (removed 54) and now considering 155/213 (removed 58) transitions.
// Phase 1: matrix 155 rows 133 cols
[2024-05-22 10:51:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:51:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 10:51:34] [INFO ] Invariant cache hit.
[2024-05-22 10:51:34] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-22 10:51:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/288 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-22 10:51:35] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2024-05-22 10:51:35] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:51:35] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:51:35] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:51:36] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:51:36] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:51:36] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:51:36] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:51:36] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:51:36] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 145 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 155/288 variables, 133/145 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 154/299 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 299 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 10/10 constraints]
After SMT, in 8821ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 8823ms
Starting structural reductions in LTL mode, iteration 1 : 133/187 places, 155/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8953 ms. Remains : 133/187 places, 155/213 transitions.
[2024-05-22 10:51:42] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:51:42] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:51:42] [INFO ] Input system was already deterministic with 155 transitions.
[2024-05-22 10:51:42] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:51:42] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:51:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1900892008650695522.gal : 0 ms
[2024-05-22 10:51:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13813844325951711324.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/CTLFireability1900892008650695522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13813844325951711324.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.
Detected timeout of ITS tools.
[2024-05-22 10:52:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:52:13] [INFO ] Applying decomposition
[2024-05-22 10:52:13] [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/graph5136822021980763386.txt' '-o' '/tmp/graph5136822021980763386.bin' '-w' '/tmp/graph5136822021980763386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5136822021980763386.bin' '-l' '-1' '-v' '-w' '/tmp/graph5136822021980763386.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:52:13] [INFO ] Decomposing Gal with order
[2024-05-22 10:52:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:52:13] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 10:52:13] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:52:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-22 10:52:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8390457460821719170.gal : 2 ms
[2024-05-22 10:52:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3133349755619583240.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/CTLFireability8390457460821719170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3133349755619583240.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 160 transition count 186
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 160 transition count 186
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 154 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 154 transition count 180
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 149 transition count 175
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 149 transition count 175
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 144 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 144 transition count 168
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 140 transition count 162
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 140 transition count 162
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 137 transition count 159
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 137 transition count 159
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 135 transition count 157
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 135 transition count 157
Applied a total of 104 rules in 7 ms. Remains 135 /187 variables (removed 52) and now considering 157/213 (removed 56) transitions.
// Phase 1: matrix 157 rows 135 cols
[2024-05-22 10:52:43] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:52:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 10:52:43] [INFO ] Invariant cache hit.
[2024-05-22 10:52:43] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-22 10:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/292 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:52:45] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 15/152 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 152 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/292 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 156/308 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/292 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 310 constraints, problems are : Problem set: 0 solved, 156 unsolved in 7188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 17/17 constraints]
After SMT, in 12132ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 12134ms
Starting structural reductions in LTL mode, iteration 1 : 135/187 places, 157/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12328 ms. Remains : 135/187 places, 157/213 transitions.
[2024-05-22 10:52:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:52:55] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:52:55] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-22 10:52:55] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:52:55] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:52:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11652958559077933581.gal : 1 ms
[2024-05-22 10:52:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16028906265973667545.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/CTLFireability11652958559077933581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16028906265973667545.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.
Detected timeout of ITS tools.
[2024-05-22 10:53:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:25] [INFO ] Applying decomposition
[2024-05-22 10:53:25] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4170483171894340125.txt' '-o' '/tmp/graph4170483171894340125.bin' '-w' '/tmp/graph4170483171894340125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4170483171894340125.bin' '-l' '-1' '-v' '-w' '/tmp/graph4170483171894340125.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:53:25] [INFO ] Decomposing Gal with order
[2024-05-22 10:53:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:53:25] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-22 10:53:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:53:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:53:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10214571819089387975.gal : 13 ms
[2024-05-22 10:53:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3839275849371623881.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/CTLFireability10214571819089387975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3839275849371623881.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 213/213 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 160 transition count 186
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 160 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 153 transition count 179
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 153 transition count 179
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 147 transition count 173
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 147 transition count 173
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 141 transition count 165
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 141 transition count 165
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 137 transition count 159
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 137 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 133 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 133 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 131 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 131 transition count 153
Applied a total of 112 rules in 12 ms. Remains 131 /187 variables (removed 56) and now considering 153/213 (removed 60) transitions.
// Phase 1: matrix 153 rows 131 cols
[2024-05-22 10:53:55] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:53:55] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 10:53:55] [INFO ] Invariant cache hit.
[2024-05-22 10:53:55] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-22 10:53:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 153/284 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 148 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4842 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/284 variables, 131/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 152/300 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/284 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 300 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 15/15 constraints]
After SMT, in 9698ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 9700ms
Starting structural reductions in LTL mode, iteration 1 : 131/187 places, 153/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9839 ms. Remains : 131/187 places, 153/213 transitions.
[2024-05-22 10:54:05] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:54:05] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:54:05] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-22 10:54:05] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:54:05] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:54:05] [INFO ] Time to serialize gal into /tmp/CTLFireability18146215805892732191.gal : 16 ms
[2024-05-22 10:54:05] [INFO ] Time to serialize properties into /tmp/CTLFireability760825827905373618.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/CTLFireability18146215805892732191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability760825827905373618.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.
Detected timeout of ITS tools.
[2024-05-22 10:54:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:54:35] [INFO ] Applying decomposition
[2024-05-22 10:54:35] [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/graph9040639187321351437.txt' '-o' '/tmp/graph9040639187321351437.bin' '-w' '/tmp/graph9040639187321351437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9040639187321351437.bin' '-l' '-1' '-v' '-w' '/tmp/graph9040639187321351437.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:54:35] [INFO ] Decomposing Gal with order
[2024-05-22 10:54:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:54:35] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-22 10:54:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:54:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:54:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15737016626726826735.gal : 1 ms
[2024-05-22 10:54:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2104761233672822051.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/CTLFireability15737016626726826735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2104761233672822051.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.
Detected timeout of ITS tools.
[2024-05-22 10:55:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:05] [INFO ] Applying decomposition
[2024-05-22 10:55:05] [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/graph401219615219162191.txt' '-o' '/tmp/graph401219615219162191.bin' '-w' '/tmp/graph401219615219162191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph401219615219162191.bin' '-l' '-1' '-v' '-w' '/tmp/graph401219615219162191.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:55:05] [INFO ] Decomposing Gal with order
[2024-05-22 10:55:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:55:05] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-22 10:55:05] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:55:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-22 10:55:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8285378507041551500.gal : 2 ms
[2024-05-22 10:55:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4436613692410019385.ctl : 14 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/CTLFireability8285378507041551500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4436613692410019385.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 11 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.08219e+11,10.1092,283440,9729,104,507804,837,432,1.05588e+06,66,4477,0


Converting to forward existential form...Done !
original formula: (!(E(AG(AX(AG((u11.p39==1)))) U !(EG(((i17.u44.p155==1)&&(i22.u62.p203==1)))))) + EF(EX((i1.u3.p21==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U EX((i1.u3.p21==1))))),!(E(TRUE U !(!(EX(!(!(E(TRUE U !((u11.p39==1))))))))))) * !(EG((...204
Reverse transition relation is NOT exact ! Due to transitions t191, t196, t202, u11.t118, u11.t209, i0.u53.t16, i0.u53.t31, i1.u3.t131, i1.u3.t138, i2.t111...907
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,46.9576,1292548,1,0,2.36506e+06,1957,2627,5.56958e+06,314,11431,2773200
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EG(((EX(AF(((u11.p40==1)&&(i22.u62.p203==1)))) + (i10.u19.p68==0)) + ((i8.u17.p84==1)||((i21.i1.u58.p184==1)&&(i22.u62.p203==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((EX(!(EG(!(((u11.p40==1)&&(i22.u62.p203==1)))))) + (i10.u19.p68==0)) + ((i8.u17.p84==1)||...209
(forward)formula 1,1,332.651,5566292,1,0,9.60537e+06,2484,1106,2.25417e+07,145,15845,3951049
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((i12.u29.p102==1) + !(((EX(((i7.u14.p54==1)&&(i22.u62.p203==1))) + (i16.i1.u41.p137==1)) + ((i16.i0.u40.p134==1)&&(i23.u63.p207==1)))...545
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((!(EX(!((i2.u13.p53==1)))) + !((E(!(((i11.u27.p96==1)&&(i23.u63.p210==1))) U (!((i15....1579
(forward)formula 2,1,794.564,9303608,1,0,1.56008e+07,2484,1497,3.56741e+07,166,16200,10333519
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-22 11:19:38] [INFO ] Applying decomposition
[2024-05-22 11:19:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:19:38] [INFO ] Decomposing Gal with order
[2024-05-22 11:19:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:19:38] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-22 11:19:38] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:19:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 4 ms.
[2024-05-22 11:19:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4118528468489959652.gal : 2 ms
[2024-05-22 11:19:38] [INFO ] Time to serialize properties into /tmp/CTLFireability954186258864176982.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/CTLFireability4118528468489959652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability954186258864176982.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 8 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.08219e+11,18.4226,464028,825,2524,656009,190370,269,2.11268e+06,232,1.74339e+06,0


Converting to forward existential form...Done !
original formula: (AF((i1.u15.p201==1)) + EF((EG((EG((i0.u13.p169==0)) * AX((i0.i0.u12.p144==0)))) * (((i0.i0.i0.u11.p129==1) * EX(((i0.i0.i0.i0.u10.p101==...208
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (EG((EG((i0.u13.p169==0)) * !(EX(!((i0.i0.u12.p144==0)))))) * (((i0.i0.i0.u11.p129==1) ...274
Reverse transition relation is NOT exact ! Due to transitions t198, t202, i0.u13.t16, i0.u13.t25, i0.u13.t27, i0.u13.t28, i0.u13.t31, i0.u13.t204, i0.i0.u1...1284
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 2
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 11:22:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:22:39] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-22 11:22:39] [INFO ] Transformed 187 places.
[2024-05-22 11:22:39] [INFO ] Transformed 213 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 11:22:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5699509401315973425.gal : 2 ms
[2024-05-22 11:22:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6043984842358964108.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/CTLFireability5699509401315973425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6043984842358964108.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 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.08219e+11,21.0692,507556,2,39247,5,1.74957e+06,6,0,954,3.14542e+06,0


Converting to forward existential form...Done !
original formula: (AF((p201==1)) + EF((EG((EG((p169==0)) * AX((p144==0)))) * (((p129==1) * EX(((p101==0)||(p203==0)))) + AF((p153==0))))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (EG((EG((p169==0)) * !(EX(!((p144==0)))))) * (((p129==1) * EX(((p101==0)||(p203==0)))) ...204
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t8, t10, t11, t12, t13, t16, t25, t27, t28, t31, t39, t43, t45, t47, t48, t52, t5...485
Using saturation style SCC detection
(forward)formula 0,1,901.402,9558880,1,0,1603,5.19734e+07,25,727,3155,6.20952e+07,468
FORMULA DiscoveryGPU-PT-07b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-07b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-07b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132500386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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