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.r180-tall-171640603500473.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 GPUForwardProgress-PT-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603500473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 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 27K 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 GPUForwardProgress-PT-04b-CTLCardinality-2024-00
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-01
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-02
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-03
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-04
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-05
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-06
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-07
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-08
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-09
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-10
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2024-11
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2023-12
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2023-13
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2023-14
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716507371177

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-23 23:36:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 23:36:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 23:36:12] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-23 23:36:12] [INFO ] Transformed 112 places.
[2024-05-23 23:36:12] [INFO ] Transformed 117 transitions.
[2024-05-23 23:36:12] [INFO ] Found NUPN structural information;
[2024-05-23 23:36:12] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 66 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 109 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 109 transition count 115
Applied a total of 5 rules in 33 ms. Remains 109 /112 variables (removed 3) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 109 cols
[2024-05-23 23:36:12] [INFO ] Computed 5 invariants in 10 ms
[2024-05-23 23:36:12] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-23 23:36:12] [INFO ] Invariant cache hit.
[2024-05-23 23:36:12] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-23 23:36:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 115/223 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 1/224 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/224 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 114 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2580 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 115/223 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 114/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 1/224 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 228 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2282 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 4904ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 4919ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 115/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5314 ms. Remains : 109/112 places, 115/117 transitions.
Support contains 66 out of 109 places after structural reductions.
[2024-05-23 23:36:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 23:36:18] [INFO ] Flatten gal took : 27 ms
[2024-05-23 23:36:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 23:36:18] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:36:18] [INFO ] Input system was already deterministic with 115 transitions.
Support contains 61 out of 109 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (869 resets) in 1821 ms. (21 steps per ms) remains 2/54 properties
BEST_FIRST walk for 40003 steps (194 resets) in 97 ms. (408 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (258 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
[2024-05-23 23:36:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/223 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/224 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/223 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/224 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/224 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 94 edges and 109 vertex of which 5 / 109 are part of one of the 1 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 155 edges and 105 vertex of which 97 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 97 transition count 55
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 112 place count 46 transition count 48
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 44 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 42 transition count 46
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 118 place count 42 transition count 38
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 134 place count 34 transition count 38
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 139 place count 29 transition count 33
Iterating global reduction 4 with 5 rules applied. Total rules applied 144 place count 29 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 29 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 28 transition count 32
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 172 place count 15 transition count 19
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 175 place count 12 transition count 13
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 11 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 11 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 10 transition count 12
Applied a total of 182 rules in 33 ms. Remains 10 /109 variables (removed 99) and now considering 12/115 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 10/109 places, 12/115 transitions.
RANDOM walk for 40000 steps (1866 resets) in 474 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (599 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Probably explored full state space saw : 120 states, properties seen :0
Probabilistic random walk after 348 steps, saw 120 distinct states, run finished after 14 ms. (steps per millisecond=24 ) properties seen :0
Explored full state space saw : 120 states, properties seen :0
Exhaustive walk after 348 steps, saw 120 distinct states, run finished after 2 ms. (steps per millisecond=174 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-23 23:36:19] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:36:19] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:36:19] [INFO ] Input system was already deterministic with 115 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 160 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (complete) has 160 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 103 transition count 58
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 48 transition count 49
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 44 transition count 48
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 125 place count 44 transition count 38
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 145 place count 34 transition count 38
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 151 place count 28 transition count 32
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 28 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 157 place count 28 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 27 transition count 31
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 175 place count 19 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 18 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 18 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 17 transition count 21
Applied a total of 179 rules in 12 ms. Remains 17 /109 variables (removed 92) and now considering 21/115 (removed 94) transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-23 23:36:19] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 23:36:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 23:36:19] [INFO ] Invariant cache hit.
[2024-05-23 23:36:19] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 23:36:19] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-23 23:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 21/34 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/38 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 18 constraints, problems are : Problem set: 0 solved, 15 unsolved in 133 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 21/34 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 4/38 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 251ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/109 places, 21/115 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 322 ms. Remains : 17/109 places, 21/115 transitions.
[2024-05-23 23:36:19] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:19] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:36:19] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-23 23:36:19] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:19] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16011951407117158795.gal : 1 ms
[2024-05-23 23:36:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12503078752304568854.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/CTLCardinality16011951407117158795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12503078752304568854.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1645,0.013958,3688,2,74,5,1347,6,0,92,1238,0


Converting to forward existential form...Done !
original formula: A(AG(E(EF((p79==1)) U AF((p90==0)))) U EF(!(EG(!(AF((p8==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(EG(!(!(EG(!((p8==1)))))))))))) * !(E(!(E(TRUE U !(EG(!(!(EG(!((p8==1))))))))) U (!(!...270
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t8, t10, t13, t20, Intersection with reachable at each step enabled. (destroyed/...190
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.07258,6580,1,0,306,18217,89,197,592,22397,375
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 103
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 97 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 92 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 92 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 92 transition count 94
Applied a total of 38 rules in 10 ms. Remains 92 /109 variables (removed 17) and now considering 94/115 (removed 21) transitions.
// Phase 1: matrix 94 rows 92 cols
[2024-05-23 23:36:19] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:36:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 23:36:19] [INFO ] Invariant cache hit.
[2024-05-23 23:36:19] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-23 23:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/185 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/186 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 97 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1688 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/185 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 93/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 190 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1809 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 3509ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 3510ms
Starting structural reductions in LTL mode, iteration 1 : 92/109 places, 94/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3634 ms. Remains : 92/109 places, 94/115 transitions.
[2024-05-23 23:36:23] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:36:23] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:36:23] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-23 23:36:23] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:36:23] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:36:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10362212286894453328.gal : 2 ms
[2024-05-23 23:36:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4523479317443645920.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/CTLCardinality10362212286894453328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4523479317443645920.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(((p80==1) + !(E((AX(((p64==0)||(p65==1))) + AF((p23==1))) U AG(((p97==1)||(p98==0)))))))
=> equivalent forward existential formula: ([(EY(Init) * (p80==1))] != FALSE + [(EY(Init) * !(E((!(EX(!(((p64==0)||(p65==1))))) + !(EG(!((p23==1))))) U !(E...202
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t7, t12, t15, t23, t24, t27, t31, t38, t45, t52, t59, t66, t72, t79, t84, Inters...246
(forward)formula 0,0,5.53689,199028,1,0,725,1.2523e+06,224,353,2710,1.22436e+06,810
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 98 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 94 transition count 53
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 110 place count 43 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 41 transition count 47
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 112 place count 41 transition count 39
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 128 place count 33 transition count 39
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 133 place count 28 transition count 34
Iterating global reduction 3 with 5 rules applied. Total rules applied 138 place count 28 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 28 transition count 33
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 140 place count 27 transition count 33
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 158 place count 18 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 17 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 16 transition count 22
Applied a total of 161 rules in 9 ms. Remains 16 /109 variables (removed 93) and now considering 22/115 (removed 93) transitions.
// Phase 1: matrix 22 rows 16 cols
[2024-05-23 23:36:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:36:28] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 23:36:28] [INFO ] Invariant cache hit.
[2024-05-23 23:36:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:36:28] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-23 23:36:28] [INFO ] Redundant transitions in 2 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-23 23:36:28] [INFO ] Invariant cache hit.
[2024-05-23 23:36:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 21/33 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 133 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 21/33 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 4/37 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 138 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 292ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/109 places, 22/115 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 359 ms. Remains : 16/109 places, 22/115 transitions.
[2024-05-23 23:36:29] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:36:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:29] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-23 23:36:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality3797096506890168032.gal : 1 ms
[2024-05-23 23:36:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality4767269039662883343.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/CTLCardinality3797096506890168032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4767269039662883343.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,1808,0.017313,3748,2,84,5,2513,6,0,86,2634,0


Converting to forward existential form...Done !
original formula: EG((p42==0))
=> equivalent forward existential formula: [FwdG(Init,(p42==0))] != FALSE
Hit Full ! (commute/partial/dont) 20/0/2
(forward)formula 0,1,0.027762,4012,1,0,8,3749,19,4,431,3830,8
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 96 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 94 transition count 55
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 106 place count 45 transition count 49
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 43 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 41 transition count 47
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 112 place count 41 transition count 39
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 128 place count 33 transition count 39
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 134 place count 27 transition count 33
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 27 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 27 transition count 32
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 141 place count 27 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 25 transition count 30
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 163 place count 16 transition count 21
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 5 with 2 rules applied. Total rules applied 165 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 14 transition count 19
Applied a total of 166 rules in 9 ms. Remains 14 /109 variables (removed 95) and now considering 19/115 (removed 96) transitions.
// Phase 1: matrix 19 rows 14 cols
[2024-05-23 23:36:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 23:36:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 23:36:29] [INFO ] Invariant cache hit.
[2024-05-23 23:36:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:36:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-23 23:36:29] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-23 23:36:29] [INFO ] Invariant cache hit.
[2024-05-23 23:36:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/32 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/33 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 15 constraints, problems are : Problem set: 0 solved, 14 unsolved in 98 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/32 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 29 constraints, problems are : Problem set: 0 solved, 14 unsolved in 110 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 210ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/109 places, 19/115 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 264 ms. Remains : 14/109 places, 19/115 transitions.
[2024-05-23 23:36:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:29] [INFO ] Input system was already deterministic with 19 transitions.
RANDOM walk for 58 steps (8 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 23:36:29] [INFO ] Flatten gal took : 0 ms
[2024-05-23 23:36:29] [INFO ] Flatten gal took : 0 ms
[2024-05-23 23:36:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5407025382396084651.gal : 0 ms
[2024-05-23 23:36:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11999730954277375746.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5407025382396084651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11999730954277375746.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 98 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 95 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 95 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 95 transition count 98
Applied a total of 31 rules in 16 ms. Remains 95 /109 variables (removed 14) and now considering 98/115 (removed 17) transitions.
// Phase 1: matrix 98 rows 95 cols
[2024-05-23 23:36:29] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:36:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 23:36:29] [INFO ] Invariant cache hit.
[2024-05-23 23:36:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-23 23:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 98/192 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/193 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 100 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1715 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 98/192 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 97/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/193 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 197 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1882 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 3609ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 3610ms
Starting structural reductions in LTL mode, iteration 1 : 95/109 places, 98/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3736 ms. Remains : 95/109 places, 98/115 transitions.
[2024-05-23 23:36:33] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:36:33] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:36:33] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-23 23:36:33] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:36:33] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:36:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6539022916258665959.gal : 2 ms
[2024-05-23 23:36:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality17273562490677628187.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/CTLCardinality6539022916258665959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17273562490677628187.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(((EG(((A(((p54==0)||(p87==1)) U ((p26==0)||(p17==1))) + AF(((p34==0)||(p11==1)))) + EX(TRUE))) * AG(((p40==0)||((p4==0)&&(p34==1))))) ...336
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((!((E(!(((p26==0)||(p17==1))) U (!(((p54==0)||(p87==1))) * !(((p26==0)||(p17==1))))) + EG(!((...480
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t14, t25, t27, t32, t39, t46, t53, t61, t69, t74, t83, t88, Intersectio...241
(forward)formula 0,0,13.4349,464688,1,0,1950,3.02571e+06,261,987,2844,2.93793e+06,2106
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 96 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 91 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 91 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 91 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 90 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 90 transition count 93
Applied a total of 41 rules in 14 ms. Remains 90 /109 variables (removed 19) and now considering 93/115 (removed 22) transitions.
// Phase 1: matrix 93 rows 90 cols
[2024-05-23 23:36:46] [INFO ] Computed 5 invariants in 3 ms
[2024-05-23 23:36:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 23:36:46] [INFO ] Invariant cache hit.
[2024-05-23 23:36:47] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-23 23:36:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/182 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/183 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 95 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1589 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 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/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/182 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 92/186 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 187 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1622 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 3221ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 3223ms
Starting structural reductions in LTL mode, iteration 1 : 90/109 places, 93/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3341 ms. Remains : 90/109 places, 93/115 transitions.
[2024-05-23 23:36:50] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:36:50] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:36:50] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-23 23:36:50] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:36:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:36:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality4860121597751179824.gal : 1 ms
[2024-05-23 23:36:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality498819782798300117.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/CTLCardinality4860121597751179824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality498819782798300117.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99336e+06,0.121074,9176,2,2200,5,23735,6,0,455,26599,0


Converting to forward existential form...Done !
original formula: AF((AX(A(((p79==0)||(p33==1)) U ((p30==0)||(p24==1)))) * EF(((p16==0)&&(p69==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!((E(!(((p30==0)||(p24==1))) U (!(((p79==0)||(p33==1))) * !(((p30==0)||(p24==1))))) + EG(!(...227
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t21, t22, t27, t34, t41, t48, t55, t65, t71, t78, t83, Intersection wit...236
(forward)formula 0,1,2.31144,76528,1,0,441,423502,223,203,2661,385038,516
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 96 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 95 transition count 56
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 106 place count 46 transition count 50
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 44 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 42 transition count 48
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 112 place count 42 transition count 40
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 128 place count 34 transition count 40
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 134 place count 28 transition count 34
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 28 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 28 transition count 33
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 141 place count 28 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 26 transition count 31
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 167 place count 15 transition count 20
Applied a total of 167 rules in 8 ms. Remains 15 /109 variables (removed 94) and now considering 20/115 (removed 95) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-23 23:36:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 23:36:52] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 23:36:52] [INFO ] Invariant cache hit.
[2024-05-23 23:36:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 23:36:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-23 23:36:52] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-23 23:36:52] [INFO ] Invariant cache hit.
[2024-05-23 23:36:52] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 19/33 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/35 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 21 constraints, problems are : Problem set: 0 solved, 19 unsolved in 147 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 19/33 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 40 constraints, problems are : Problem set: 0 solved, 19 unsolved in 178 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 329ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/109 places, 20/115 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 389 ms. Remains : 15/109 places, 20/115 transitions.
[2024-05-23 23:36:53] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:36:53] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:36:53] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-23 23:36:53] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:53] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17277775456753012669.gal : 1 ms
[2024-05-23 23:36:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16516728909950149967.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/CTLCardinality17277775456753012669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16516728909950149967.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1269,0.010068,3736,2,86,5,2011,6,0,79,2195,0


Converting to forward existential form...Done !
original formula: AG(EF(EG(((p12!=0)&&(p0!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(((p12!=0)&&(p0!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t10, t11, t14, Intersection with reachable at each step enabled. (destro...194
(forward)formula 0,0,0.024587,4264,1,0,99,4993,66,44,520,5583,110
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 96 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 94 transition count 55
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 45 transition count 50
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 43 transition count 47
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 114 place count 40 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 114 place count 40 transition count 39
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 128 place count 33 transition count 39
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 133 place count 28 transition count 34
Iterating global reduction 4 with 5 rules applied. Total rules applied 138 place count 28 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 138 place count 28 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 27 transition count 33
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 158 place count 18 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 17 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 17 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 16 transition count 22
Applied a total of 162 rules in 8 ms. Remains 16 /109 variables (removed 93) and now considering 22/115 (removed 93) transitions.
// Phase 1: matrix 22 rows 16 cols
[2024-05-23 23:36:53] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:36:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 23:36:53] [INFO ] Invariant cache hit.
[2024-05-23 23:36:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:36:53] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-23 23:36:53] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 23:36:53] [INFO ] Invariant cache hit.
[2024-05-23 23:36:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 21/33 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 17 constraints, problems are : Problem set: 0 solved, 16 unsolved in 161 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 21/33 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 4/37 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 33 constraints, problems are : Problem set: 0 solved, 16 unsolved in 202 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 368ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/109 places, 22/115 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 465 ms. Remains : 16/109 places, 22/115 transitions.
[2024-05-23 23:36:53] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:53] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:53] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-23 23:36:53] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:53] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:36:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2279596384855600276.gal : 14 ms
[2024-05-23 23:36:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4864468153594523660.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/CTLCardinality2279596384855600276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4864468153594523660.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,1946,0.016372,3756,2,113,5,2043,6,0,86,2243,0


Converting to forward existential form...Done !
original formula: AG(A((p14!=1) U (p51==1)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!((p51==1))) * (!((p14!=1)) * !((p51==1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!((p51==1))...166
Hit Full ! (commute/partial/dont) 20/0/2
(forward)formula 0,0,0.022229,4020,1,0,8,2566,20,3,445,2411,8
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 96 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 91 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 91 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 91 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 90 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 90 transition count 92
Applied a total of 42 rules in 6 ms. Remains 90 /109 variables (removed 19) and now considering 92/115 (removed 23) transitions.
// Phase 1: matrix 92 rows 90 cols
[2024-05-23 23:36:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:36:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-23 23:36:53] [INFO ] Invariant cache hit.
[2024-05-23 23:36:53] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-23 23:36:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 95 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1776 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 91/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 186 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1719 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 3506ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3507ms
Starting structural reductions in LTL mode, iteration 1 : 90/109 places, 92/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3689 ms. Remains : 90/109 places, 92/115 transitions.
[2024-05-23 23:36:57] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:36:57] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:36:57] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-23 23:36:57] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:36:57] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:36:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality5059024343758699400.gal : 1 ms
[2024-05-23 23:36:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality1218658675653272577.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/CTLCardinality5059024343758699400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1218658675653272577.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,2.68294e+06,0.117734,8912,2,2149,5,22515,6,0,454,25212,0


Converting to forward existential form...Done !
original formula: E(EF(!(EF(((p2==0)||(p58==1))))) U ((!((EX(((p109==0)||(p100==1))) * (p4==1))) * (p54==0)) * (!(EX(((p17==0)||(p111==1)))) * (!(AX(EG((p4...181
=> equivalent forward existential formula: ([(EY(((FwdU(Init,E(TRUE U !(E(TRUE U ((p2==0)||(p58==1)))))) * (!((EX(((p109==0)||(p100==1))) * (p4==1))) * (p5...400
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t12, t13, t23, t24, t29, t36, t43, t50, t57, t64, t70, t77, t82, Intersection wi...237
(forward)formula 0,0,2.2202,84708,1,0,384,486954,221,173,2659,457985,453
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 94 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 94 transition count 57
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 101 place count 47 transition count 52
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 45 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 44 transition count 51
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 105 place count 44 transition count 43
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 121 place count 36 transition count 43
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 32 transition count 39
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 32 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 129 place count 32 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 31 transition count 38
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 149 place count 22 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 22 transition count 29
Applied a total of 150 rules in 7 ms. Remains 22 /109 variables (removed 87) and now considering 29/115 (removed 86) transitions.
// Phase 1: matrix 29 rows 22 cols
[2024-05-23 23:36:59] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 23:36:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 23:36:59] [INFO ] Invariant cache hit.
[2024-05-23 23:36:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:36:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-23 23:36:59] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-23 23:36:59] [INFO ] Invariant cache hit.
[2024-05-23 23:36:59] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 28/48 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 2/50 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 1/51 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 29 constraints, problems are : Problem set: 0 solved, 27 unsolved in 241 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 28/48 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 2/50 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/51 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 56 constraints, problems are : Problem set: 0 solved, 27 unsolved in 305 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 558ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/109 places, 29/115 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 629 ms. Remains : 22/109 places, 29/115 transitions.
[2024-05-23 23:37:00] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:37:00] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:37:00] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-23 23:37:00] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:37:00] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:37:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9865858480355732275.gal : 1 ms
[2024-05-23 23:37:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality11315398023119151464.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/CTLCardinality9865858480355732275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11315398023119151464.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,2775,0.01667,3796,2,144,5,2373,6,0,115,2790,0


Converting to forward existential form...Done !
original formula: AG(EF(!(A((p43==0) U !(A(((p24==0)||(p2==1)) U ((p2==0)||(p109==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!(!((E(!(((p2==0)||(p109==1))) U (!(((p24==0)||(p2==1))) * !(((p2==0)||(...483
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t7, t8, t13, t14, t15, t16, t17, t18, t20, t22, Intersection with reachable ...224
(forward)formula 0,1,0.071363,6172,1,0,159,16194,92,79,731,18263,176
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 98 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 94 transition count 53
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 111 place count 43 transition count 46
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 41 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 40 transition count 45
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 115 place count 40 transition count 37
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 131 place count 32 transition count 37
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 136 place count 27 transition count 32
Iterating global reduction 4 with 5 rules applied. Total rules applied 141 place count 27 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 141 place count 27 transition count 31
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 26 transition count 31
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 161 place count 17 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 15 transition count 20
Applied a total of 164 rules in 15 ms. Remains 15 /109 variables (removed 94) and now considering 20/115 (removed 95) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-23 23:37:00] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 23:37:00] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 23:37:00] [INFO ] Invariant cache hit.
[2024-05-23 23:37:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:37:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-23 23:37:00] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-23 23:37:00] [INFO ] Invariant cache hit.
[2024-05-23 23:37:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 4/34 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 16 constraints, problems are : Problem set: 0 solved, 15 unsolved in 108 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/34 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 31 constraints, problems are : Problem set: 0 solved, 15 unsolved in 113 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 227ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/109 places, 20/115 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 293 ms. Remains : 15/109 places, 20/115 transitions.
[2024-05-23 23:37:00] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:37:00] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:37:00] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-23 23:37:00] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:37:00] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:37:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality5286284995571756515.gal : 1 ms
[2024-05-23 23:37:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality6484363383051541823.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/CTLCardinality5286284995571756515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6484363383051541823.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,1538,0.011447,3416,2,63,5,1145,6,0,80,1245,0


Converting to forward existential form...Done !
original formula: AG(AF((p37==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p37==0)))] = FALSE
Hit Full ! (commute/partial/dont) 18/0/2
(forward)formula 0,0,0.017497,3732,1,0,8,1569,20,2,407,1424,8
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 96 transition count 101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 92 transition count 97
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 92 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 92 transition count 95
Applied a total of 37 rules in 8 ms. Remains 92 /109 variables (removed 17) and now considering 95/115 (removed 20) transitions.
// Phase 1: matrix 95 rows 92 cols
[2024-05-23 23:37:00] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 23:37:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 23:37:00] [INFO ] Invariant cache hit.
[2024-05-23 23:37:00] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-23 23:37:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 97 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1674 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 94/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 191 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1677 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 3362ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 3363ms
Starting structural reductions in LTL mode, iteration 1 : 92/109 places, 95/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3470 ms. Remains : 92/109 places, 95/115 transitions.
[2024-05-23 23:37:04] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:37:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:37:04] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-23 23:37:04] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:37:04] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:37:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality1564568625360017980.gal : 1 ms
[2024-05-23 23:37:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality17672372500662662876.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/CTLCardinality1564568625360017980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17672372500662662876.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((((p81==1) * EF((p10==1))) + ((EF(((p96==0)&&(p77==1))) * EF(((p13==0)&&(p14==1)))) * EX((p20==0)))))
=> equivalent forward existential formula: ([((EY(Init) * !(((E(TRUE U ((p96==0)&&(p77==1))) * E(TRUE U ((p13==0)&&(p14==1)))) * EX((p20==0))))) * !((p81==...306
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t14, t22, t24, t29, t36, t43, t50, t57, t64, t70, t80, t85, Intersectio...241
(forward)formula 0,1,1.54062,54256,1,0,218,277085,216,124,2718,232792,261
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 103
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 97 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 92 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 92 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 91 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 91 transition count 94
Applied a total of 39 rules in 5 ms. Remains 91 /109 variables (removed 18) and now considering 94/115 (removed 21) transitions.
// Phase 1: matrix 94 rows 91 cols
[2024-05-23 23:37:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 23:37:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-23 23:37:05] [INFO ] Invariant cache hit.
[2024-05-23 23:37:05] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-23 23:37:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/184 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/185 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 96 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1632 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/184 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 93/188 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/185 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 189 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1776 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 3419ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 3422ms
Starting structural reductions in LTL mode, iteration 1 : 91/109 places, 94/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3533 ms. Remains : 91/109 places, 94/115 transitions.
[2024-05-23 23:37:09] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:37:09] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:37:09] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-23 23:37:09] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:37:09] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:37:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality16589546175383567870.gal : 1 ms
[2024-05-23 23:37:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality1895749518719233849.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/CTLCardinality16589546175383567870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1895749518719233849.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(((!(E(((p20==1)||(p25==1)) U EF(((p74==0)||(p21==1))))) + AG(AX(E((p57==1) U (p30==0))))) + (p21==1)))
=> equivalent forward existential formula: (([(EY(Init) * !(E(((p20==1)||(p25==1)) U E(TRUE U ((p74==0)||(p21==1))))))] != FALSE + [(EY(Init) * !(E(TRUE U ...240
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t21, t22, t27, t34, t42, t50, t56, t65, t72, t80, t84, Intersection wit...236
(forward)formula 0,0,1.29931,51860,1,0,202,264804,219,117,2685,229214,250
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 98 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 94 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 94 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 94 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 93 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 93 transition count 96
Applied a total of 35 rules in 14 ms. Remains 93 /109 variables (removed 16) and now considering 96/115 (removed 19) transitions.
// Phase 1: matrix 96 rows 93 cols
[2024-05-23 23:37:10] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:37:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 23:37:10] [INFO ] Invariant cache hit.
[2024-05-23 23:37:10] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-23 23:37:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/188 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/189 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 98 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1698 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/188 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 95/192 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 1/189 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 193 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1908 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 3617ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 3618ms
Starting structural reductions in LTL mode, iteration 1 : 93/109 places, 96/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3731 ms. Remains : 93/109 places, 96/115 transitions.
[2024-05-23 23:37:14] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:37:14] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:37:14] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-23 23:37:14] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:37:14] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:37:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality11674789382090458480.gal : 1 ms
[2024-05-23 23:37:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13583677917273171568.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/CTLCardinality11674789382090458480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13583677917273171568.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.74667e+06,0.127836,9192,2,1912,5,23528,6,0,470,26372,0


Converting to forward existential form...Done !
original formula: ((AG(((EG(EX((p35==0))) + (AG((p71==1)) * ((p5==0)||(p33==0)))) + EG(AX((p71!=0))))) + EG((AX((((p6==0)&&(p75==1))&&(p34==1))) + AG((p104...176
=> equivalent forward existential formula: [(EY((Init * !((!(E(TRUE U !(((EG(EX((p35==0))) + (!(E(TRUE U !((p71==1)))) * ((p5==0)||(p33==0)))) + EG(!(EX(!(...274
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t12, t23, t24, t30, t38, t44, t51, t58, t65, t71, t81, t86, Intersection with re...232
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.93037,245488,1,0,819,1.63892e+06,236,516,2876,1.34569e+06,885
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 23:37:22] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:37:22] [INFO ] Flatten gal took : 3 ms
Total runtime 69988 ms.

BK_STOP 1716507442375

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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