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.r378-smll-171683811600481.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 SmartHome-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811600481
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 03:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 03:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 03:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 181K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717037442978

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 02:50:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 02:50:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:50:46] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2024-05-30 02:50:46] [INFO ] Transformed 741 places.
[2024-05-30 02:50:46] [INFO ] Transformed 809 transitions.
[2024-05-30 02:50:46] [INFO ] Found NUPN structural information;
[2024-05-30 02:50:46] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Deduced a syphon composed of 227 places in 26 ms
Reduce places removed 227 places and 198 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-19-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 496 transition count 611
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 138 place count 376 transition count 491
Iterating global reduction 1 with 120 rules applied. Total rules applied 258 place count 376 transition count 491
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 269 place count 376 transition count 480
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 294 place count 351 transition count 455
Iterating global reduction 2 with 25 rules applied. Total rules applied 319 place count 351 transition count 455
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 344 place count 326 transition count 430
Iterating global reduction 2 with 25 rules applied. Total rules applied 369 place count 326 transition count 430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 371 place count 326 transition count 428
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 380 place count 317 transition count 419
Iterating global reduction 3 with 9 rules applied. Total rules applied 389 place count 317 transition count 419
Applied a total of 389 rules in 262 ms. Remains 317 /514 variables (removed 197) and now considering 419/611 (removed 192) transitions.
// Phase 1: matrix 419 rows 317 cols
[2024-05-30 02:50:46] [INFO ] Computed 4 invariants in 34 ms
[2024-05-30 02:50:47] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-30 02:50:47] [INFO ] Invariant cache hit.
[2024-05-30 02:50:47] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-30 02:50:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 2/317 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 419/736 variables, 317/321 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(timeout
s287 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 736/736 variables, and 321 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 2/317 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 419/736 variables, 317/321 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 418/739 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (OVERLAPS) 0/736 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Int declared 736/736 variables, and 739 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 60421ms
Starting structural reductions in LTL mode, iteration 1 : 317/514 places, 419/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61844 ms. Remains : 317/514 places, 419/611 transitions.
Support contains 56 out of 317 places after structural reductions.
[2024-05-30 02:51:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 02:51:48] [INFO ] Flatten gal took : 123 ms
FORMULA SmartHome-PT-19-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:51:48] [INFO ] Flatten gal took : 50 ms
[2024-05-30 02:51:48] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 45 out of 317 places (down from 56) after GAL structural reductions.
RANDOM walk for 40000 steps (107 resets) in 2003 ms. (19 steps per ms) remains 1/30 properties
BEST_FIRST walk for 33281 steps (7 resets) in 337 ms. (98 steps per ms) remains 0/1 properties
[2024-05-30 02:51:49] [INFO ] Flatten gal took : 33 ms
[2024-05-30 02:51:49] [INFO ] Flatten gal took : 35 ms
[2024-05-30 02:51:49] [INFO ] Input system was already deterministic with 419 transitions.
Computed a total of 54 stabilizing places and 53 stable transitions
Graph (complete) has 488 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Graph (trivial) has 316 edges and 317 vertex of which 167 / 317 are part of one of the 15 SCC in 5 ms
Free SCC test removed 152 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Graph (complete) has 288 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 163 transition count 169
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 112 transition count 161
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 108 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 106 transition count 159
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 120 place count 106 transition count 153
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 132 place count 100 transition count 153
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 140 place count 92 transition count 143
Iterating global reduction 4 with 8 rules applied. Total rules applied 148 place count 92 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 92 transition count 142
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 219 place count 57 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 221 place count 57 transition count 104
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 223 place count 55 transition count 99
Iterating global reduction 6 with 2 rules applied. Total rules applied 225 place count 55 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 229 place count 53 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 248 place count 53 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 249 place count 52 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 249 place count 52 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 251 place count 51 transition count 77
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 253 place count 49 transition count 73
Iterating global reduction 7 with 2 rules applied. Total rules applied 255 place count 49 transition count 73
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 258 place count 49 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 260 place count 49 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 261 place count 48 transition count 70
Applied a total of 261 rules in 98 ms. Remains 48 /317 variables (removed 269) and now considering 70/419 (removed 349) transitions.
[2024-05-30 02:51:50] [INFO ] Flow matrix only has 60 transitions (discarded 10 similar events)
// Phase 1: matrix 60 rows 48 cols
[2024-05-30 02:51:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 02:51:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 02:51:50] [INFO ] Flow matrix only has 60 transitions (discarded 10 similar events)
[2024-05-30 02:51:50] [INFO ] Invariant cache hit.
[2024-05-30 02:51:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-30 02:51:50] [INFO ] Redundant transitions in 39 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 02:51:50] [INFO ] Flow matrix only has 60 transitions (discarded 10 similar events)
[2024-05-30 02:51:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 52/91 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 12/103 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/108 variables, and 48 constraints, problems are : Problem set: 0 solved, 36 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/48 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 52/91 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 23/64 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 12/103 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 1/104 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (OVERLAPS) 1/105 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 14 (OVERLAPS) 0/105 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/108 variables, and 85 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/48 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 2177ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2178ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/317 places, 70/419 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2451 ms. Remains : 48/317 places, 70/419 transitions.
[2024-05-30 02:51:52] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:51:52] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:51:52] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-30 02:51:52] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:51:52] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:51:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4517849045512098451.gal : 2 ms
[2024-05-30 02:51:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16084539772340245543.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4517849045512098451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16084539772340245543.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.14463e+09,0.023918,3592,2,131,5,842,6,0,237,716,0


Converting to forward existential form...Done !
original formula: (AG(((EG((p272==0)) * E((p170==1) U (p75==0))) * (((p214==0)||(p509==1))||((((p433==0)||(p35==1))&&(p494==1))&&((p539==0)||(p480==1))))))...227
=> equivalent forward existential formula: (([(FwdU((Init * !(!(!((E(!(E(TRUE U (((p76==0)&&((p410==0)||(p395==1)))||(p78!=1)))) U (!((p213!=1)) * !(E(TRUE...943
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t16, t21, t27, t33, t36, t48, t54, t62, t63, Intersection with reachable at each st...214
(forward)formula 0,0,0.076819,5524,1,0,109,10855,162,64,1441,9311,144
FORMULA SmartHome-PT-19-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Graph (trivial) has 344 edges and 317 vertex of which 202 / 317 are part of one of the 16 SCC in 1 ms
Free SCC test removed 186 places
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 transitions.
Graph (complete) has 240 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 129 transition count 130
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 53 rules applied. Total rules applied 98 place count 86 transition count 120
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 104 place count 81 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 80 transition count 119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 105 place count 80 transition count 116
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 111 place count 77 transition count 116
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 123 place count 65 transition count 101
Iterating global reduction 4 with 12 rules applied. Total rules applied 135 place count 65 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 65 transition count 99
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 64 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 64 transition count 96
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 203 place count 32 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 204 place count 32 transition count 63
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 207 place count 29 transition count 51
Iterating global reduction 6 with 3 rules applied. Total rules applied 210 place count 29 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 212 place count 28 transition count 50
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 213 place count 27 transition count 46
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 227 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 229 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 229 place count 25 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 231 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 233 place count 22 transition count 28
Iterating global reduction 7 with 2 rules applied. Total rules applied 235 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 236 place count 21 transition count 27
Applied a total of 236 rules in 28 ms. Remains 21 /317 variables (removed 296) and now considering 27/419 (removed 392) transitions.
[2024-05-30 02:51:52] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2024-05-30 02:51:52] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 02:51:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 02:51:52] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:51:52] [INFO ] Invariant cache hit.
[2024-05-30 02:51:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-30 02:51:52] [INFO ] Redundant transitions in 37 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 02:51:52] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:51:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/39 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/42 variables, and 21 constraints, problems are : Problem set: 0 solved, 11 unsolved in 164 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4/39 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 325 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 499ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 499ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/317 places, 27/419 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 649 ms. Remains : 21/317 places, 27/419 transitions.
[2024-05-30 02:51:53] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:51:53] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:51:53] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-30 02:51:53] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:51:53] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:51:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17804619705819924119.gal : 1 ms
[2024-05-30 02:51:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9013788774538123655.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/CTLCardinality17804619705819924119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9013788774538123655.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,119232,0.00844,3444,2,55,5,365,6,0,93,352,0


Converting to forward existential form...Done !
original formula: AF(AG((p197==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p197==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t14, t16, t19, t21, Intersection with reachable at each step enabled. (destroyed/revers...184
(forward)formula 0,0,0.071681,4816,1,0,113,8390,75,84,571,11945,119
FORMULA SmartHome-PT-19-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 419
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 290 transition count 393
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 290 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 290 transition count 391
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 282 transition count 383
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 282 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 282 transition count 382
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 276 transition count 376
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 276 transition count 376
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 273 transition count 373
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 273 transition count 373
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 272 transition count 372
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 272 transition count 372
Applied a total of 92 rules in 42 ms. Remains 272 /317 variables (removed 45) and now considering 372/419 (removed 47) transitions.
// Phase 1: matrix 372 rows 272 cols
[2024-05-30 02:51:53] [INFO ] Computed 3 invariants in 7 ms
[2024-05-30 02:51:53] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-30 02:51:53] [INFO ] Invariant cache hit.
[2024-05-30 02:51:53] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-05-30 02:51:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/644 variables, 272/275 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/644 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 275 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/644 variables, 272/275 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 371/646 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 0/644 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 646 constraints, problems are : Problem set: 0 solved, 371 unsolved in 24230 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
After SMT, in 54319ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 54325ms
Starting structural reductions in LTL mode, iteration 1 : 272/317 places, 372/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54836 ms. Remains : 272/317 places, 372/419 transitions.
[2024-05-30 02:52:48] [INFO ] Flatten gal took : 33 ms
[2024-05-30 02:52:48] [INFO ] Flatten gal took : 26 ms
[2024-05-30 02:52:48] [INFO ] Input system was already deterministic with 372 transitions.
[2024-05-30 02:52:48] [INFO ] Flatten gal took : 25 ms
[2024-05-30 02:52:48] [INFO ] Flatten gal took : 25 ms
[2024-05-30 02:52:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality7498889914130940859.gal : 17 ms
[2024-05-30 02:52:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality4240010513596327932.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/CTLCardinality7498889914130940859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4240010513596327932.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.80758e+21,2.09284,54816,2,7940,5,251124,6,0,1446,239629,0


Converting to forward existential form...Done !
original formula: AX(EX(EX(EF(EG((p395==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(EX(E(TRUE U EG((p395==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t147, t150, t167, t182, t202, t217,...316
(forward)formula 0,1,18.0218,396648,1,0,484,2.13591e+06,771,342,8420,1.82226e+06,835
FORMULA SmartHome-PT-19-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 419
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 290 transition count 393
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 290 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 290 transition count 391
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 282 transition count 383
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 282 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 282 transition count 382
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 276 transition count 376
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 276 transition count 376
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 273 transition count 373
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 273 transition count 373
Applied a total of 90 rules in 35 ms. Remains 273 /317 variables (removed 44) and now considering 373/419 (removed 46) transitions.
// Phase 1: matrix 373 rows 273 cols
[2024-05-30 02:53:06] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:53:06] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 02:53:06] [INFO ] Invariant cache hit.
[2024-05-30 02:53:06] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-30 02:53:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 276 constraints, problems are : Problem set: 0 solved, 372 unsolved in 26614 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 372/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (OVERLAPS) 0/646 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 648 constraints, problems are : Problem set: 0 solved, 372 unsolved in 19990 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints]
After SMT, in 46698ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 46706ms
Starting structural reductions in LTL mode, iteration 1 : 273/317 places, 373/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47082 ms. Remains : 273/317 places, 373/419 transitions.
[2024-05-30 02:53:53] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:53:53] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:53:53] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-30 02:53:53] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:53:53] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:53:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14994851612609545528.gal : 3 ms
[2024-05-30 02:53:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality7208017463591469718.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/CTLCardinality14994851612609545528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7208017463591469718.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95312e+21,2.53284,66744,2,10017,5,295616,6,0,1451,302389,0


Converting to forward existential form...Done !
original formula: EG((EG(EX((p79==0))) * AG((p605==0))))
=> equivalent forward existential formula: [FwdG(Init,(EG(EX((p79==0))) * !(E(TRUE U !((p605==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t60, t92, t95, t112, t115, t132, t135, t147, t150, t167, t182, t202, t...326
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,27.1572,577836,1,0,490,3.29066e+06,781,351,8918,2.97314e+06,836
FORMULA SmartHome-PT-19-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Graph (trivial) has 329 edges and 317 vertex of which 179 / 317 are part of one of the 16 SCC in 1 ms
Free SCC test removed 163 places
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Graph (complete) has 272 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 152 transition count 156
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 61 rules applied. Total rules applied 112 place count 103 transition count 144
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 121 place count 97 transition count 141
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 124 place count 94 transition count 141
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 124 place count 94 transition count 137
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 132 place count 90 transition count 137
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 140 place count 82 transition count 129
Iterating global reduction 4 with 8 rules applied. Total rules applied 148 place count 82 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 82 transition count 127
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 81 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 81 transition count 124
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 214 place count 50 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 216 place count 50 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 49 transition count 86
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 49 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 46 transition count 80
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 46 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 240 place count 46 transition count 64
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 242 place count 44 transition count 60
Iterating global reduction 6 with 2 rules applied. Total rules applied 244 place count 44 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 42 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 247 place count 41 transition count 58
Applied a total of 247 rules in 32 ms. Remains 41 /317 variables (removed 276) and now considering 58/419 (removed 361) transitions.
[2024-05-30 02:54:21] [INFO ] Flow matrix only has 48 transitions (discarded 10 similar events)
// Phase 1: matrix 48 rows 41 cols
[2024-05-30 02:54:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 02:54:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 02:54:21] [INFO ] Flow matrix only has 48 transitions (discarded 10 similar events)
[2024-05-30 02:54:21] [INFO ] Invariant cache hit.
[2024-05-30 02:54:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-30 02:54:21] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-30 02:54:21] [INFO ] Redundant transitions in 25 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-30 02:54:21] [INFO ] Flow matrix only has 48 transitions (discarded 10 similar events)
[2024-05-30 02:54:21] [INFO ] Invariant cache hit.
[2024-05-30 02:54:21] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 45/82 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 4/86 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/89 variables, and 48 constraints, problems are : Problem set: 0 solved, 48 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/41 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 45/82 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 46/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 4/86 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/87 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 1/88 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (OVERLAPS) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 97 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2784ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2785ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/317 places, 58/419 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2935 ms. Remains : 41/317 places, 58/419 transitions.
[2024-05-30 02:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:54:23] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:54:24] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-30 02:54:24] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:54:24] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:54:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9148845991613564033.gal : 2 ms
[2024-05-30 02:54:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3079219148523798414.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/CTLCardinality9148845991613564033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3079219148523798414.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.96105e+07,0.018141,3620,2,185,5,901,6,0,200,757,0


Converting to forward existential form...Done !
original formula: AG((E((!(AG(((p654==0)||(p301==1)))) + !(E((p654==1) U ((p334==0)||(p723==1))))) U EF((((p353==0)&&((p433==0)||(p45==1)))||(p124!=0)))) +...207
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E((!(!(E(TRUE U !(((p654==0)||(p301==1)))))) + !(E((p654==1) U ((p334==0)||(p723==1))...298
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t13, t15, t16, t20, t22, t25, t30, t32, t36, t38, t40, t42, t45, t56, Intersection w...238
(forward)formula 0,1,0.486589,14632,1,0,328,67863,151,173,1207,90925,365
FORMULA SmartHome-PT-19-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Graph (trivial) has 342 edges and 317 vertex of which 194 / 317 are part of one of the 16 SCC in 1 ms
Free SCC test removed 178 places
Ensure Unique test removed 235 transitions
Reduce isomorphic transitions removed 235 transitions.
Graph (complete) has 250 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 137 transition count 135
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 61 rules applied. Total rules applied 111 place count 89 transition count 122
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 119 place count 82 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 81 transition count 121
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 120 place count 81 transition count 118
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 78 transition count 118
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 137 place count 67 transition count 104
Iterating global reduction 4 with 11 rules applied. Total rules applied 148 place count 67 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 67 transition count 102
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 218 place count 33 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 33 transition count 67
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 222 place count 30 transition count 55
Iterating global reduction 6 with 3 rules applied. Total rules applied 225 place count 30 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 29 transition count 54
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 228 place count 28 transition count 50
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 28 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 242 place count 28 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 27 transition count 37
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 245 place count 25 transition count 33
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 25 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 23 transition count 31
Applied a total of 249 rules in 28 ms. Remains 23 /317 variables (removed 294) and now considering 31/419 (removed 388) transitions.
[2024-05-30 02:54:24] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
// Phase 1: matrix 24 rows 23 cols
[2024-05-30 02:54:24] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 02:54:24] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 02:54:24] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2024-05-30 02:54:24] [INFO ] Invariant cache hit.
[2024-05-30 02:54:24] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-30 02:54:24] [INFO ] Redundant transitions in 37 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-30 02:54:24] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2024-05-30 02:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 20/39 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/42 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/47 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 20/39 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/42 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/43 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/44 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/47 variables, and 36 constraints, problems are : Problem set: 0 solved, 12 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 636ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/317 places, 31/419 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 806 ms. Remains : 23/317 places, 31/419 transitions.
[2024-05-30 02:54:25] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:54:25] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:54:25] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-30 02:54:25] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:54:25] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:54:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality4643318873773900155.gal : 1 ms
[2024-05-30 02:54:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13704307260193906170.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/CTLCardinality4643318873773900155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13704307260193906170.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,264960,0.008825,3476,2,60,5,355,6,0,102,347,0


Converting to forward existential form...Done !
original formula: (AF(AG((p218==0))) + EF((p609==1)))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (p609==1)))),!(!(E(TRUE U !((p218==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t18, t20, t23, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
(forward)formula 0,1,0.037327,4320,1,0,64,4567,83,31,610,4039,74
FORMULA SmartHome-PT-19-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 419
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 292 transition count 395
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 292 transition count 395
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 292 transition count 393
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 285 transition count 386
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 285 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 285 transition count 385
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 71 place count 280 transition count 380
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 280 transition count 380
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 278 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 278 transition count 378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 277 transition count 377
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 277 transition count 377
Applied a total of 82 rules in 35 ms. Remains 277 /317 variables (removed 40) and now considering 377/419 (removed 42) transitions.
// Phase 1: matrix 377 rows 277 cols
[2024-05-30 02:54:25] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:54:25] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-30 02:54:25] [INFO ] Invariant cache hit.
[2024-05-30 02:54:25] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-05-30 02:54:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 377/654 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/654 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 280 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 377/654 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 376/656 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (OVERLAPS) 0/654 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 656 constraints, problems are : Problem set: 0 solved, 376 unsolved in 22599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
After SMT, in 52698ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 52705ms
Starting structural reductions in LTL mode, iteration 1 : 277/317 places, 377/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53192 ms. Remains : 277/317 places, 377/419 transitions.
[2024-05-30 02:55:18] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:55:18] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:55:18] [INFO ] Input system was already deterministic with 377 transitions.
[2024-05-30 02:55:18] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:55:18] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:55:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality18117820741461845146.gal : 2 ms
[2024-05-30 02:55:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15961080258719390351.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/CTLCardinality18117820741461845146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15961080258719390351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.51602e+21,2.31142,55632,2,8192,5,256890,6,0,1471,241967,0


Converting to forward existential form...Done !
original formula: AG((AF((EG((p87==1)) + AX(FALSE))) + !(A(EG(EF((p383==0))) U !(((p82!=1) * AG((p318==0))))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(!((E(!(!(((p82!=1) * !(E(TRUE U !((p318==0))))))) U (!(EG(E(TRUE U (p383==0)))) * !...302
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t135, t147, t150, t167, t182, t206, t221,...316
Detected timeout of ITS tools.
[2024-05-30 02:55:48] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:55:48] [INFO ] Applying decomposition
[2024-05-30 02:55:48] [INFO ] Flatten gal took : 10 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/graph1808357549641831109.txt' '-o' '/tmp/graph1808357549641831109.bin' '-w' '/tmp/graph1808357549641831109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1808357549641831109.bin' '-l' '-1' '-v' '-w' '/tmp/graph1808357549641831109.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:55:48] [INFO ] Decomposing Gal with order
[2024-05-30 02:55:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:55:49] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-30 02:55:49] [INFO ] Flatten gal took : 79 ms
[2024-05-30 02:55:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2024-05-30 02:55:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality4648793189334266048.gal : 11 ms
[2024-05-30 02:55:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1067888260781794025.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/CTLCardinality4648793189334266048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1067888260781794025.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.51602e+21,0.176137,8192,607,47,8098,763,554,12900,64,2265,0


Converting to forward existential form...Done !
original formula: AG((AF((EG((i2.i3.u16.p87==1)) + AX(FALSE))) + !(A(EG(EF((i11.u64.p383==0))) U !(((i2.i1.u14.p82!=1) * AG((i15.i1.u52.p318==0))))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(!((E(!(!(((i2.i1.u14.p82!=1) * !(E(TRUE U !((i15.i1.u52.p318==0))))))) U (!(EG(E(TR...383
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t150, i0.i0.u1.t341, i0.i1.u104.t8, i0.i2.u102.t27, i1.u42.t221, i2.i2.u...500
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,6.26041,156032,1,0,306862,796,4015,422621,328,3148,315388
FORMULA SmartHome-PT-19-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Graph (trivial) has 340 edges and 317 vertex of which 194 / 317 are part of one of the 16 SCC in 1 ms
Free SCC test removed 178 places
Ensure Unique test removed 235 transitions
Reduce isomorphic transitions removed 235 transitions.
Graph (complete) has 250 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 137 transition count 138
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 51 rules applied. Total rules applied 98 place count 92 transition count 132
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 103 place count 89 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 87 transition count 130
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 105 place count 87 transition count 125
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 115 place count 82 transition count 125
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 126 place count 71 transition count 111
Iterating global reduction 4 with 11 rules applied. Total rules applied 137 place count 71 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 71 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 70 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 70 transition count 106
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 209 place count 36 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 36 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 214 place count 35 transition count 68
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 215 place count 34 transition count 64
Iterating global reduction 7 with 1 rules applied. Total rules applied 216 place count 34 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 220 place count 32 transition count 62
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 221 place count 31 transition count 58
Iterating global reduction 7 with 1 rules applied. Total rules applied 222 place count 31 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 237 place count 31 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 238 place count 30 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 238 place count 30 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 240 place count 29 transition count 42
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 242 place count 27 transition count 38
Iterating global reduction 8 with 2 rules applied. Total rules applied 244 place count 27 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 27 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 246 place count 27 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 247 place count 26 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 248 place count 25 transition count 36
Applied a total of 248 rules in 22 ms. Remains 25 /317 variables (removed 292) and now considering 36/419 (removed 383) transitions.
[2024-05-30 02:55:55] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
// Phase 1: matrix 28 rows 25 cols
[2024-05-30 02:55:55] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 02:55:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 02:55:55] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
[2024-05-30 02:55:55] [INFO ] Invariant cache hit.
[2024-05-30 02:55:55] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-30 02:55:55] [INFO ] Redundant transitions in 29 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 02:55:55] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
[2024-05-30 02:55:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 23/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 7/50 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/53 variables, and 25 constraints, problems are : Problem set: 0 solved, 14 unsolved in 217 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 23/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 7/50 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/53 variables, and 39 constraints, problems are : Problem set: 0 solved, 14 unsolved in 241 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 463ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 464ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/317 places, 36/419 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 612 ms. Remains : 25/317 places, 36/419 transitions.
[2024-05-30 02:55:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:55:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:55:56] [INFO ] Input system was already deterministic with 36 transitions.
[2024-05-30 02:55:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:55:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:55:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality3101068845946296917.gal : 1 ms
[2024-05-30 02:55:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality16981513397591196108.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/CTLCardinality3101068845946296917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16981513397591196108.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,715392,0.010694,3516,2,67,5,360,6,0,114,340,0


Converting to forward existential form...Done !
original formula: AG(EF(((p576==1)&&((p239==0)||(p502==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p576==1)&&((p239==0)||(p502==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t16, t20, t22, t25, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,0,0.037935,4100,1,0,64,4302,84,32,655,3562,73
FORMULA SmartHome-PT-19-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 419
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 289 transition count 392
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 289 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 289 transition count 390
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 281 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 281 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 281 transition count 381
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 276 transition count 376
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 276 transition count 376
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 274 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 274 transition count 374
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 273 transition count 373
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 273 transition count 373
Applied a total of 90 rules in 42 ms. Remains 273 /317 variables (removed 44) and now considering 373/419 (removed 46) transitions.
// Phase 1: matrix 373 rows 273 cols
[2024-05-30 02:55:56] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:55:56] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 02:55:56] [INFO ] Invariant cache hit.
[2024-05-30 02:55:56] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-30 02:55:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 276 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 372/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (OVERLAPS) 0/646 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 648 constraints, problems are : Problem set: 0 solved, 372 unsolved in 24128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints]
After SMT, in 54223ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 54231ms
Starting structural reductions in LTL mode, iteration 1 : 273/317 places, 373/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54733 ms. Remains : 273/317 places, 373/419 transitions.
[2024-05-30 02:56:50] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:56:50] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:56:50] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-30 02:56:50] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:56:50] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:56:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality226285507575756293.gal : 8 ms
[2024-05-30 02:56:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11037371740013888767.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/CTLCardinality226285507575756293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11037371740013888767.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.03969e+21,2.38229,54904,2,7903,5,252132,6,0,1451,239335,0


Converting to forward existential form...Done !
original formula: EF(EX(AX((p134==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!((p134==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...316
(forward)formula 0,1,17.7452,335280,1,0,425,1.64026e+06,763,314,7981,1.60739e+06,754
FORMULA SmartHome-PT-19-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Graph (trivial) has 344 edges and 317 vertex of which 202 / 317 are part of one of the 16 SCC in 0 ms
Free SCC test removed 186 places
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 130 transition count 129
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 54 rules applied. Total rules applied 99 place count 86 transition count 119
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 104 place count 81 transition count 119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 104 place count 81 transition count 116
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 78 transition count 116
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 122 place count 66 transition count 101
Iterating global reduction 3 with 12 rules applied. Total rules applied 134 place count 66 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 66 transition count 99
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 200 place count 34 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 34 transition count 66
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 204 place count 31 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 207 place count 31 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 30 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 29 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 29 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 225 place count 29 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 227 place count 27 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 227 place count 27 transition count 33
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 231 place count 25 transition count 33
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 233 place count 23 transition count 29
Iterating global reduction 6 with 2 rules applied. Total rules applied 235 place count 23 transition count 29
Applied a total of 235 rules in 15 ms. Remains 23 /317 variables (removed 294) and now considering 29/419 (removed 390) transitions.
[2024-05-30 02:57:08] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
// Phase 1: matrix 22 rows 23 cols
[2024-05-30 02:57:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 02:57:08] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 02:57:08] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2024-05-30 02:57:08] [INFO ] Invariant cache hit.
[2024-05-30 02:57:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 02:57:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-30 02:57:08] [INFO ] Redundant transitions in 23 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-30 02:57:08] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2024-05-30 02:57:08] [INFO ] Invariant cache hit.
[2024-05-30 02:57:08] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 21/44 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 37 constraints, problems are : Problem set: 0 solved, 28 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 21/44 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 65 constraints, problems are : Problem set: 0 solved, 28 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1127ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1127ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/317 places, 29/419 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1257 ms. Remains : 23/317 places, 29/419 transitions.
[2024-05-30 02:57:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:57:10] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:57:10] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 02:57:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:57:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:57:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality12729089350718653000.gal : 1 ms
[2024-05-30 02:57:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality6611412609281794069.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/CTLCardinality12729089350718653000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6611412609281794069.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,88325,0.012532,3488,2,86,5,545,6,0,104,575,0


Converting to forward existential form...Done !
original formula: AG(EF(!(E((p200!=0) U (p42==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((p200!=0) U (p42==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t10, t14, t16, t18, t21, t25, t27, Intersection with reachable at each s...215
(forward)formula 0,1,0.036841,4072,1,0,76,3409,75,36,662,3110,72
FORMULA SmartHome-PT-19-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 419
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 289 transition count 392
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 289 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 289 transition count 390
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 281 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 281 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 281 transition count 381
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 80 place count 275 transition count 375
Iterating global reduction 3 with 6 rules applied. Total rules applied 86 place count 275 transition count 375
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 272 transition count 372
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 271 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 271 transition count 371
Applied a total of 94 rules in 43 ms. Remains 271 /317 variables (removed 46) and now considering 371/419 (removed 48) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-05-30 02:57:10] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:57:10] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-30 02:57:10] [INFO ] Invariant cache hit.
[2024-05-30 02:57:10] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-05-30 02:57:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 24126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 54215ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 54223ms
Starting structural reductions in LTL mode, iteration 1 : 271/317 places, 371/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54722 ms. Remains : 271/317 places, 371/419 transitions.
[2024-05-30 02:58:04] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:58:04] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:58:04] [INFO ] Input system was already deterministic with 371 transitions.
[2024-05-30 02:58:04] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:58:04] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:58:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11513712600510636619.gal : 3 ms
[2024-05-30 02:58:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality15603609128746615235.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/CTLCardinality11513712600510636619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15603609128746615235.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57362e+21,2.71333,59280,2,8184,5,262962,6,0,1441,252928,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((AX(FALSE) * (p86==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((!(EX(!(FALSE))) * (p86==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...316
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-30 02:58:35] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:58:35] [INFO ] Applying decomposition
[2024-05-30 02:58:35] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8710711582802515012.txt' '-o' '/tmp/graph8710711582802515012.bin' '-w' '/tmp/graph8710711582802515012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8710711582802515012.bin' '-l' '-1' '-v' '-w' '/tmp/graph8710711582802515012.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:58:35] [INFO ] Decomposing Gal with order
[2024-05-30 02:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:58:35] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-30 02:58:35] [INFO ] Flatten gal took : 25 ms
[2024-05-30 02:58:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 02:58:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9860083205327447408.gal : 5 ms
[2024-05-30 02:58:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2322937439571166930.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/CTLCardinality9860083205327447408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2322937439571166930.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57362e+21,0.177818,8684,460,43,9876,875,551,16030,63,2591,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((AX(FALSE) * (i2.i3.u15.p86==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((!(EX(!(FALSE))) * (i2.i3.u15.p86==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i0.i0.u104.t8, i1.u24.t286, i2.i1.u1.t335, i2.i2.u19.t332, i...490
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 419
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 289 transition count 392
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 289 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 289 transition count 390
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 281 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 281 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 281 transition count 381
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 80 place count 275 transition count 375
Iterating global reduction 3 with 6 rules applied. Total rules applied 86 place count 275 transition count 375
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 272 transition count 372
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 271 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 271 transition count 371
Applied a total of 94 rules in 23 ms. Remains 271 /317 variables (removed 46) and now considering 371/419 (removed 48) transitions.
[2024-05-30 02:59:05] [INFO ] Invariant cache hit.
[2024-05-30 02:59:05] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 02:59:05] [INFO ] Invariant cache hit.
[2024-05-30 02:59:05] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-05-30 02:59:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 27564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25348 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 52964ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 52969ms
Starting structural reductions in LTL mode, iteration 1 : 271/317 places, 371/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53282 ms. Remains : 271/317 places, 371/419 transitions.
[2024-05-30 02:59:58] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:59:58] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:59:58] [INFO ] Input system was already deterministic with 371 transitions.
[2024-05-30 02:59:58] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:59:58] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:59:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13587222774474615801.gal : 2 ms
[2024-05-30 02:59:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14302616212447041325.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/CTLCardinality13587222774474615801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14302616212447041325.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57362e+21,2.46565,59016,2,8184,5,262962,6,0,1441,252928,0


Converting to forward existential form...Done !
original formula: EG(AG(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(EX(TRUE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...316
Detected timeout of ITS tools.
[2024-05-30 03:00:28] [INFO ] Flatten gal took : 12 ms
[2024-05-30 03:00:28] [INFO ] Applying decomposition
[2024-05-30 03:00:28] [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/graph5140200811617747905.txt' '-o' '/tmp/graph5140200811617747905.bin' '-w' '/tmp/graph5140200811617747905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5140200811617747905.bin' '-l' '-1' '-v' '-w' '/tmp/graph5140200811617747905.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:00:28] [INFO ] Decomposing Gal with order
[2024-05-30 03:00:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:00:28] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 03:00:28] [INFO ] Flatten gal took : 20 ms
[2024-05-30 03:00:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-30 03:00:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15423682532219253391.gal : 4 ms
[2024-05-30 03:00:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14945661473838224213.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/CTLCardinality15423682532219253391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14945661473838224213.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57362e+21,0.258802,9172,423,38,10225,826,569,16259,58,2407,0


Converting to forward existential form...Done !
original formula: EG(AG(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(EX(TRUE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i0.u1.t335, i1.u8.t332, i2.u23.t301, i3.u27.t286, i4.u33.t27...482
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,0.759815,18940,1,0,26946,826,3792,62721,282,2407,80818
FORMULA SmartHome-PT-19-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 419/419 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 419
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 291 transition count 394
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 291 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 291 transition count 392
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 284 transition count 385
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 284 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 284 transition count 384
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 73 place count 279 transition count 379
Iterating global reduction 3 with 5 rules applied. Total rules applied 78 place count 279 transition count 379
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 276 transition count 376
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 276 transition count 376
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 275 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 275 transition count 375
Applied a total of 86 rules in 25 ms. Remains 275 /317 variables (removed 42) and now considering 375/419 (removed 44) transitions.
// Phase 1: matrix 375 rows 275 cols
[2024-05-30 03:00:29] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 03:00:29] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-30 03:00:29] [INFO ] Invariant cache hit.
[2024-05-30 03:00:29] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2024-05-30 03:00:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/650 variables, 275/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 278 constraints, problems are : Problem set: 0 solved, 374 unsolved in 25872 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/650 variables, 275/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 374/652 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (OVERLAPS) 0/650 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 652 constraints, problems are : Problem set: 0 solved, 374 unsolved in 20006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints]
After SMT, in 45924ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 45931ms
Starting structural reductions in LTL mode, iteration 1 : 275/317 places, 375/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46296 ms. Remains : 275/317 places, 375/419 transitions.
[2024-05-30 03:01:15] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:01:15] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:01:15] [INFO ] Input system was already deterministic with 375 transitions.
[2024-05-30 03:01:15] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:01:15] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:01:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality9446484132826452843.gal : 2 ms
[2024-05-30 03:01:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality14731184127012015647.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/CTLCardinality9446484132826452843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14731184127012015647.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.29347e+21,2.99788,65196,2,9226,5,295326,6,0,1461,284508,0


Converting to forward existential form...Done !
original formula: AX(E(AX(FALSE) U E(((p357==0)||(p281==1)) U ((p500==0)||(p440==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EX(!(FALSE))) U E(((p357==0)||(p281==1)) U ((p500==0)||(p440==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t91, t94, t111, t114, t116, t132, t135, t147, t150, t170, t185, t...326
(forward)formula 0,1,23.3615,403256,1,0,439,1.96665e+06,773,324,8002,2.06733e+06,774
FORMULA SmartHome-PT-19-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 03:01:39] [INFO ] Flatten gal took : 13 ms
[2024-05-30 03:01:39] [INFO ] Flatten gal took : 13 ms
[2024-05-30 03:01:39] [INFO ] Applying decomposition
[2024-05-30 03:01:39] [INFO ] Flatten gal took : 12 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/graph4200539655704105512.txt' '-o' '/tmp/graph4200539655704105512.bin' '-w' '/tmp/graph4200539655704105512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4200539655704105512.bin' '-l' '-1' '-v' '-w' '/tmp/graph4200539655704105512.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:01:39] [INFO ] Decomposing Gal with order
[2024-05-30 03:01:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:01:39] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-30 03:01:39] [INFO ] Flatten gal took : 35 ms
[2024-05-30 03:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-30 03:01:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16284987456763925742.gal : 6 ms
[2024-05-30 03:01:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality12960720640187193060.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/CTLCardinality16284987456763925742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12960720640187193060.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.65438e+22,0.440165,11596,784,52,14118,721,697,30506,62,2560,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((AX(FALSE) * (i2.i3.u13.p86==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((!(EX(!(FALSE))) * (i2.i3.u13.p86==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t110, t130, t168, t192, i0.i0.u1.t379, i0.i0.u1.t380, i0.i0.u1.t381, i1.t271, i2.i0....812
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,998.264,2825172,1,0,4.09123e+06,721,1416,6.7714e+06,120,2560,2868520
FORMULA SmartHome-PT-19-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1652943 ms.

BK_STOP 1717039098551

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-19"
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 SmartHome-PT-19, 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 r378-smll-171683811600481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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