Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901995100825.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-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901995100825
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 159K 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-18-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2023-15
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-00
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-01
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-02
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-03
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-04
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-05
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-06
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-07
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-08
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-09
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-10
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749251711745

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 23:15:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 23:15:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:15:13] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-06-06 23:15:13] [INFO ] Transformed 653 places.
[2025-06-06 23:15:13] [INFO ] Transformed 706 transitions.
[2025-06-06 23:15:13] [INFO ] Found NUPN structural information;
[2025-06-06 23:15:13] [INFO ] Parsed PT model containing 653 places and 706 transitions and 1618 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 206 places in 10 ms
Reduce places removed 206 places and 176 transitions.
FORMULA SmartHome-PT-18-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 530/530 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 432 transition count 530
Discarding 115 places :
Symmetric choice reduction at 1 with 115 rule applications. Total rules 130 place count 317 transition count 415
Iterating global reduction 1 with 115 rules applied. Total rules applied 245 place count 317 transition count 415
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 254 place count 317 transition count 406
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 274 place count 297 transition count 386
Iterating global reduction 2 with 20 rules applied. Total rules applied 294 place count 297 transition count 386
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 312 place count 279 transition count 368
Iterating global reduction 2 with 18 rules applied. Total rules applied 330 place count 279 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 332 place count 279 transition count 366
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 340 place count 271 transition count 358
Iterating global reduction 3 with 8 rules applied. Total rules applied 348 place count 271 transition count 358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 349 place count 270 transition count 357
Iterating global reduction 3 with 1 rules applied. Total rules applied 350 place count 270 transition count 357
Applied a total of 350 rules in 110 ms. Remains 270 /447 variables (removed 177) and now considering 357/530 (removed 173) transitions.
// Phase 1: matrix 357 rows 270 cols
[2025-06-06 23:15:13] [INFO ] Computed 5 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:15:13] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-06-06 23:15:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:15:13] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2025-06-06 23:15: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/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 3/270 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 357/627 variables, 270/275 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (OVERLAPS) 0/627 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 275 constraints, problems are : Problem set: 0 solved, 356 unsolved in 23440 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 3/270 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 357/627 variables, 270/275 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 356/631 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:15:47] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:15:47] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/627 variables, and 633 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53542ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 53553ms
Starting structural reductions in LTL mode, iteration 1 : 270/447 places, 357/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54220 ms. Remains : 270/447 places, 357/530 transitions.
Support contains 36 out of 270 places after structural reductions.
[2025-06-06 23:16:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-06 23:16:07] [INFO ] Flatten gal took : 42 ms
[2025-06-06 23:16:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-18-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 23:16:07] [INFO ] Flatten gal took : 19 ms
[2025-06-06 23:16:07] [INFO ] Input system was already deterministic with 357 transitions.
Support contains 20 out of 270 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (124 resets) in 1154 ms. (34 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40003 steps (12 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2025-06-06 23:16:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/45 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 70/115 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 154/269 variables, 42/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 132/401 variables, 62/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 95/496 variables, 51/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 72/568 variables, 36/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 28/596 variables, 19/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/596 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 10/606 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/611 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/611 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 4/615 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/615 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 6/621 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/621 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 6/627 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/627 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/627 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/45 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 70/115 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 154/269 variables, 42/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 132/401 variables, 62/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 95/496 variables, 51/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 72/568 variables, 36/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 28/596 variables, 19/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/596 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/606 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 5/611 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/611 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/615 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/615 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 6/621 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/621 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/627 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/627 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/627 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 627/627 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1130ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 357/357 transitions.
Graph (trivial) has 289 edges and 270 vertex of which 164 / 270 are part of one of the 14 SCC in 2 ms
Free SCC test removed 150 places
Drop transitions (Empty/Sink Transition effects.) removed 223 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 228 transitions.
Graph (complete) has 180 edges and 120 vertex of which 103 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 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 56 rules applied. Total rules applied 58 place count 103 transition count 62
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 51 rules applied. Total rules applied 109 place count 60 transition count 54
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 56 transition count 54
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 113 place count 56 transition count 47
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 127 place count 49 transition count 47
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 133 place count 43 transition count 41
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 43 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 141 place count 43 transition count 39
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 143 place count 41 transition count 37
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 41 transition count 37
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 183 place count 22 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 33 edges and 22 vertex of which 17 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 4 with 8 rules applied. Total rules applied 191 place count 17 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 16 transition count 9
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 7 rules applied. Total rules applied 199 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 201 place count 9 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 201 place count 9 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 208 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 209 place count 4 transition count 3
Applied a total of 209 rules in 21 ms. Remains 4 /270 variables (removed 266) and now considering 3/357 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 4/270 places, 3/357 transitions.
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/2 properties
[2025-06-06 23:16:09] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:16:09] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:16:09] [INFO ] Input system was already deterministic with 357 transitions.
Computed a total of 55 stabilizing places and 53 stable transitions
Graph (complete) has 423 edges and 270 vertex of which 268 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 268 transition count 357
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 254 transition count 343
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 254 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 254 transition count 341
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 38 place count 248 transition count 335
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 248 transition count 335
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 243 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 243 transition count 330
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 240 transition count 327
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 240 transition count 327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 239 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 239 transition count 326
Applied a total of 62 rules in 30 ms. Remains 239 /270 variables (removed 31) and now considering 326/357 (removed 31) transitions.
// Phase 1: matrix 326 rows 239 cols
[2025-06-06 23:16:09] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:16:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 23:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:16:09] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-06-06 23:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/565 variables, 239/242 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/565 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 242 constraints, problems are : Problem set: 0 solved, 325 unsolved in 19396 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/565 variables, 239/242 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 325/567 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:16:37] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 568 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49443ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 49444ms
Starting structural reductions in LTL mode, iteration 1 : 239/270 places, 326/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49654 ms. Remains : 239/270 places, 326/357 transitions.
[2025-06-06 23:16:59] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:16:59] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:16:59] [INFO ] Input system was already deterministic with 326 transitions.
[2025-06-06 23:16:59] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:16:59] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:16:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality17981270243013023546.gal : 6 ms
[2025-06-06 23:16:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14365112603406369274.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/CTLCardinality17981270243013023546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14365112603406369274.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.20108e+19,0.845835,36572,2,6371,5,159436,6,0,1270,153943,0


Converting to forward existential form...Done !
original formula: (AG((p276==0)) * EX(AF(AX((p367==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p276==0)))] = FALSE * [(Init * !(EX(!(EG(!(!(EX(!((p367==0))))))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t114, t117, t134, t137, t149, t152, t170, t185, t205, t220,...304
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.64234,271228,1,0,428,1.44004e+06,679,307,7372,1.36187e+06,711
FORMULA SmartHome-PT-18-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Graph (trivial) has 287 edges and 270 vertex of which 162 / 270 are part of one of the 14 SCC in 0 ms
Free SCC test removed 148 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Graph (complete) has 221 edges and 122 vertex of which 120 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 119 transition count 114
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 98 place count 75 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 102 place count 71 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 102 place count 71 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 69 transition count 104
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 115 place count 60 transition count 93
Iterating global reduction 3 with 9 rules applied. Total rules applied 124 place count 60 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 60 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 58 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 58 transition count 87
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 186 place count 30 transition count 59
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 189 place count 27 transition count 47
Iterating global reduction 4 with 3 rules applied. Total rules applied 192 place count 27 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 205 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 207 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 207 place count 25 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 24 transition count 33
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 211 place count 22 transition count 29
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 21 transition count 28
Applied a total of 214 rules in 26 ms. Remains 21 /270 variables (removed 249) and now considering 28/357 (removed 329) transitions.
[2025-06-06 23:17:07] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 23:17:07] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:17:07] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 23:17:07] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 23:17:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:17:08] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:17:08] [INFO ] Redundant transitions in 27 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:17:08] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 23:17:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 176 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 207 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 387ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/270 places, 28/357 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 498 ms. Remains : 21/270 places, 28/357 transitions.
[2025-06-06 23:17:08] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:17:08] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:17:08] [INFO ] Input system was already deterministic with 28 transitions.
RANDOM walk for 362 steps (20 resets) in 5 ms. (60 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-18-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 23:17:08] [INFO ] Flatten gal took : 3 ms
[2025-06-06 23:17:08] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:17:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10613257585841804653.gal : 1 ms
[2025-06-06 23:17:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7560582968469518480.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10613257585841804653.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7560582968469518480.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 268 transition count 357
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 252 transition count 341
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 252 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 252 transition count 339
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 245 transition count 332
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 245 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 239 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 239 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 236 transition count 323
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 236 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 235 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 235 transition count 322
Applied a total of 70 rules in 27 ms. Remains 235 /270 variables (removed 35) and now considering 322/357 (removed 35) transitions.
// Phase 1: matrix 322 rows 235 cols
[2025-06-06 23:17:08] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:17:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 23:17:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:17:08] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-06-06 23:17:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 238 constraints, problems are : Problem set: 0 solved, 321 unsolved in 19431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:17:36] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 560 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49498ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 49499ms
Starting structural reductions in LTL mode, iteration 1 : 235/270 places, 322/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49709 ms. Remains : 235/270 places, 322/357 transitions.
[2025-06-06 23:17:58] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:17:58] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:17:58] [INFO ] Input system was already deterministic with 322 transitions.
[2025-06-06 23:17:58] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:17:58] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:17:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1835944049827884566.gal : 2 ms
[2025-06-06 23:17:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality572345705965212356.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/CTLCardinality1835944049827884566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality572345705965212356.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38341e+18,0.923901,37896,2,5998,5,166703,6,0,1250,156590,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.944037,37896,1,0,6,166703,7,1,1516,156590,1
FORMULA SmartHome-PT-18-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 268 transition count 357
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 252 transition count 341
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 252 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 252 transition count 339
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 245 transition count 332
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 245 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 239 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 239 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 236 transition count 323
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 236 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 235 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 235 transition count 322
Applied a total of 70 rules in 38 ms. Remains 235 /270 variables (removed 35) and now considering 322/357 (removed 35) transitions.
[2025-06-06 23:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:17:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 23:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:17:59] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-06-06 23:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 238 constraints, problems are : Problem set: 0 solved, 321 unsolved in 19623 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:18:26] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 560 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49677ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 49679ms
Starting structural reductions in LTL mode, iteration 1 : 235/270 places, 322/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49898 ms. Remains : 235/270 places, 322/357 transitions.
[2025-06-06 23:18:49] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:18:49] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:18:49] [INFO ] Input system was already deterministic with 322 transitions.
[2025-06-06 23:18:49] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:18:49] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:18:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality6268746954595265625.gal : 2 ms
[2025-06-06 23:18:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality13301135619133581988.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/CTLCardinality6268746954595265625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13301135619133581988.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,9.38341e+18,0.949217,37852,2,5998,5,166703,6,0,1250,156590,0


Converting to forward existential form...Done !
original formula: EX(EF(AG(EX(TRUE))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(EX(TRUE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...304
(forward)formula 0,0,19.6818,561224,1,0,455,3.67002e+06,664,314,7078,2.64058e+06,758
FORMULA SmartHome-PT-18-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 268 transition count 357
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 252 transition count 341
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 252 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 252 transition count 339
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 245 transition count 332
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 245 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 239 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 239 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 236 transition count 323
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 236 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 235 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 235 transition count 322
Applied a total of 70 rules in 20 ms. Remains 235 /270 variables (removed 35) and now considering 322/357 (removed 35) transitions.
[2025-06-06 23:19:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:19:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 23:19:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:19:09] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-06-06 23:19:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 238 constraints, problems are : Problem set: 0 solved, 321 unsolved in 19461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:19:36] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 560 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49500ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 49501ms
Starting structural reductions in LTL mode, iteration 1 : 235/270 places, 322/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49720 ms. Remains : 235/270 places, 322/357 transitions.
[2025-06-06 23:19:58] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:19:58] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:19:58] [INFO ] Input system was already deterministic with 322 transitions.
[2025-06-06 23:19:58] [INFO ] Flatten gal took : 18 ms
[2025-06-06 23:19:58] [INFO ] Flatten gal took : 22 ms
[2025-06-06 23:19:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality14679758260343295898.gal : 2 ms
[2025-06-06 23:19:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2538997666222223475.ctl : 4 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/CTLCardinality14679758260343295898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2538997666222223475.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,9.38341e+18,1.00086,37908,2,5998,5,166703,6,0,1250,156590,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...304
(forward)formula 0,1,7.28599,195060,1,0,377,915159,665,273,6886,929927,660
FORMULA SmartHome-PT-18-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 269 transition count 357
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 253 transition count 341
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 253 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 253 transition count 339
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 42 place count 246 transition count 332
Iterating global reduction 2 with 7 rules applied. Total rules applied 49 place count 246 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 240 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 240 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 237 transition count 323
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 237 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 236 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 236 transition count 322
Applied a total of 69 rules in 21 ms. Remains 236 /270 variables (removed 34) and now considering 322/357 (removed 35) transitions.
// Phase 1: matrix 322 rows 236 cols
[2025-06-06 23:20:06] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:20:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 23:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:20:06] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-06-06 23:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 2/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 322/558 variables, 236/240 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 0/558 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 240 constraints, problems are : Problem set: 0 solved, 321 unsolved in 18620 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 2/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 322/558 variables, 236/240 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 321/561 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:20:32] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 562 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48653ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 48654ms
Starting structural reductions in LTL mode, iteration 1 : 236/270 places, 322/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48858 ms. Remains : 236/270 places, 322/357 transitions.
[2025-06-06 23:20:55] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:20:55] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:20:55] [INFO ] Input system was already deterministic with 322 transitions.
[2025-06-06 23:20:55] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:20:55] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:20:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality7224140564801048108.gal : 1 ms
[2025-06-06 23:20:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality14541169564134396044.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/CTLCardinality7224140564801048108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14541169564134396044.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,9.38341e+18,0.847922,35148,2,6013,5,152639,6,0,1251,140046,0


Converting to forward existential form...Done !
original formula: AF(AX(EF((p645==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E(TRUE U (p645==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...298
(forward)formula 0,1,8.16226,232656,1,0,392,1.21405e+06,671,281,7308,1.06834e+06,677
FORMULA SmartHome-PT-18-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 268 transition count 357
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 256 transition count 345
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 256 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 256 transition count 344
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 33 place count 250 transition count 338
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 250 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 245 transition count 333
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 245 transition count 333
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 243 transition count 331
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 243 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 242 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 242 transition count 330
Applied a total of 55 rules in 18 ms. Remains 242 /270 variables (removed 28) and now considering 330/357 (removed 27) transitions.
// Phase 1: matrix 330 rows 242 cols
[2025-06-06 23:21:03] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:21:03] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 23:21:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:21:03] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2025-06-06 23:21:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/572 variables, 242/245 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (OVERLAPS) 0/572 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 245 constraints, problems are : Problem set: 0 solved, 329 unsolved in 20192 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/572 variables, 242/245 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 329/574 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:21:32] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:21:32] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Int declared 572/572 variables, and 576 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50235ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 50236ms
Starting structural reductions in LTL mode, iteration 1 : 242/270 places, 330/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50426 ms. Remains : 242/270 places, 330/357 transitions.
[2025-06-06 23:21:53] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:21:53] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:21:53] [INFO ] Input system was already deterministic with 330 transitions.
[2025-06-06 23:21:53] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:21:53] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:21:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10406441675476027114.gal : 2 ms
[2025-06-06 23:21:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality15832959344815500127.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/CTLCardinality10406441675476027114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15832959344815500127.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,2.43213e+19,1.48682,54516,2,7309,5,237537,6,0,1286,249644,0


Converting to forward existential form...Done !
original formula: EF(AX((((p527==1)&&(p37==0))&&(((p442==1)||(p427==1))||(p297==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((p527==1)&&(p37==0))&&(((p442==1)||(p427==1))||(p297==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t61, t93, t96, t113, t116, t133, t136, t148, t155, t172, t175, t187, t...320
(forward)formula 0,1,9.84693,273584,1,0,388,1.3605e+06,677,279,6871,1.39268e+06,667
FORMULA SmartHome-PT-18-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Graph (trivial) has 289 edges and 270 vertex of which 164 / 270 are part of one of the 14 SCC in 1 ms
Free SCC test removed 150 places
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Graph (complete) has 218 edges and 120 vertex of which 118 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 117 transition count 111
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 98 place count 73 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 102 place count 69 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 102 place count 69 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 67 transition count 101
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 114 place count 59 transition count 91
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 59 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 59 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 126 place count 57 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 57 transition count 85
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 184 place count 29 transition count 57
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 187 place count 26 transition count 45
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 26 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 203 place count 26 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 205 place count 24 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 205 place count 24 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 23 transition count 31
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 209 place count 21 transition count 27
Iterating global reduction 5 with 2 rules applied. Total rules applied 211 place count 21 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 20 transition count 26
Applied a total of 212 rules in 22 ms. Remains 20 /270 variables (removed 250) and now considering 26/357 (removed 331) transitions.
[2025-06-06 23:22:03] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 20 cols
[2025-06-06 23:22:03] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:22:03] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 23:22:03] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2025-06-06 23:22:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:22:03] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:22:03] [INFO ] Redundant transitions in 20 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 23:22:03] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2025-06-06 23:22:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 17/34 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/35 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/40 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 115 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 17/34 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/37 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 171 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 291ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/270 places, 26/357 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 418 ms. Remains : 20/270 places, 26/357 transitions.
[2025-06-06 23:22:04] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:22:04] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:22:04] [INFO ] Input system was already deterministic with 26 transitions.
[2025-06-06 23:22:04] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:22:04] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:22:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality15578276916849065909.gal : 0 ms
[2025-06-06 23:22:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality13182739838396064802.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/CTLCardinality15578276916849065909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13182739838396064802.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,43200,0.004026,3900,2,58,5,310,6,0,87,315,0


Converting to forward existential form...Done !
original formula: AG(EF((p639==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p639==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t18, t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,0,0.01051,4156,1,0,53,2715,66,24,510,2260,55
FORMULA SmartHome-PT-18-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 269 transition count 357
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 254 transition count 342
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 254 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 254 transition count 340
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 40 place count 247 transition count 333
Iterating global reduction 2 with 7 rules applied. Total rules applied 47 place count 247 transition count 333
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 241 transition count 327
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 241 transition count 327
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 238 transition count 324
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 238 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 323
Applied a total of 67 rules in 12 ms. Remains 237 /270 variables (removed 33) and now considering 323/357 (removed 34) transitions.
// Phase 1: matrix 323 rows 237 cols
[2025-06-06 23:22:04] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:22:04] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 23:22:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:22:04] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2025-06-06 23:22:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 2/237 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/560 variables, 237/241 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/560 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 241 constraints, problems are : Problem set: 0 solved, 322 unsolved in 19428 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 2/237 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/560 variables, 237/241 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 322/563 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:22:31] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 564 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49480ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 49481ms
Starting structural reductions in LTL mode, iteration 1 : 237/270 places, 323/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49675 ms. Remains : 237/270 places, 323/357 transitions.
[2025-06-06 23:22:53] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:22:53] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:22:53] [INFO ] Input system was already deterministic with 323 transitions.
[2025-06-06 23:22:53] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:22:54] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:22:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality11204247136929557344.gal : 1 ms
[2025-06-06 23:22:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality12716479718125704068.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/CTLCardinality11204247136929557344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12716479718125704068.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.0009e+19,0.824231,35408,2,5819,5,155150,6,0,1257,142289,0


Converting to forward existential form...Done !
original formula: AF(EX((EF((p341==1)) * (EG((p334==0)) + A((p496!=1) U AX((p93==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((E(TRUE U (p341==1)) * (EG((p334==0)) + !((E(!(!(EX(!((p93==1))))) U (!((p496!=1)) * !(!(EX(!((p...211
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t28, t31, t60, t92, t95, t112, t115, t135, t147, t150, t167, t182, t202, t217, t237,...298
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.1483,280788,1,0,480,1.61006e+06,688,358,7735,1.3701e+06,794
FORMULA SmartHome-PT-18-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 268 transition count 357
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 252 transition count 341
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 252 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 252 transition count 339
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 246 transition count 333
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 246 transition count 333
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 240 transition count 327
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 240 transition count 327
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 237 transition count 324
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 237 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 236 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 236 transition count 323
Applied a total of 68 rules in 12 ms. Remains 236 /270 variables (removed 34) and now considering 323/357 (removed 34) transitions.
// Phase 1: matrix 323 rows 236 cols
[2025-06-06 23:23:03] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:23:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 23:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:23:03] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2025-06-06 23:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 239 constraints, problems are : Problem set: 0 solved, 322 unsolved in 19327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 322/561 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:23:30] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 0/559 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 562 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49362ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 49363ms
Starting structural reductions in LTL mode, iteration 1 : 236/270 places, 323/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49568 ms. Remains : 236/270 places, 323/357 transitions.
[2025-06-06 23:23:52] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:23:52] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:23:52] [INFO ] Input system was already deterministic with 323 transitions.
[2025-06-06 23:23:52] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:23:52] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:23:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5770300646181446615.gal : 2 ms
[2025-06-06 23:23:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality14434564346827719334.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/CTLCardinality5770300646181446615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14434564346827719334.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,1.00048e+19,0.870258,36224,2,6419,5,154704,6,0,1255,153986,0


Converting to forward existential form...Done !
original formula: AG((EX(TRUE) * (AG(EX(TRUE)) + ((EX((p90==1)) * (p42!=0)) * (p508!=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * [(FwdU((FwdU(Init,TRUE) * !(((EX((p90==1)) * (p42!=0)) * (p508!=1))...188
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...304
(forward)formula 0,0,7.63845,246196,1,0,380,1.16971e+06,665,276,7098,1.29716e+06,661
FORMULA SmartHome-PT-18-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 357/357 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 268 transition count 357
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 252 transition count 341
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 252 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 252 transition count 339
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 245 transition count 332
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 245 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 239 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 239 transition count 326
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 237 transition count 324
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 237 transition count 324
Applied a total of 66 rules in 20 ms. Remains 237 /270 variables (removed 33) and now considering 324/357 (removed 33) transitions.
// Phase 1: matrix 324 rows 237 cols
[2025-06-06 23:24:00] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:24:00] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-06 23:24:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:24:00] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2025-06-06 23:24:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/561 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 240 constraints, problems are : Problem set: 0 solved, 323 unsolved in 19609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 323/563 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:24:28] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 564 constraints, problems are : Problem set: 0 solved, 323 unsolved in 28928 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48571ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 48572ms
Starting structural reductions in LTL mode, iteration 1 : 237/270 places, 324/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48906 ms. Remains : 237/270 places, 324/357 transitions.
[2025-06-06 23:24:49] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:24:49] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:24:49] [INFO ] Input system was already deterministic with 324 transitions.
[2025-06-06 23:24:49] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:24:49] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:24:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2652435049622797853.gal : 2 ms
[2025-06-06 23:24:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16691236957416318485.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/CTLCardinality2652435049622797853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16691236957416318485.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,1.01341e+19,0.894556,39140,2,6690,5,170570,6,0,1260,167418,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(((p133==1) * EX((p415==0)))) + EX((p647==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(((p133==1) * EX((p415==0)))))) + EX((p647==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t93, t96, t113, t116, t133, t136, t148, t151, t168, t183, t203, t218,...304
Detected timeout of ITS tools.
[2025-06-06 23:25:19] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:25:19] [INFO ] Applying decomposition
[2025-06-06 23:25:19] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7955428165358300446.txt' '-o' '/tmp/graph7955428165358300446.bin' '-w' '/tmp/graph7955428165358300446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7955428165358300446.bin' '-l' '-1' '-v' '-w' '/tmp/graph7955428165358300446.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:25:19] [INFO ] Decomposing Gal with order
[2025-06-06 23:25:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:25:19] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-06 23:25:20] [INFO ] Flatten gal took : 265 ms
[2025-06-06 23:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-06 23:25:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality4235640169220814857.gal : 4 ms
[2025-06-06 23:25:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality16014216499966531046.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/CTLCardinality4235640169220814857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16014216499966531046.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,1.01341e+19,0.171204,8188,371,43,7906,746,493,12844,56,2313,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(((i2.u17.p133==1) * EX((i13.i1.i0.u67.p415==0)))) + EX((i15.u94.p647==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(((i2.u17.p133==1) * EX((i13.i1.i0.u67.p415==0)))))) + EX((i15.u94.p647=...174
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t96, t116, t136, t151, i0.u10.t287, i1.u11.t273, i2.u19.t253, i3.u21.t238, i4.u27.t...447
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,2.11083,81532,1,0,142379,746,3476,281002,316,2595,154665
FORMULA SmartHome-PT-18-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2025-06-06 23:25:22] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:25:22] [INFO ] Flatten gal took : 5 ms
Total runtime 609437 ms.

BK_STOP 1749252322399

--------------------
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-18"
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-18, 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-174901995100825"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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