Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901995100809.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SmartHome-PT-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901995100809
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 120K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749250580870

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 22:56:22] [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]
[2025-06-06 22:56:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:56:22] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-06 22:56:22] [INFO ] Transformed 499 places.
[2025-06-06 22:56:22] [INFO ] Transformed 533 transitions.
[2025-06-06 22:56:22] [INFO ] Found NUPN structural information;
[2025-06-06 22:56:22] [INFO ] Parsed PT model containing 499 places and 533 transitions and 1222 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 156 places in 5 ms
Reduce places removed 156 places and 129 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-16-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 404/404 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 332 transition count 404
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 92 place count 251 transition count 323
Iterating global reduction 1 with 81 rules applied. Total rules applied 173 place count 251 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 177 place count 251 transition count 319
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 192 place count 236 transition count 304
Iterating global reduction 2 with 15 rules applied. Total rules applied 207 place count 236 transition count 304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 216 place count 227 transition count 295
Iterating global reduction 2 with 9 rules applied. Total rules applied 225 place count 227 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 227 transition count 294
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 228 place count 225 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 225 transition count 292
Applied a total of 230 rules in 76 ms. Remains 225 /343 variables (removed 118) and now considering 292/404 (removed 112) transitions.
// Phase 1: matrix 292 rows 225 cols
[2025-06-06 22:56:22] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:56:22] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-06 22:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:56:22] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2025-06-06 22:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 3/225 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/517 variables, 225/230 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:56:30] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 0/517 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 231 constraints, problems are : Problem set: 0 solved, 291 unsolved in 19671 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 3/225 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 292/517 variables, 225/231 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 291/522 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:56:47] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:56:48] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:56:48] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 3/525 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:56:52] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:57:00] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 527 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49792ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 49803ms
Starting structural reductions in LTL mode, iteration 1 : 225/343 places, 292/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50294 ms. Remains : 225/343 places, 292/404 transitions.
Support contains 48 out of 225 places after structural reductions.
[2025-06-06 22:57:12] [INFO ] Flatten gal took : 36 ms
[2025-06-06 22:57:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SmartHome-PT-16-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:57:12] [INFO ] Flatten gal took : 16 ms
[2025-06-06 22:57:12] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 35 out of 225 places (down from 48) after GAL structural reductions.
RANDOM walk for 33187 steps (133 resets) in 663 ms. (49 steps per ms) remains 0/28 properties
[2025-06-06 22:57:13] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:57:13] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:57:13] [INFO ] Input system was already deterministic with 292 transitions.
Computed a total of 53 stabilizing places and 52 stable transitions
Graph (complete) has 352 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Graph (trivial) has 225 edges and 225 vertex of which 95 / 225 are part of one of the 9 SCC in 2 ms
Free SCC test removed 86 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Graph (complete) has 236 edges and 139 vertex of which 137 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 136 transition count 133
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 49 rules applied. Total rules applied 94 place count 93 transition count 127
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 89 transition count 125
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 88 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 103 place count 87 transition count 124
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 103 place count 87 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 115 place count 81 transition count 118
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 127 place count 69 transition count 105
Iterating global reduction 5 with 12 rules applied. Total rules applied 139 place count 69 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 142 place count 69 transition count 102
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 198 place count 41 transition count 73
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 204 place count 41 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 208 place count 40 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 210 place count 38 transition count 64
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 211 place count 37 transition count 63
Iterating global reduction 9 with 1 rules applied. Total rules applied 212 place count 37 transition count 63
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 9 with 4 rules applied. Total rules applied 216 place count 35 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 217 place count 35 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 230 place count 35 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 231 place count 34 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 231 place count 34 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 233 place count 33 transition count 46
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 234 place count 32 transition count 44
Iterating global reduction 11 with 1 rules applied. Total rules applied 235 place count 32 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 236 place count 31 transition count 43
Applied a total of 236 rules in 36 ms. Remains 31 /225 variables (removed 194) and now considering 43/292 (removed 249) transitions.
[2025-06-06 22:57:13] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
// Phase 1: matrix 36 rows 31 cols
[2025-06-06 22:57:13] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:13] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:57:13] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
[2025-06-06 22:57:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:13] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:57:13] [INFO ] Redundant transitions in 21 ms returned []
Running 21 sub problems to find dead transitions.
[2025-06-06 22:57:13] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
[2025-06-06 22:57:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 31/56 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 6/62 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/67 variables, and 31 constraints, problems are : Problem set: 0 solved, 21 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 31/56 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 6/62 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 1/63 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 1/64 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/64 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/67 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/31 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 709ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 709ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/225 places, 43/292 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 832 ms. Remains : 31/225 places, 43/292 transitions.
[2025-06-06 22:57:14] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:57:14] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:57:14] [INFO ] Input system was already deterministic with 43 transitions.
[2025-06-06 22:57:14] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:57:14] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:57:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12537813445674644292.gal : 1 ms
[2025-06-06 22:57:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13279470625719067846.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12537813445674644292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13279470625719067846.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58976e+06,0.017907,3884,2,115,5,664,6,0,147,541,0


Converting to forward existential form...Done !
original formula: AG((((p289==0)||(p164==1)) * (AG(((p3==0)||(p80==1))) + (p322==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((p289==0)||(p164==1))))] = FALSE * [(FwdU((FwdU(Init,TRUE) * !((p322==0))),TRUE) * !(((p...183
(forward)formula 0,0,0.02079,4140,1,0,10,916,12,4,284,916,4
FORMULA SmartHome-PT-16-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Graph (trivial) has 228 edges and 225 vertex of which 116 / 225 are part of one of the 10 SCC in 1 ms
Free SCC test removed 106 places
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 142 transitions.
Graph (complete) has 209 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 116 transition count 117
Reduce places removed 32 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 38 rules applied. Total rules applied 72 place count 84 transition count 111
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 81 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 80 transition count 110
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 77 place count 80 transition count 105
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 87 place count 75 transition count 105
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 99 place count 63 transition count 93
Iterating global reduction 4 with 12 rules applied. Total rules applied 111 place count 63 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 115 place count 63 transition count 89
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 165 place count 38 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 38 transition count 62
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 168 place count 36 transition count 57
Iterating global reduction 6 with 2 rules applied. Total rules applied 170 place count 36 transition count 57
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 172 place count 35 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 184 place count 35 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 185 place count 34 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 185 place count 34 transition count 43
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 187 place count 33 transition count 43
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 189 place count 31 transition count 39
Iterating global reduction 7 with 2 rules applied. Total rules applied 191 place count 31 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 192 place count 31 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 30 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 29 transition count 38
Applied a total of 194 rules in 24 ms. Remains 29 /225 variables (removed 196) and now considering 38/292 (removed 254) transitions.
[2025-06-06 22:57:14] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
// Phase 1: matrix 32 rows 29 cols
[2025-06-06 22:57:14] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-06 22:57:14] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2025-06-06 22:57:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-06 22:57:14] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:57:14] [INFO ] Redundant transitions in 19 ms returned []
Running 34 sub problems to find dead transitions.
[2025-06-06 22:57:14] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2025-06-06 22:57:14] [INFO ] Invariant cache hit.
[2025-06-06 22:57:14] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 30/56 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/61 variables, and 39 constraints, problems are : Problem set: 0 solved, 34 unsolved in 318 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/29 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 30/56 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 2/58 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 1/60 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/61 variables, and 74 constraints, problems are : Problem set: 0 solved, 34 unsolved in 731 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1053ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1054ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/225 places, 38/292 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1158 ms. Remains : 29/225 places, 38/292 transitions.
[2025-06-06 22:57:15] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:57:15] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:57:15] [INFO ] Input system was already deterministic with 38 transitions.
[2025-06-06 22:57:15] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:57:15] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:57:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality3909994962556868982.gal : 1 ms
[2025-06-06 22:57:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality1164639245897942246.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3909994962556868982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1164639245897942246.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,184344,0.00596,3896,2,132,5,664,6,0,140,618,0


Converting to forward existential form...Done !
original formula: AF((AF(E((p37!=1) U ((p166==0) * AG((p185==1))))) * EG(AF(((p240==0)||(p181==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(E((p37!=1) U ((p166==0) * !(E(TRUE U !((p185==1))))))))) * EG(!(EG(!(((p240==0)||(p181==1))...171
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t7, t12, t14, t15, t17, t22, t28, t29, t31, t34, Intersection with reachable at each...217
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.137342,11192,1,0,235,40893,113,145,911,61969,259
FORMULA SmartHome-PT-16-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 292
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 198 transition count 267
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 198 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 198 transition count 261
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 67 place count 189 transition count 252
Iterating global reduction 2 with 9 rules applied. Total rules applied 76 place count 189 transition count 252
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 184 transition count 247
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 184 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 183 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 183 transition count 246
Applied a total of 88 rules in 11 ms. Remains 183 /225 variables (removed 42) and now considering 246/292 (removed 46) transitions.
// Phase 1: matrix 246 rows 183 cols
[2025-06-06 22:57:15] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 22:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:15] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-06 22:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 186 constraints, problems are : Problem set: 0 solved, 245 unsolved in 11521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 245/431 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:57:31] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 432 constraints, problems are : Problem set: 0 solved, 245 unsolved in 18188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29736ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 29737ms
Starting structural reductions in LTL mode, iteration 1 : 183/225 places, 246/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29872 ms. Remains : 183/225 places, 246/292 transitions.
[2025-06-06 22:57:45] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:57:45] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:57:45] [INFO ] Input system was already deterministic with 246 transitions.
[2025-06-06 22:57:45] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:57:45] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:57:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality16536988968948223264.gal : 3 ms
[2025-06-06 22:57:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality10935826609710883013.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16536988968948223264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10935826609710883013.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.44653e+14,0.314935,17784,2,3078,5,63243,6,0,970,66795,0


Converting to forward existential form...Done !
original formula: AF((AG(EX((p296==0))) * (p36==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(EX((p296==0))))) * (p36==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, t215,...280
(forward)formula 0,0,7.24026,242044,1,0,365,1.50412e+06,518,247,5992,1.17711e+06,594
FORMULA SmartHome-PT-16-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 292
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 200 transition count 269
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 200 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 200 transition count 263
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 191 transition count 254
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 191 transition count 254
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 186 transition count 249
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 186 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 185 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 185 transition count 248
Applied a total of 84 rules in 10 ms. Remains 185 /225 variables (removed 40) and now considering 248/292 (removed 44) transitions.
// Phase 1: matrix 248 rows 185 cols
[2025-06-06 22:57:52] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:52] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 22:57:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:52] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-06 22:57:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/433 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/433 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 188 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11642 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/433 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 247/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:58:14] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/433 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/433 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 436 constraints, problems are : Problem set: 0 solved, 247 unsolved in 25049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36710ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 36711ms
Starting structural reductions in LTL mode, iteration 1 : 185/225 places, 248/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36855 ms. Remains : 185/225 places, 248/292 transitions.
[2025-06-06 22:58:29] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:58:29] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:58:29] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-06 22:58:29] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:58:29] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:58:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11651169285160841301.gal : 1 ms
[2025-06-06 22:58:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality2903452166064066130.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11651169285160841301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2903452166064066130.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.50766e+14,0.318194,18900,2,3325,5,68550,6,0,980,70782,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) * !(A(!(EX(((p401==0)||(p133==1)))) U AG((p144==0)))))
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * [((Init * !(EG(!(!(E(TRUE U !((p144==0)))))))) * !(E(!(!(E(TRUE U !((p144==0)...240
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t60, t63, t92, t95, t112, t115, t132, t135, t147, t150, t168, t183, t2...289
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.68581,139488,1,0,328,760521,527,232,5995,717578,557
FORMULA SmartHome-PT-16-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 292
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 200 transition count 268
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 200 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 200 transition count 262
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 192 transition count 254
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 192 transition count 254
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 187 transition count 249
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 187 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 186 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 186 transition count 248
Applied a total of 83 rules in 10 ms. Remains 186 /225 variables (removed 39) and now considering 248/292 (removed 44) transitions.
// Phase 1: matrix 248 rows 186 cols
[2025-06-06 22:58:33] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:58:33] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 22:58:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:58:33] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-06 22:58:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 2/186 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/434 variables, 186/190 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 190 constraints, problems are : Problem set: 0 solved, 247 unsolved in 12289 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 2/186 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/434 variables, 186/190 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 247/437 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:58:50] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/434 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 438 constraints, problems are : Problem set: 0 solved, 247 unsolved in 20547 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32851ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 32851ms
Starting structural reductions in LTL mode, iteration 1 : 186/225 places, 248/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33003 ms. Remains : 186/225 places, 248/292 transitions.
[2025-06-06 22:59:06] [INFO ] Flatten gal took : 13 ms
[2025-06-06 22:59:06] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:59:06] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-06 22:59:06] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:59:06] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:59:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality13895361878577330691.gal : 2 ms
[2025-06-06 22:59:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10912754731055096969.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13895361878577330691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10912754731055096969.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.72401e+14,0.300477,17812,2,3267,5,63269,6,0,982,65945,0


Converting to forward existential form...Done !
original formula: AX(EF((AG(EX(((p192==0)||(p226==1)))) * A(EG((p171==1)) U (p489!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(E(TRUE U !(EX(((p192==0)||(p226==1)))))) * !((E(!((p489!=1)) U (!(EG((p171==1))) * !(...201
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t137, t151, t168, t183, t203, t217,...280
(forward)formula 0,0,25.9806,878464,1,0,1353,5.56205e+06,530,748,5752,5.88433e+06,1621
FORMULA SmartHome-PT-16-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 292
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 200 transition count 269
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 200 transition count 269
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 53 place count 200 transition count 264
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 191 transition count 255
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 191 transition count 255
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 186 transition count 250
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 186 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 185 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 185 transition count 249
Applied a total of 83 rules in 18 ms. Remains 185 /225 variables (removed 40) and now considering 249/292 (removed 43) transitions.
// Phase 1: matrix 249 rows 185 cols
[2025-06-06 22:59:32] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:59:32] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 22:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:59:32] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-06 22:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/434 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 188 constraints, problems are : Problem set: 0 solved, 248 unsolved in 11821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/434 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 248/436 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:59:49] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/434 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 437 constraints, problems are : Problem set: 0 solved, 248 unsolved in 19339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31173ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 31173ms
Starting structural reductions in LTL mode, iteration 1 : 185/225 places, 249/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31336 ms. Remains : 185/225 places, 249/292 transitions.
[2025-06-06 23:00:03] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:00:03] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:00:03] [INFO ] Input system was already deterministic with 249 transitions.
[2025-06-06 23:00:03] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:00:03] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:00:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11294637829344121849.gal : 1 ms
[2025-06-06 23:00:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6983547507356658098.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11294637829344121849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6983547507356658098.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.72226e+14,0.29406,17684,2,3180,5,62641,6,0,981,64056,0


Converting to forward existential form...Done !
original formula: (AG(EX(TRUE)) + A(((p195==1) + !(E((p297==0) U ((p320==0)||(p279==1))))) U (p268==1)))
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((p268==1)) U (!(((p195==1) + !(E((p297==0) U ((p320==0)||(p279==1)))))) * !((p268==1))))...208
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t94, t97, t114, t117, t134, t137, t149, t152, t169, t184, t204, t218,...280
(forward)formula 0,0,18.9057,636824,1,0,837,3.86076e+06,528,492,5767,4.38028e+06,1082
FORMULA SmartHome-PT-16-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 292
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 200 transition count 269
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 200 transition count 269
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 53 place count 200 transition count 264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 192 transition count 256
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 192 transition count 256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 188 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 188 transition count 252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 187 transition count 251
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 187 transition count 251
Applied a total of 79 rules in 8 ms. Remains 187 /225 variables (removed 38) and now considering 251/292 (removed 41) transitions.
// Phase 1: matrix 251 rows 187 cols
[2025-06-06 23:00:22] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:00:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 23:00:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:00:23] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2025-06-06 23:00:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/438 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 190 constraints, problems are : Problem set: 0 solved, 250 unsolved in 12623 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/438 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 250/440 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:00:40] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 0/438 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 441 constraints, problems are : Problem set: 0 solved, 250 unsolved in 18884 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31528ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 31528ms
Starting structural reductions in LTL mode, iteration 1 : 187/225 places, 251/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31680 ms. Remains : 187/225 places, 251/292 transitions.
[2025-06-06 23:00:54] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:00:54] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:00:54] [INFO ] Input system was already deterministic with 251 transitions.
[2025-06-06 23:00:54] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:00:54] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:00:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality14935214593709651364.gal : 1 ms
[2025-06-06 23:00:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2953903601147478652.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14935214593709651364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2953903601147478652.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,6.19695e+14,0.316163,18212,2,3066,5,64110,6,0,991,69789,0


Converting to forward existential form...Done !
original formula: EG(AX((((p29==1) + EG((p104==0))) + (p0==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((((p29==1) + EG((p104==0))) + (p0==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, t204, t218,...286
Detected timeout of ITS tools.
[2025-06-06 23:01:24] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:01:24] [INFO ] Applying decomposition
[2025-06-06 23:01:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14756347151170845910.txt' '-o' '/tmp/graph14756347151170845910.bin' '-w' '/tmp/graph14756347151170845910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14756347151170845910.bin' '-l' '-1' '-v' '-w' '/tmp/graph14756347151170845910.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:01:24] [INFO ] Decomposing Gal with order
[2025-06-06 23:01:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:01:24] [INFO ] Removed a total of 70 redundant transitions.
[2025-06-06 23:01:24] [INFO ] Flatten gal took : 54 ms
[2025-06-06 23:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2025-06-06 23:01:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality811984168493081160.gal : 4 ms
[2025-06-06 23:01:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality16751885095729515257.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality811984168493081160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16751885095729515257.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.19695e+14,0.105039,8948,324,38,10167,528,416,18975,60,1589,0


Converting to forward existential form...Done !
original formula: EG(AX((((i10.u1.p29==1) + EG((i2.u15.p104==0))) + (i10.u0.p0==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((((i10.u1.p29==1) + EG((i2.u15.p104==0))) + (i10.u0.p0==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i1.u9.t218, i2.u14.t204, i3.u19.t181, i4.u21.t166, i5.t227, ...404
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
(forward)formula 0,1,21.6749,343796,1,0,465450,600,2783,1.36476e+06,277,2583,291799
FORMULA SmartHome-PT-16-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Graph (trivial) has 231 edges and 225 vertex of which 124 / 225 are part of one of the 10 SCC in 1 ms
Free SCC test removed 114 places
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 199 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 108 transition count 109
Reduce places removed 30 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 36 rules applied. Total rules applied 68 place count 78 transition count 103
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 75 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 74 transition count 102
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 73 place count 74 transition count 98
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 81 place count 70 transition count 98
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 94 place count 57 transition count 85
Iterating global reduction 4 with 13 rules applied. Total rules applied 107 place count 57 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 111 place count 57 transition count 81
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 161 place count 32 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 163 place count 32 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 164 place count 31 transition count 53
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 166 place count 29 transition count 48
Iterating global reduction 7 with 2 rules applied. Total rules applied 168 place count 29 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 179 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 180 place count 28 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 180 place count 28 transition count 36
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 182 place count 27 transition count 36
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 184 place count 25 transition count 32
Iterating global reduction 8 with 2 rules applied. Total rules applied 186 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 187 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 188 place count 23 transition count 31
Applied a total of 188 rules in 24 ms. Remains 23 /225 variables (removed 202) and now considering 31/292 (removed 261) transitions.
[2025-06-06 23:01:46] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2025-06-06 23:01:46] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:01:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 23:01:46] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2025-06-06 23:01:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:01:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:01:46] [INFO ] Redundant transitions in 18 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 23:01:46] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2025-06-06 23:01:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/48 variables, and 22 constraints, problems are : Problem set: 0 solved, 14 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/44 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/45 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/48 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 237 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 401ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/225 places, 31/292 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 506 ms. Remains : 23/225 places, 31/292 transitions.
[2025-06-06 23:01:47] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:01:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:01:47] [INFO ] Input system was already deterministic with 31 transitions.
[2025-06-06 23:01:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:01:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:01:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13123487524846419863.gal : 1 ms
[2025-06-06 23:01:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11778378222806960601.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13123487524846419863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11778378222806960601.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,88320,0.00805,3904,2,97,5,584,6,0,106,494,0


Converting to forward existential form...Done !
original formula: AF(EG(((p207==0)&&(p322==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p207==0)&&(p322==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t19, t24, t25, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,0.046141,6080,1,0,108,12161,81,83,609,17950,125
FORMULA SmartHome-PT-16-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 292
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 202 transition count 271
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 202 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 50 place count 202 transition count 265
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 57 place count 195 transition count 258
Iterating global reduction 2 with 7 rules applied. Total rules applied 64 place count 195 transition count 258
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 191 transition count 254
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 191 transition count 254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 190 transition count 253
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 190 transition count 253
Applied a total of 74 rules in 15 ms. Remains 190 /225 variables (removed 35) and now considering 253/292 (removed 39) transitions.
// Phase 1: matrix 253 rows 190 cols
[2025-06-06 23:01:47] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:01:47] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 23:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:01:47] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-06 23:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/443 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/443 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 193 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/443 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 252/445 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:02:04] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 446 constraints, problems are : Problem set: 0 solved, 252 unsolved in 19689 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31986ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 31986ms
Starting structural reductions in LTL mode, iteration 1 : 190/225 places, 253/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32159 ms. Remains : 190/225 places, 253/292 transitions.
[2025-06-06 23:02:19] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:02:19] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:02:19] [INFO ] Input system was already deterministic with 253 transitions.
[2025-06-06 23:02:19] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:02:19] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:02:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality13899544879435596180.gal : 1 ms
[2025-06-06 23:02:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality13445008619004757574.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13899544879435596180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13445008619004757574.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.54503e+14,0.374834,19904,2,3426,5,74451,6,0,1005,76023,0


Converting to forward existential form...Done !
original formula: AF(((AG((p163==0)) + EF(EX(EG((p349==1))))) + ((p74==0)&&(p135==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((p163==0)))) + E(TRUE U EX(EG((p349==1))))) + ((p74==0)&&(p135==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t32, t60, t92, t95, t112, t115, t132, t135, t147, t150, t152, t168, t1...295
(forward)formula 0,1,4.92251,166132,1,0,370,968344,540,253,5870,824170,608
FORMULA SmartHome-PT-16-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 292/292 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 292
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 201 transition count 270
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 201 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 201 transition count 266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 193 transition count 258
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 193 transition count 258
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 189 transition count 254
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 189 transition count 254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 188 transition count 253
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 188 transition count 253
Applied a total of 76 rules in 7 ms. Remains 188 /225 variables (removed 37) and now considering 253/292 (removed 39) transitions.
// Phase 1: matrix 253 rows 188 cols
[2025-06-06 23:02:24] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 23:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:24] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-06 23:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/441 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/441 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 191 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12616 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/441 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 252/443 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:02:42] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 444 constraints, problems are : Problem set: 0 solved, 252 unsolved in 19872 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32499ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 32500ms
Starting structural reductions in LTL mode, iteration 1 : 188/225 places, 253/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32649 ms. Remains : 188/225 places, 253/292 transitions.
[2025-06-06 23:02:57] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:02:57] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:02:57] [INFO ] Input system was already deterministic with 253 transitions.
[2025-06-06 23:02:57] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:02:57] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:02:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13005209808097070434.gal : 1 ms
[2025-06-06 23:02:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality16441664647463806498.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13005209808097070434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16441664647463806498.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.31654e+14,0.383173,19868,2,3263,5,71226,6,0,997,77226,0


Converting to forward existential form...Done !
original formula: E(EX(E((p166==1) U E((p102==0) U (p31==1)))) U (p27!=0))
=> equivalent forward existential formula: [(FwdU(Init,EX(E((p166==1) U E((p102==0) U (p31==1))))) * (p27!=0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t152, t169, t184, t204, t218,...292
Detected timeout of ITS tools.
[2025-06-06 23:03:27] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:03:27] [INFO ] Applying decomposition
[2025-06-06 23:03:27] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph1814189006773819637.txt' '-o' '/tmp/graph1814189006773819637.bin' '-w' '/tmp/graph1814189006773819637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1814189006773819637.bin' '-l' '-1' '-v' '-w' '/tmp/graph1814189006773819637.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:03:27] [INFO ] Decomposing Gal with order
[2025-06-06 23:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:03:27] [INFO ] Removed a total of 66 redundant transitions.
[2025-06-06 23:03:27] [INFO ] Flatten gal took : 19 ms
[2025-06-06 23:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2025-06-06 23:03:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality8941572318531745914.gal : 11 ms
[2025-06-06 23:03:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12196770997938467961.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8941572318531745914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12196770997938467961.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.31654e+14,0.103899,8636,389,41,9478,568,481,15074,52,1824,0


Converting to forward existential form...Done !
original formula: E(EX(E((i5.u25.p166==1) U E((i3.u10.p102==0) U (u1.p31==1)))) U (u1.p27!=0))
=> equivalent forward existential formula: [(FwdU(Init,EX(E((i5.u25.p166==1) U E((i3.u10.p102==0) U (u1.p31==1))))) * (u1.p27!=0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, u1.t221, u1.t222, u1.t223, i0.i0.u68.t8, i1.i1.u6.t218, i3.u10.t20...419
(forward)formula 0,1,29.1946,672744,1,0,1.20941e+06,568,2989,1.86991e+06,252,2411,1068322
FORMULA SmartHome-PT-16-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-06 23:03:56] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:03:56] [INFO ] Flatten gal took : 5 ms
Total runtime 454556 ms.

BK_STOP 1749251036699

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-16"
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-5832"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-16, 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 r212-tall-174901995100809"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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