Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132500369.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DiscoveryGPU-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 02:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 12 02:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 46K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716373797248

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 10:29:58] [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-22 10:29:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:29:58] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-22 10:29:58] [INFO ] Transformed 184 places.
[2024-05-22 10:29:58] [INFO ] Transformed 194 transitions.
[2024-05-22 10:29:58] [INFO ] Found NUPN structural information;
[2024-05-22 10:29:58] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 180 transition count 194
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 168 transition count 182
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 168 transition count 182
Applied a total of 28 rules in 31 ms. Remains 168 /184 variables (removed 16) and now considering 182/194 (removed 12) transitions.
// Phase 1: matrix 182 rows 168 cols
[2024-05-22 10:29:58] [INFO ] Computed 4 invariants in 14 ms
[2024-05-22 10:29:58] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-22 10:29:58] [INFO ] Invariant cache hit.
[2024-05-22 10:29:59] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 10:29:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 5/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 10:30:00] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 10 ms to minimize.
[2024-05-22 10:30:00] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-05-22 10:30:00] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:30:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/346 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 25 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 8 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 9/181 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 4/350 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 185 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 5/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/346 variables, 164/181 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 177/358 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 10:30:10] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 4/350 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/350 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 367 constraints, problems are : Problem set: 0 solved, 181 unsolved in 12693 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 14/14 constraints]
After SMT, in 21979ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 21995ms
Starting structural reductions in LTL mode, iteration 1 : 168/184 places, 182/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22417 ms. Remains : 168/184 places, 182/194 transitions.
Support contains 63 out of 168 places after structural reductions.
[2024-05-22 10:30:21] [INFO ] Flatten gal took : 36 ms
[2024-05-22 10:30:21] [INFO ] Flatten gal took : 17 ms
[2024-05-22 10:30:21] [INFO ] Input system was already deterministic with 182 transitions.
Support contains 61 out of 168 places (down from 63) after GAL structural reductions.
RANDOM walk for 32722 steps (164 resets) in 584 ms. (55 steps per ms) remains 0/39 properties
[2024-05-22 10:30:21] [INFO ] Flatten gal took : 30 ms
[2024-05-22 10:30:21] [INFO ] Flatten gal took : 13 ms
[2024-05-22 10:30:21] [INFO ] Input system was already deterministic with 182 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 299 edges and 168 vertex of which 149 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Graph (complete) has 299 edges and 168 vertex of which 149 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 148 transition count 140
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 118 transition count 140
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 61 place count 118 transition count 125
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 91 place count 103 transition count 125
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 96 transition count 118
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 96 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 96 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 95 transition count 117
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 91 transition count 113
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 91 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 119 place count 87 transition count 105
Iterating global reduction 2 with 4 rules applied. Total rules applied 123 place count 87 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 127 place count 83 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 83 transition count 101
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 163 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 66 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 65 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 65 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 64 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 64 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 62 transition count 79
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 179 place count 61 transition count 72
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 188 place count 54 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 53 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 189 place count 53 transition count 69
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 191 place count 52 transition count 69
Applied a total of 191 rules in 58 ms. Remains 52 /168 variables (removed 116) and now considering 69/182 (removed 113) transitions.
// Phase 1: matrix 69 rows 52 cols
[2024-05-22 10:30:21] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:30:21] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 10:30:21] [INFO ] Invariant cache hit.
[2024-05-22 10:30:21] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-22 10:30:21] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-22 10:30:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 69/115 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 6/121 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-22 10:30:22] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 54 constraints, problems are : Problem set: 0 solved, 63 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 69/115 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 63/111 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 6/121 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 117 constraints, problems are : Problem set: 0 solved, 63 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 1/1 constraints]
After SMT, in 1836ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1837ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/168 places, 69/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2014 ms. Remains : 52/168 places, 69/182 transitions.
[2024-05-22 10:30:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:30:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:30:23] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-22 10:30:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:30:23] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:30:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality18229074398561944057.gal : 2 ms
[2024-05-22 10:30:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8205568717530887441.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/CTLCardinality18229074398561944057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8205568717530887441.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.22022e+06,0.091769,7144,2,1569,5,17678,6,0,268,17692,0


Converting to forward existential form...Done !
original formula: AF((p173==1))
=> equivalent forward existential formula: [FwdG(Init,!((p173==1)))] = FALSE
Hit Full ! (commute/partial/dont) 67/0/2
(forward)formula 0,1,0.268396,13732,1,0,12,52442,20,3,1307,48817,11
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Graph (complete) has 299 edges and 168 vertex of which 149 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 148 transition count 139
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 117 transition count 139
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 63 place count 117 transition count 124
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 93 place count 102 transition count 124
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 101 place count 94 transition count 116
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 94 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 109 place count 94 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 92 transition count 114
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 88 transition count 110
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 88 transition count 110
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 84 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 84 transition count 102
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 80 transition count 98
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 80 transition count 98
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 167 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 64 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 64 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 63 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 63 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 62 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 62 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 60 transition count 77
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 70 edges and 58 vertex of which 54 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 58 edges and 54 vertex of which 24 / 54 are part of one of the 12 SCC in 2 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 20 rules applied. Total rules applied 195 place count 42 transition count 56
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 223 place count 26 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 228 place count 21 transition count 34
Iterating global reduction 4 with 5 rules applied. Total rules applied 233 place count 21 transition count 34
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 16 transition count 24
Iterating global reduction 4 with 5 rules applied. Total rules applied 243 place count 16 transition count 24
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 247 place count 12 transition count 16
Iterating global reduction 4 with 4 rules applied. Total rules applied 251 place count 12 transition count 16
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 255 place count 8 transition count 12
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 260 place count 8 transition count 11
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 262 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 5 transition count 8
Applied a total of 264 rules in 38 ms. Remains 5 /168 variables (removed 163) and now considering 8/182 (removed 174) transitions.
[2024-05-22 10:30:24] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2024-05-22 10:30:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 10:30:24] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 10:30:24] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 10:30:24] [INFO ] Invariant cache hit.
[2024-05-22 10:30:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 10:30:24] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-22 10:30:24] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 10:30:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/168 places, 8/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 150 ms. Remains : 5/168 places, 8/182 transitions.
[2024-05-22 10:30:24] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:30:24] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:30:24] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-22 10:30:24] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:30:24] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:30:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality17425240986973422991.gal : 1 ms
[2024-05-22 10:30:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality7476618215556823254.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/CTLCardinality17425240986973422991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7476618215556823254.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,90,0.001985,3308,2,14,5,132,6,0,25,143,0


Converting to forward existential form...Done !
original formula: AG(EF((p161==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p161==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,0,0.003277,3624,1,0,24,237,34,11,129,239,23
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 160 transition count 182
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 30 place count 138 transition count 160
Iterating global reduction 1 with 22 rules applied. Total rules applied 52 place count 138 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 130 transition count 152
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 130 transition count 152
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 125 transition count 147
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 125 transition count 147
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 120 transition count 142
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 120 transition count 142
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 115 transition count 132
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 115 transition count 132
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 110 transition count 127
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 110 transition count 127
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 105 transition count 122
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 105 transition count 122
Applied a total of 118 rules in 14 ms. Remains 105 /168 variables (removed 63) and now considering 122/182 (removed 60) transitions.
// Phase 1: matrix 122 rows 105 cols
[2024-05-22 10:30:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:30:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 10:30:24] [INFO ] Invariant cache hit.
[2024-05-22 10:30:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-22 10:30:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-22 10:30:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:30:25] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:30:25] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-05-22 10:30:25] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:30:25] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:30:25] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-22 10:30:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-22 10:30:25] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 115 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 236 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 5987ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 5990ms
Starting structural reductions in LTL mode, iteration 1 : 105/168 places, 122/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6129 ms. Remains : 105/168 places, 122/182 transitions.
[2024-05-22 10:30:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:30:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:30:30] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-22 10:30:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:30:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:30:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality10915502802629730006.gal : 2 ms
[2024-05-22 10:30:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality6242181248125450373.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/CTLCardinality10915502802629730006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6242181248125450373.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.70015e+08,12.0217,287960,2,27997,5,939100,6,0,543,1.7306e+06,0


Converting to forward existential form...Done !
original formula: EF(EG(AX((p53==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!((p53==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t50, t51, t53, t...304
Detected timeout of ITS tools.
[2024-05-22 10:31:00] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:31:00] [INFO ] Applying decomposition
[2024-05-22 10:31:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6336880123321664568.txt' '-o' '/tmp/graph6336880123321664568.bin' '-w' '/tmp/graph6336880123321664568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6336880123321664568.bin' '-l' '-1' '-v' '-w' '/tmp/graph6336880123321664568.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:31:01] [INFO ] Decomposing Gal with order
[2024-05-22 10:31:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:31:01] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 10:31:01] [INFO ] Flatten gal took : 36 ms
[2024-05-22 10:31:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 10:31:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality12226656146616708304.gal : 2 ms
[2024-05-22 10:31:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality1482418838709554029.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/CTLCardinality12226656146616708304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1482418838709554029.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.70015e+08,16.5993,434660,4032,136,678484,6848,296,3.13482e+06,44,57047,0


Converting to forward existential form...Done !
original formula: EF(EG(AX((i6.u13.p53==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!((i6.u13.p53==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, u31.t15, u35.t4, u35.t5, i2.u4.t76, i2.u36.t2, i3.t73, i3.t62, i3.t50, i3.t38, i3.t26, i...447
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 160 transition count 182
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 25 place count 143 transition count 165
Iterating global reduction 1 with 17 rules applied. Total rules applied 42 place count 143 transition count 165
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 137 transition count 159
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 137 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 132 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 132 transition count 154
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 127 transition count 149
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 127 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 125 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 125 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 123 transition count 143
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 123 transition count 143
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 121 transition count 141
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 121 transition count 141
Applied a total of 86 rules in 13 ms. Remains 121 /168 variables (removed 47) and now considering 141/182 (removed 41) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-22 10:31:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:31:31] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 10:31:31] [INFO ] Invariant cache hit.
[2024-05-22 10:31:31] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-22 10:31:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 10:31:32] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-22 10:31:32] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:31:32] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-22 10:31:33] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 136 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/136 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/276 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 276 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4088 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 13/13 constraints]
After SMT, in 8318ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 8320ms
Starting structural reductions in LTL mode, iteration 1 : 121/168 places, 141/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8539 ms. Remains : 121/168 places, 141/182 transitions.
[2024-05-22 10:31:39] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:31:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:31:39] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 10:31:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:31:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:31:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16498818680749677884.gal : 2 ms
[2024-05-22 10:31:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality13787333528069349612.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/CTLCardinality16498818680749677884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13787333528069349612.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.26803e+08,11.7881,296776,2,29084,5,1.05178e+06,6,0,626,1.71606e+06,0


Converting to forward existential form...Done !
original formula: (AG(((p183==0)&&(p130==1))) + AG((((AF(((p69!=0)&&(p176!=1))) + ((p87==0)&&((p96==0)||(p142==1)))) + ((p62==0)||(p177==1))) * AX((((p34==...189
=> equivalent forward existential formula: ([FwdG(((FwdU((Init * !(!(E(TRUE U !(((p183==0)&&(p130==1))))))),TRUE) * !(((p62==0)||(p177==1)))) * !(((p87==0)...344
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t8, t9, t10, t16, t19, t20, t23, t28, t33, t34, t35, t37, t43, t48, t49, t50, t52...338
Detected timeout of ITS tools.
[2024-05-22 10:32:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:32:09] [INFO ] Applying decomposition
[2024-05-22 10:32:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph230102080377848971.txt' '-o' '/tmp/graph230102080377848971.bin' '-w' '/tmp/graph230102080377848971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph230102080377848971.bin' '-l' '-1' '-v' '-w' '/tmp/graph230102080377848971.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:32:09] [INFO ] Decomposing Gal with order
[2024-05-22 10:32:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:32:09] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 10:32:09] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:32:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2024-05-22 10:32:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality6111732253983896549.gal : 2 ms
[2024-05-22 10:32:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality7538575180625498314.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/CTLCardinality6111732253983896549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7538575180625498314.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.26803e+08,24.9512,608436,5559,547,1.11347e+06,15265,322,3.8282e+06,61,156030,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Graph (complete) has 299 edges and 168 vertex of which 149 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 148 transition count 140
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 118 transition count 140
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 61 place count 118 transition count 125
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 91 place count 103 transition count 125
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 95 transition count 117
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 95 transition count 117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 107 place count 95 transition count 115
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 93 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 89 transition count 111
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 89 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 85 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 85 transition count 103
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 81 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 81 transition count 99
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 165 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 65 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 64 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 64 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 63 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 63 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 173 place count 61 transition count 78
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 71 edges and 59 vertex of which 55 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 59 edges and 55 vertex of which 24 / 55 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 2 with 21 rules applied. Total rules applied 194 place count 43 transition count 56
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 223 place count 26 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 228 place count 21 transition count 34
Iterating global reduction 4 with 5 rules applied. Total rules applied 233 place count 21 transition count 34
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 237 place count 17 transition count 26
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 17 transition count 26
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 245 place count 13 transition count 18
Iterating global reduction 4 with 4 rules applied. Total rules applied 249 place count 13 transition count 18
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 253 place count 9 transition count 14
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 9 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 9 transition count 13
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 260 place count 8 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 262 place count 6 transition count 10
Applied a total of 262 rules in 42 ms. Remains 6 /168 variables (removed 162) and now considering 10/182 (removed 172) transitions.
[2024-05-22 10:32:39] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-22 10:32:39] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 10:32:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 10:32:40] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 10:32:40] [INFO ] Invariant cache hit.
[2024-05-22 10:32:40] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 10:32:40] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-22 10:32:40] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 10:32:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 33 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 35 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/168 places, 10/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 172 ms. Remains : 6/168 places, 10/182 transitions.
[2024-05-22 10:32:40] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:32:40] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:32:40] [INFO ] Input system was already deterministic with 10 transitions.
[2024-05-22 10:32:40] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:32:40] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:32:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality3467309993408602410.gal : 0 ms
[2024-05-22 10:32:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality16241997621319937028.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/CTLCardinality3467309993408602410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16241997621319937028.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,111,0.002394,3344,2,32,5,184,6,0,30,191,0


Converting to forward existential form...Done !
original formula: AF(AG((p21==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p21==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...170
(forward)formula 0,0,0.006834,3664,1,0,51,1037,45,40,164,1610,59
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 161 transition count 182
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 27 place count 141 transition count 162
Iterating global reduction 1 with 20 rules applied. Total rules applied 47 place count 141 transition count 162
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 134 transition count 155
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 134 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 130 transition count 151
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 130 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 126 transition count 147
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 126 transition count 147
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 122 transition count 139
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 122 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 118 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 118 transition count 135
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 114 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 114 transition count 131
Applied a total of 101 rules in 10 ms. Remains 114 /168 variables (removed 54) and now considering 131/182 (removed 51) transitions.
// Phase 1: matrix 131 rows 114 cols
[2024-05-22 10:32:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:32:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 10:32:40] [INFO ] Invariant cache hit.
[2024-05-22 10:32:40] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-22 10:32:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 131/244 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-22 10:32:41] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:32:41] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:32:41] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:32:41] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:32:41] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:32:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:32:41] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 1/245 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 123 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/244 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 129/251 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 253 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 7/7 constraints]
After SMT, in 8760ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 8762ms
Starting structural reductions in LTL mode, iteration 1 : 114/168 places, 131/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8903 ms. Remains : 114/168 places, 131/182 transitions.
[2024-05-22 10:32:49] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:32:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:32:49] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-22 10:32:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:32:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:32:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2784404595433117187.gal : 1 ms
[2024-05-22 10:32:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality5744176201473533963.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/CTLCardinality2784404595433117187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5744176201473533963.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,6.5204e+08,16.0572,429500,2,38253,5,1.36314e+06,6,0,585,2.64061e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.5204e+08,5.54326,177692,3304,111,305744,4213,303,1.11657e+06,46,35321,0


Converting to forward existential form...Done !
original formula: AG(EX(AX(((i7.u19.p77==0)&&(((i1.u26.p116==0)||(i2.u24.p103==1))||((i7.u18.p76==0)||(i13.u33.p147==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(((i7.u19.p77==0)&&(((i1.u26.p116==0)||(i2.u24.p103==1))||((i7.u18.p76==0)||(i13....185
Reverse transition relation is NOT exact ! Due to transitions t122, u38.t4, u38.t5, i1.t78, i1.t67, i1.t55, i1.t43, i1.t31, i1.u5.t83, i1.u12.t68, i1.u17.t...459
(forward)formula 0,0,14.6155,350556,1,0,459191,4213,1274,2.8322e+06,238,35321,376572
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Graph (complete) has 299 edges and 168 vertex of which 151 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 150 transition count 140
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 119 transition count 140
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 63 place count 119 transition count 125
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 93 place count 104 transition count 125
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 101 place count 96 transition count 117
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 96 transition count 117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 109 place count 96 transition count 115
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 94 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 90 transition count 111
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 90 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 86 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 86 transition count 103
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 82 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 82 transition count 99
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 167 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 65 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 64 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 64 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 62 transition count 78
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 60 vertex of which 56 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 61 edges and 56 vertex of which 24 / 56 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 22 rules applied. Total rules applied 197 place count 44 transition count 55
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 227 place count 26 transition count 43
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 232 place count 21 transition count 33
Iterating global reduction 4 with 5 rules applied. Total rules applied 237 place count 21 transition count 33
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 241 place count 17 transition count 25
Iterating global reduction 4 with 4 rules applied. Total rules applied 245 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 249 place count 13 transition count 17
Iterating global reduction 4 with 4 rules applied. Total rules applied 253 place count 13 transition count 17
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 257 place count 9 transition count 13
Iterating global reduction 4 with 4 rules applied. Total rules applied 261 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 9 transition count 12
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 8 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 266 place count 6 transition count 9
Applied a total of 266 rules in 34 ms. Remains 6 /168 variables (removed 162) and now considering 9/182 (removed 173) transitions.
[2024-05-22 10:33:33] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 6 cols
[2024-05-22 10:33:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:33:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 10:33:33] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2024-05-22 10:33:33] [INFO ] Invariant cache hit.
[2024-05-22 10:33:33] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 10:33:33] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 10:33:33] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2024-05-22 10:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 28 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 31 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/168 places, 9/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 132 ms. Remains : 6/168 places, 9/182 transitions.
[2024-05-22 10:33:34] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:33:34] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:33:34] [INFO ] Input system was already deterministic with 9 transitions.
[2024-05-22 10:33:34] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:33:34] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:33:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6928534288340953798.gal : 0 ms
RANDOM walk for 100 steps (4 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 10:33:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6532966622996293369.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6928534288340953798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6532966622996293369.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Graph (complete) has 299 edges and 168 vertex of which 149 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 148 transition count 141
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 119 transition count 141
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 59 place count 119 transition count 127
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 87 place count 105 transition count 127
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 94 place count 98 transition count 120
Iterating global reduction 2 with 7 rules applied. Total rules applied 101 place count 98 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 98 transition count 119
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 97 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 93 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 93 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 89 transition count 107
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 89 transition count 107
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 85 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 85 transition count 103
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 159 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 68 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 67 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 66 transition count 83
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 66 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 64 transition count 81
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 176 place count 63 transition count 74
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 185 place count 56 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 186 place count 55 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 186 place count 55 transition count 71
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 188 place count 54 transition count 71
Applied a total of 188 rules in 18 ms. Remains 54 /168 variables (removed 114) and now considering 71/182 (removed 111) transitions.
// Phase 1: matrix 71 rows 54 cols
[2024-05-22 10:33:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:33:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 10:33:34] [INFO ] Invariant cache hit.
[2024-05-22 10:33:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-22 10:33:34] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-22 10:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 71/119 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 6/125 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-22 10:33:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 56 constraints, problems are : Problem set: 0 solved, 65 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 71/119 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 65/115 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 6/125 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 121 constraints, problems are : Problem set: 0 solved, 65 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints]
After SMT, in 1754ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1755ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/168 places, 71/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1862 ms. Remains : 54/168 places, 71/182 transitions.
[2024-05-22 10:33:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:33:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:33:35] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-22 10:33:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:33:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:33:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality517540633648490959.gal : 1 ms
[2024-05-22 10:33:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality17267880130511304139.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/CTLCardinality517540633648490959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17267880130511304139.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.67698e+06,0.07436,6508,2,1100,5,13961,6,0,278,14915,0


Converting to forward existential form...Done !
original formula: EF(!(E(EF(!(A((p89==1) U (p86==1)))) U (p173==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U !(!((E(!((p86==1)) U (!((p89==1)) * !((p86==1)))) + EG(!((p86==1))))))) U (p173...172
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t6, t7, t9, t11, t12, t13, t15, t18, t19, t22, t24, t25, t26, t28, t30, t31, t32,...284
(forward)formula 0,1,2.10196,86604,1,0,468,475194,175,228,1715,668517,479
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 161 transition count 182
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 27 place count 141 transition count 162
Iterating global reduction 1 with 20 rules applied. Total rules applied 47 place count 141 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 135 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 135 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 132 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 132 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 130 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 130 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 128 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 128 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 127 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 127 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 126 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 126 transition count 145
Applied a total of 77 rules in 17 ms. Remains 126 /168 variables (removed 42) and now considering 145/182 (removed 37) transitions.
// Phase 1: matrix 145 rows 126 cols
[2024-05-22 10:33:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:33:38] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 10:33:38] [INFO ] Invariant cache hit.
[2024-05-22 10:33:38] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 10:33:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/270 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 10:33:39] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:33:39] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:33:39] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:33:39] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:33:39] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:33:39] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 1/271 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 134 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4495 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/270 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 143/276 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 278 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 6/6 constraints]
After SMT, in 10674ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 10675ms
Starting structural reductions in LTL mode, iteration 1 : 126/168 places, 145/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10817 ms. Remains : 126/168 places, 145/182 transitions.
[2024-05-22 10:33:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:33:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:33:48] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 10:33:48] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:33:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:33:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17996446959107683011.gal : 2 ms
[2024-05-22 10:33:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality4361392470984545994.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/CTLCardinality17996446959107683011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4361392470984545994.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,8.4085e+08,13.1125,328516,2,26801,5,1.04453e+06,6,0,646,1.87461e+06,0


Converting to forward existential form...Done !
original formula: AG(!(E(A(!(((p39==0)||(p91==1))) U ((p105==1)&&((p45==0)||(p68==1)))) U (EX((p124==1)) * AF((p129==1))))))
=> equivalent forward existential formula: [((FwdU(FwdU(Init,TRUE),!((E(!(((p105==1)&&((p45==0)||(p68==1)))) U (!(!(((p39==0)||(p91==1)))) * !(((p105==1)&&...274
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t28, t30, t42, t44, t46, t52, t58, t59, t61, t67, t73, t...337
Detected timeout of ITS tools.
[2024-05-22 10:34:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:34:18] [INFO ] Applying decomposition
[2024-05-22 10:34:18] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2829653545318887386.txt' '-o' '/tmp/graph2829653545318887386.bin' '-w' '/tmp/graph2829653545318887386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2829653545318887386.bin' '-l' '-1' '-v' '-w' '/tmp/graph2829653545318887386.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:34:18] [INFO ] Decomposing Gal with order
[2024-05-22 10:34:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:34:18] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-22 10:34:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:34:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 10:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17821380814378755577.gal : 2 ms
[2024-05-22 10:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality4267680276177607949.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/CTLCardinality17821380814378755577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4267680276177607949.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.4085e+08,3.05466,104908,3320,83,165939,1500,323,567878,44,10366,0


Converting to forward existential form...Done !
original formula: AG(!(E(A(!(((u9.p39==0)||(i18.u23.p91==1))) U ((i12.u28.p105==1)&&((i6.u11.p45==0)||(i9.u18.p68==1)))) U (EX((i15.u35.p124==1)) * AF((i3....172
=> equivalent forward existential formula: [((FwdU(FwdU(Init,TRUE),!((E(!(((i12.u28.p105==1)&&((i6.u11.p45==0)||(i9.u18.p68==1)))) U (!(!(((u9.p39==0)||(i1...366
Reverse transition relation is NOT exact ! Due to transitions t100, t103, t137, t139, u9.t73, u44.t4, u44.t5, i2.t85, i2.t14, i2.u2.t90, i2.u39.t15, i3.t67...505
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 182
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 145 transition count 164
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 145 transition count 164
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 140 transition count 159
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 140 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 138 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 138 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 136 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 136 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 134 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 134 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 132 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 132 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 130 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 130 transition count 147
Applied a total of 71 rules in 16 ms. Remains 130 /168 variables (removed 38) and now considering 147/182 (removed 35) transitions.
// Phase 1: matrix 147 rows 130 cols
[2024-05-22 10:34:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:34:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 10:34:49] [INFO ] Invariant cache hit.
[2024-05-22 10:34:49] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 10:34:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/274 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 10:34:50] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:34:50] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:34:50] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:34:50] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:34:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:34:50] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:34:50] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 3/277 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 139 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4654 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/274 variables, 127/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 143/279 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 3/277 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 285 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 7/7 constraints]
After SMT, in 11512ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 11513ms
Starting structural reductions in LTL mode, iteration 1 : 130/168 places, 147/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11652 ms. Remains : 130/168 places, 147/182 transitions.
[2024-05-22 10:35:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:35:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:35:00] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-22 10:35:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:35:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:35:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality4468612814253059403.gal : 0 ms
[2024-05-22 10:35:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality972472652847629555.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/CTLCardinality4468612814253059403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality972472652847629555.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01021e+09,8.62493,241388,2,22249,5,802575,6,0,659,1.33979e+06,0


Converting to forward existential form...Done !
original formula: AF(!(E((E(AX(((p11==0)||(p153==1))) U AX((p86==1))) + ((p14==1) * EF((p167==1)))) U (EX(((p118==0)&&(p75==1))) * !(((p117!=1)||(((p151==0...198
=> equivalent forward existential formula: [FwdG(Init,!(!(E((E(!(EX(!(((p11==0)||(p153==1))))) U !(EX(!((p86==1))))) + ((p14==1) * E(TRUE U (p167==1)))) U ...261
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t17, t19, t21, t27, t35, t36, t38, t44, t47, t48, t50, t56, t59, t60, t62, t...311
Detected timeout of ITS tools.
[2024-05-22 10:35:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:35:30] [INFO ] Applying decomposition
[2024-05-22 10:35:30] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3152315890437018813.txt' '-o' '/tmp/graph3152315890437018813.bin' '-w' '/tmp/graph3152315890437018813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3152315890437018813.bin' '-l' '-1' '-v' '-w' '/tmp/graph3152315890437018813.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:35:30] [INFO ] Decomposing Gal with order
[2024-05-22 10:35:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:35:30] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-22 10:35:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2024-05-22 10:35:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality3401528279872587702.gal : 2 ms
[2024-05-22 10:35:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality13154069845203802194.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/CTLCardinality3401528279872587702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13154069845203802194.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01021e+09,1.05581,44740,1297,53,69250,504,336,277800,42,1356,0


Converting to forward existential form...Done !
original formula: AF(!(E((E(AX(((i2.u3.p11==0)||(i13.u41.p153==1))) U AX((i0.u22.p86==1))) + ((i2.u4.p14==1) * EF((i15.u37.p167==1)))) U (EX(((i11.u29.p118...286
=> equivalent forward existential formula: [FwdG(Init,!(!(E((E(!(EX(!(((i2.u3.p11==0)||(i13.u41.p153==1))))) U !(EX(!((i0.u22.p86==1))))) + ((i2.u4.p14==1)...349
Reverse transition relation is NOT exact ! Due to transitions t137, u46.t4, u46.t5, i1.u2.t93, i2.u4.t89, i3.u6.t91, i4.t83, i4.t68, i4.t56, i4.t44, i4.t27...475
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 161 transition count 182
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 25 place count 143 transition count 164
Iterating global reduction 1 with 18 rules applied. Total rules applied 43 place count 143 transition count 164
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 136 transition count 157
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 136 transition count 157
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 131 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 131 transition count 152
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 128 transition count 149
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 128 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 125 transition count 143
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 125 transition count 143
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 122 transition count 140
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 122 transition count 140
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 119 transition count 137
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 119 transition count 137
Applied a total of 91 rules in 17 ms. Remains 119 /168 variables (removed 49) and now considering 137/182 (removed 45) transitions.
// Phase 1: matrix 137 rows 119 cols
[2024-05-22 10:36:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:36:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 10:36:00] [INFO ] Invariant cache hit.
[2024-05-22 10:36:01] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 10:36:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/255 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 5 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-22 10:36:02] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 12/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 1/256 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 133 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4346 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/255 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 135/267 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 269 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 12/12 constraints]
After SMT, in 10008ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 10009ms
Starting structural reductions in LTL mode, iteration 1 : 119/168 places, 137/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10162 ms. Remains : 119/168 places, 137/182 transitions.
[2024-05-22 10:36:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:36:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:36:11] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 10:36:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:36:11] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:36:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality8382411168816595864.gal : 1 ms
[2024-05-22 10:36:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality1307746610564797830.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/CTLCardinality8382411168816595864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1307746610564797830.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.41611e+08,11.7604,304092,2,36736,5,999745,6,0,611,1.83729e+06,0


Converting to forward existential form...Done !
original formula: AG(EX((!(E(AX((p121==0)) U (((p114==0)||(p183==1))&&(p62==1)))) * ((p1==0) + (AX((p50==0)) * (p14==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(E(!(EX(!((p121==0)))) U (((p114==0)||(p183==1))&&(p62==1)))) * ((p1==0) + (!(EX(!((p...190
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t13, t16, t17, t19, t25, t31, t32, t33, t35, t41, t44, t45, t47, t53, t57...330
Detected timeout of ITS tools.
[2024-05-22 10:36:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:36:41] [INFO ] Applying decomposition
[2024-05-22 10:36:41] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14041053602934738862.txt' '-o' '/tmp/graph14041053602934738862.bin' '-w' '/tmp/graph14041053602934738862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14041053602934738862.bin' '-l' '-1' '-v' '-w' '/tmp/graph14041053602934738862.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:36:41] [INFO ] Decomposing Gal with order
[2024-05-22 10:36:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:36:41] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-22 10:36:41] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:36:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2024-05-22 10:36:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2579730876904459853.gal : 1 ms
[2024-05-22 10:36:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3894253583198355025.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/CTLCardinality2579730876904459853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3894253583198355025.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.41611e+08,5.84165,181288,3350,94,298827,5209,316,1.10608e+06,42,46666,0


Converting to forward existential form...Done !
original formula: AG(EX((!(E(AX((i3.u31.p121==0)) U (((i0.u28.p114==0)||(i3.u42.p183==1))&&(i6.u18.p62==1)))) * ((i0.u1.p1==0) + (AX((i7.u16.p50==0)) * (i3...171
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(E(!(EX(!((i3.u31.p121==0)))) U (((i0.u28.p114==0)||(i3.u42.p183==1))&&(i6.u18.p62==1...237
Reverse transition relation is NOT exact ! Due to transitions u41.t6, u41.t7, i2.u4.t90, i3.t102, i3.t101, i3.t87, i3.t72, i3.t32, i3.t3, i3.u6.t86, i3.u31...505
(forward)formula 0,0,28.7323,610656,1,0,886102,5209,1374,4.01818e+06,199,46666,731841
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 160 transition count 182
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 29 place count 139 transition count 161
Iterating global reduction 1 with 21 rules applied. Total rules applied 50 place count 139 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 131 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 131 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 126 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 126 transition count 148
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 121 transition count 143
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 121 transition count 143
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 116 transition count 133
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 116 transition count 133
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 112 transition count 129
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 112 transition count 129
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 108 transition count 125
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 108 transition count 125
Applied a total of 112 rules in 10 ms. Remains 108 /168 variables (removed 60) and now considering 125/182 (removed 57) transitions.
// Phase 1: matrix 125 rows 108 cols
[2024-05-22 10:37:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:37:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 10:37:10] [INFO ] Invariant cache hit.
[2024-05-22 10:37:10] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-22 10:37:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/233 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-22 10:37:11] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 10:37:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:37:11] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:37:11] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:37:11] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:37:11] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:37:11] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:37:11] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 118 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/233 variables, 108/118 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 124/242 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 242 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 8/8 constraints]
After SMT, in 6140ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6141ms
Starting structural reductions in LTL mode, iteration 1 : 108/168 places, 125/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6285 ms. Remains : 108/168 places, 125/182 transitions.
[2024-05-22 10:37:16] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:37:16] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:37:16] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-22 10:37:16] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:37:16] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:37:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality10085103878634963395.gal : 1 ms
[2024-05-22 10:37:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality596297723736403461.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/CTLCardinality10085103878634963395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality596297723736403461.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,5.33696e+08,7.84091,213500,2,29798,5,680028,6,0,557,1.34496e+06,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(EX(((p24==0)||(p56==1)))) + EF((p16==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(EX(((p24==0)||(p56==1)))))) + E(TRUE U (p16==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t50, t51, t53, t...310
Detected timeout of ITS tools.
[2024-05-22 10:37:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:37:46] [INFO ] Applying decomposition
[2024-05-22 10:37:46] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13367346029293765053.txt' '-o' '/tmp/graph13367346029293765053.bin' '-w' '/tmp/graph13367346029293765053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13367346029293765053.bin' '-l' '-1' '-v' '-w' '/tmp/graph13367346029293765053.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:37:46] [INFO ] Decomposing Gal with order
[2024-05-22 10:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:37:46] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 10:37:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:37:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:37:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6536541662421396259.gal : 1 ms
[2024-05-22 10:37:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality16922155710955787602.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/CTLCardinality6536541662421396259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16922155710955787602.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.33696e+08,5.77669,147792,3094,65,194673,773,318,1.07183e+06,44,1959,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(EX(((i3.u8.p24==0)||(i7.u16.p56==1)))) + EF((i2.u6.p16==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(EX(((i3.u8.p24==0)||(i7.u16.p56==1)))))) + E(TRUE U (i2.u6.p16==0))))))...166
Reverse transition relation is NOT exact ! Due to transitions t86, t88, u38.t4, u38.t5, i2.u4.t79, i3.u8.t123, i4.u10.t81, i5.t62, i5.t50, i5.t38, i5.t26, ...461
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
(forward)formula 0,1,23.7883,494864,1,0,611773,1537,1882,3.94744e+06,282,6924,368343
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Graph (complete) has 299 edges and 168 vertex of which 151 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 151 transition count 148
Reduce places removed 24 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 127 transition count 145
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 124 transition count 145
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 55 place count 124 transition count 132
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 81 place count 111 transition count 132
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 88 place count 104 transition count 125
Iterating global reduction 3 with 7 rules applied. Total rules applied 95 place count 104 transition count 125
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 95 place count 104 transition count 123
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 102 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 99 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 99 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 96 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 96 transition count 114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 93 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 93 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 145 place count 79 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 78 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 78 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 77 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 77 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 76 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 76 transition count 93
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 76 transition count 93
Applied a total of 153 rules in 24 ms. Remains 76 /168 variables (removed 92) and now considering 93/182 (removed 89) transitions.
// Phase 1: matrix 93 rows 76 cols
[2024-05-22 10:38:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:38:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 10:38:10] [INFO ] Invariant cache hit.
[2024-05-22 10:38:10] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:38:10] [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.
[2024-05-22 10:38:10] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 10:38:10] [INFO ] Invariant cache hit.
[2024-05-22 10:38:10] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/168 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 44/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 44/44 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/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/168 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 44/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 91/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/169 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 214 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 3723ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 3725ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/168 places, 93/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3858 ms. Remains : 76/168 places, 93/182 transitions.
[2024-05-22 10:38:14] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:38:14] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:38:14] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-22 10:38:14] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:38:14] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:38:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality13673710994095416668.gal : 1 ms
[2024-05-22 10:38:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality3242955359404876361.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/CTLCardinality13673710994095416668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3242955359404876361.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03661e+07,0.070966,6852,2,1127,5,19736,6,0,387,12970,0


Converting to forward existential form...Done !
original formula: AG(A(!((EG((((p37==0)||(p86==1))||(p43==1))) + AG(((p25==0)||(p130==1))))) U ((A((((p75==0)||(p168==1))||(p139==1)) U (p7!=0)) * (p47==1)...195
=> equivalent forward existential formula: (((([(FwdU((FwdU(FwdU(Init,TRUE),!(((!((E(!((p7!=0)) U (!((((p75==0)||(p168==1))||(p139==1))) * !((p7!=0)))) + E...1481
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t11, t15, t21, t24, t28, t37, t38, t47, t87, t91, Intersection with reachable at...222
(forward)formula 0,0,5.00959,179532,1,0,966,1.06453e+06,229,501,2289,1.29622e+06,1129
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 182/182 transitions.
Graph (complete) has 299 edges and 168 vertex of which 149 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 148 transition count 141
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 119 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 118 transition count 140
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 61 place count 118 transition count 125
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 91 place count 103 transition count 125
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 98 place count 96 transition count 118
Iterating global reduction 3 with 7 rules applied. Total rules applied 105 place count 96 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 96 transition count 117
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 107 place count 95 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 91 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 91 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 87 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 87 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 83 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 83 transition count 101
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 159 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 68 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 67 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 66 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 66 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 65 transition count 82
Applied a total of 166 rules in 21 ms. Remains 65 /168 variables (removed 103) and now considering 82/182 (removed 100) transitions.
// Phase 1: matrix 82 rows 65 cols
[2024-05-22 10:38:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:38:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 10:38:19] [INFO ] Invariant cache hit.
[2024-05-22 10:38:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 10:38:19] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-22 10:38:19] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 10:38:19] [INFO ] Invariant cache hit.
[2024-05-22 10:38:19] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 82/146 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 39/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 106 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 82/146 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 39/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 80/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 186 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 2762ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2763ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/168 places, 82/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2893 ms. Remains : 65/168 places, 82/182 transitions.
[2024-05-22 10:38:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:38:22] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:38:22] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-22 10:38:22] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:38:22] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:38:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality4967679699757602252.gal : 1 ms
[2024-05-22 10:38:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality18380028673259083230.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/CTLCardinality4967679699757602252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18380028673259083230.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(A(!(AF(!(((p3==0)||(p169==1))))) U !(E((p80==0) U (p27==1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E((p80==0) U (p27==1))))) * !(!(!(EG(!(!(((p3==0)||(p169==1))))))))),(p80==0)) * (p27==1)...220
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t9, t11, t15, t17, t21, t23, t27, t29, t34, t36, t41, t80, Intersection with reachab...227
Hit Full ! (commute/partial/dont) 80/0/2
(forward)formula 0,1,4.61929,158440,1,0,700,884264,201,414,1997,1.11158e+06,835
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 10:38:26] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:38:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:38:26] [INFO ] Applying decomposition
[2024-05-22 10:38:26] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16780115976178282313.txt' '-o' '/tmp/graph16780115976178282313.bin' '-w' '/tmp/graph16780115976178282313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16780115976178282313.bin' '-l' '-1' '-v' '-w' '/tmp/graph16780115976178282313.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:38:26] [INFO ] Decomposing Gal with order
[2024-05-22 10:38:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:38:26] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-22 10:38:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:38:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 10:38:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality12533195645852225554.gal : 2 ms
[2024-05-22 10:38:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality16590756643316838700.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/CTLCardinality12533195645852225554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16590756643316838700.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98785e+09,0.299352,16280,1190,41,27442,270,386,40854,52,767,0


Converting to forward existential form...Done !
original formula: EF(EG(AX((i8.u18.p53==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!((i8.u18.p53==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t167, u57.t10, u57.t11, u57.t12, i2.u5.t111, i3.i0.u7.t113, i3.i1.u9.t176, i4.u3.t102, i4...633
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,1.97696,85184,1,0,189991,301,1861,261896,217,1103,355000
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG(((i23.u59.p183==0)&&(i17.u44.p130==1))) + AG((((AF(((i23.u23.p69!=0)&&(i22.u58.p176!=1))) + ((i1.u37.p87==0)&&((i12.u31.p96==0)||(i21...281
=> equivalent forward existential formula: ([FwdG(((FwdU((Init * !(!(E(TRUE U !(((i23.u59.p183==0)&&(i17.u44.p130==1))))))),TRUE) * !(((i9.u22.p62==0)||(i2...452
(forward)formula 1,0,7.44935,296024,1,0,628835,439,2665,1.00294e+06,254,1693,805768
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(!(E(A(!(((i6.u14.p39==0)||(i12.u30.p91==1))) U ((i14.i0.u35.p105==1)&&((i5.u12.p45==0)||(i23.u23.p68==1)))) U (EX((i16.u42.p124==1)) *...181
=> equivalent forward existential formula: [((FwdU(FwdU(Init,TRUE),!((E(!(((i14.i0.u35.p105==1)&&((i5.u12.p45==0)||(i23.u23.p68==1)))) U (!(!(((i6.u14.p39=...383
(forward)formula 2,1,16.7537,664356,1,0,1.41873e+06,459,2786,2.14971e+06,254,1784,1575572
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(!(E((E(AX(((i2.u4.p11==0)||(i20.i0.u52.p153==1))) U AX((i1.u21.p86==1))) + ((i2.u5.p14==1) * EF((i22.u56.p167==1)))) U (EX(((i15.u39.p...293
=> equivalent forward existential formula: [FwdG(Init,!(!(E((E(!(EX(!(((i2.u4.p11==0)||(i20.i0.u52.p153==1))))) U !(EX(!((i1.u21.p86==1))))) + ((i2.u5.p14=...356
(forward)formula 3,0,63.1166,2018220,1,0,4.07209e+06,474,2824,6.59611e+06,254,1948,3971064
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 571850 ms.

BK_STOP 1716374370339

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r136-tall-171631132500369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b 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 ;