Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 27K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K 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 54K 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-05-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2023-15
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-00
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-01
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-02
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-03
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-04
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-05
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-06
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-07
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-08
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-09
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-10
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749246459965

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 21:47:41] [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 21:47:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 21:47:41] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2025-06-06 21:47:41] [INFO ] Transformed 213 places.
[2025-06-06 21:47:41] [INFO ] Transformed 245 transitions.
[2025-06-06 21:47:41] [INFO ] Found NUPN structural information;
[2025-06-06 21:47:41] [INFO ] Parsed PT model containing 213 places and 245 transitions and 557 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-05-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 227/227 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 165 transition count 196
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 165 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 165 transition count 193
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 161 transition count 189
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 161 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 159 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 159 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 158 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 158 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 157 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 157 transition count 185
Applied a total of 81 rules in 52 ms. Remains 157 /196 variables (removed 39) and now considering 185/227 (removed 42) transitions.
// Phase 1: matrix 185 rows 157 cols
[2025-06-06 21:47:41] [INFO ] Computed 10 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:47:41] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-06-06 21:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:47:41] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-06 21:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:43] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:43] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:43] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:44] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:44] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:44] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:44] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:44] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:44] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:45] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:45] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:45] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:45] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:45] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/342 variables, 157/181 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:47] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:47] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:47] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:47] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 185 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10946 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:53] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/342 variables, 157/186 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 184/370 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:55] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:55] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:58] [INFO ] Deduced a trap along path composed of 11 places in 43 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:58] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:47:58] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 0/342 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 375 constraints, problems are : Problem set: 0 solved, 184 unsolved in 21061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 32057ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 32075ms
Starting structural reductions in LTL mode, iteration 1 : 157/196 places, 185/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32549 ms. Remains : 157/196 places, 185/227 transitions.
Support contains 63 out of 157 places after structural reductions.
[2025-06-06 21:48:14] [INFO ] Flatten gal took : 32 ms
[2025-06-06 21:48:14] [INFO ] Flatten gal took : 17 ms
[2025-06-06 21:48:14] [INFO ] Input system was already deterministic with 185 transitions.
Support contains 58 out of 157 places (down from 63) after GAL structural reductions.
RANDOM walk for 40000 steps (286 resets) in 1516 ms. (26 steps per ms) remains 4/33 properties
BEST_FIRST walk for 40003 steps (49 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (57 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (57 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
[2025-06-06 21:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 48/157 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 185/342 variables, 157/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:15] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 168 constraints, problems are : Problem set: 0 solved, 4 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/109 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/157 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:15] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:15] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 185/342 variables, 157/170 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 3/173 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:15] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:15] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:15] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 3/176 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:15] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/342 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/342 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 177 constraints, problems are : Problem set: 1 solved, 3 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 867ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 241 ms.
Support contains 7 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 185/185 transitions.
Graph (trivial) has 141 edges and 157 vertex of which 59 / 157 are part of one of the 5 SCC in 2 ms
Free SCC test removed 54 places
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 103 transition count 81
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 66 place count 73 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 71 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 68 place count 71 transition count 70
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 80 place count 65 transition count 70
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 89 place count 56 transition count 61
Iterating global reduction 3 with 9 rules applied. Total rules applied 98 place count 56 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 56 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 100 place count 56 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 55 transition count 58
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 138 place count 37 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 95 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 9 rules applied. Total rules applied 147 place count 36 transition count 31
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 153 place count 36 transition count 25
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 159 place count 30 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 29 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 162 place count 27 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 162 place count 27 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 164 place count 26 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 165 place count 26 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 166 place count 25 transition count 22
Applied a total of 166 rules in 38 ms. Remains 25 /157 variables (removed 132) and now considering 22/185 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 25/157 places, 22/185 transitions.
RANDOM walk for 5738 steps (0 resets) in 24 ms. (229 steps per ms) remains 0/3 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA SmartHome-PT-05-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 21:48:16] [INFO ] Flatten gal took : 9 ms
[2025-06-06 21:48:16] [INFO ] Flatten gal took : 9 ms
[2025-06-06 21:48:16] [INFO ] Input system was already deterministic with 185 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 132 transition count 160
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 132 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 132 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 126 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 126 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 121 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 121 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 119 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 119 transition count 146
Applied a total of 77 rules in 9 ms. Remains 119 /157 variables (removed 38) and now considering 146/185 (removed 39) transitions.
// Phase 1: matrix 146 rows 119 cols
[2025-06-06 21:48:16] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:48:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 21:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:48:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2025-06-06 21:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:17] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:17] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/265 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 132 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5260 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/265 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 145/277 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:22] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:22] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:22] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:23] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:24] [INFO ] Deduced a trap along path composed of 11 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:24] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:27] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:48:31] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/265 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 286 constraints, problems are : Problem set: 0 solved, 145 unsolved in 17231 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 22508ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 22508ms
Starting structural reductions in LTL mode, iteration 1 : 119/157 places, 146/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22635 ms. Remains : 119/157 places, 146/185 transitions.
[2025-06-06 21:48:38] [INFO ] Flatten gal took : 7 ms
[2025-06-06 21:48:38] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:48:38] [INFO ] Input system was already deterministic with 146 transitions.
[2025-06-06 21:48:38] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:48:38] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:48:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality7052333663925632750.gal : 3 ms
[2025-06-06 21:48:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality1446560184446797089.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7052333663925632750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1446560184446797089.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07205e+08,0.144659,10220,2,1963,5,28983,6,0,624,25860,0


Converting to forward existential form...Done !
original formula: EG(E(AX(E(((p185==1)&&((p115==0)||(p40==1))) U ((p28==0)||(p66==1)))) U EG((p9==1))))
=> equivalent forward existential formula: [FwdG(Init,E(!(EX(!(E(((p185==1)&&((p115==0)||(p40==1))) U ((p28==0)||(p66==1)))))) U EG((p9==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t14, t34, t68, t88, t109, t124, t125, Intersection with reachable at each step enabl...207
(forward)formula 0,1,21.1609,677452,1,0,1006,3.01369e+06,326,671,3518,5.31707e+06,966
FORMULA SmartHome-PT-05-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Graph (trivial) has 149 edges and 157 vertex of which 59 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 102 transition count 82
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 43 rules applied. Total rules applied 77 place count 69 transition count 72
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 83 place count 64 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 63 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 84 place count 63 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 92 place count 59 transition count 67
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 104 place count 47 transition count 55
Iterating global reduction 4 with 12 rules applied. Total rules applied 116 place count 47 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 47 transition count 53
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 148 place count 32 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 32 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 31 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 159 place count 31 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 161 place count 29 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 163 place count 27 transition count 26
Applied a total of 163 rules in 18 ms. Remains 27 /157 variables (removed 130) and now considering 26/185 (removed 159) transitions.
[2025-06-06 21:49:00] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 27 cols
[2025-06-06 21:49:00] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:49:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 21:49:00] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2025-06-06 21:49:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:49:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-06 21:49:00] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:49:00] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-06 21:49:00] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2025-06-06 21:49:00] [INFO ] Invariant cache hit.
[2025-06-06 21:49:00] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 3/27 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 21/48 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:00] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/49 variables, and 38 constraints, problems are : Problem set: 0 solved, 15 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 3/27 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 21/48 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:00] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/48 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/49 variables, and 54 constraints, problems are : Problem set: 0 solved, 15 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 516ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 516ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/157 places, 26/185 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 604 ms. Remains : 27/157 places, 26/185 transitions.
[2025-06-06 21:49:00] [INFO ] Flatten gal took : 3 ms
[2025-06-06 21:49:00] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:49:00] [INFO ] Input system was already deterministic with 26 transitions.
[2025-06-06 21:49:00] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:49:00] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 202 steps (18 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-05-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 21:49:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3211373080298255404.gal : 1 ms
[2025-06-06 21:49:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14480852141671593827.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/ReachabilityCardinality3211373080298255404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14480852141671593827.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 136 transition count 164
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 136 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 136 transition count 162
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 131 transition count 157
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 131 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 129 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 129 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 128 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 128 transition count 154
Applied a total of 60 rules in 12 ms. Remains 128 /157 variables (removed 29) and now considering 154/185 (removed 31) transitions.
// Phase 1: matrix 154 rows 128 cols
[2025-06-06 21:49:00] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:49:00] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 21:49:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:49:00] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-06 21:49: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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:01] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:02] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/282 variables, 128/140 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:05] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 141 constraints, problems are : Problem set: 0 solved, 153 unsolved in 7513 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/282 variables, 128/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 153/294 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:09] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:09] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:10] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:10] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:11] [INFO ] Deduced a trap along path composed of 11 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:17] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:18] [INFO ] Deduced a trap along path composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/282 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:19] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 0/282 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 303 constraints, problems are : Problem set: 0 solved, 153 unsolved in 20447 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 27972ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 27972ms
Starting structural reductions in LTL mode, iteration 1 : 128/157 places, 154/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28104 ms. Remains : 128/157 places, 154/185 transitions.
[2025-06-06 21:49:28] [INFO ] Flatten gal took : 8 ms
[2025-06-06 21:49:28] [INFO ] Flatten gal took : 7 ms
[2025-06-06 21:49:28] [INFO ] Input system was already deterministic with 154 transitions.
[2025-06-06 21:49:28] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:49:28] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:49:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13202268143602317658.gal : 3 ms
[2025-06-06 21:49:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2218125817922800758.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/CTLCardinality13202268143602317658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2218125817922800758.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.06348e+08,0.128345,9792,2,2156,5,26566,6,0,668,24209,0


Converting to forward existential form...Done !
original formula: (E(EX(EX(TRUE)) U EF((AG(EF(((p42==0)||(p105==1)))) * !(((p81==0)||(p143==1)))))) + (EX(A(!(AF((p122==1))) U !(E((p76==0) U (p135==1)))))...284
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,EX(EX(TRUE))),TRUE) * !(((p81==0)||(p143==1)))) * !(E(TRUE U !(E(TRUE U ((p42==0)||(p105==1))...467
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t9, t12, t32, t72, t94, t99, t134, Intersection with reachable at each step enabled....204
(forward)formula 0,1,11.9864,396880,1,0,545,1.52647e+06,336,391,4130,2.98467e+06,712
FORMULA SmartHome-PT-05-CTLCardinality-2025-02 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 : 157/157 places, 185/185 transitions.
Graph (trivial) has 142 edges and 157 vertex of which 67 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 94 transition count 80
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 69 transition count 77
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 68 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 67 transition count 76
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 57 place count 67 transition count 69
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 71 place count 60 transition count 69
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 79 place count 52 transition count 61
Iterating global reduction 4 with 8 rules applied. Total rules applied 87 place count 52 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 52 transition count 60
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 116 place count 38 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 38 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 119 place count 37 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 123 place count 37 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 124 place count 36 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 126 place count 36 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 127 place count 35 transition count 39
Applied a total of 127 rules in 23 ms. Remains 35 /157 variables (removed 122) and now considering 39/185 (removed 146) transitions.
[2025-06-06 21:49:41] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
// Phase 1: matrix 32 rows 35 cols
[2025-06-06 21:49:41] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:49:41] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-06 21:49:41] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2025-06-06 21:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:49:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 21:49:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:49:41] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-06 21:49:41] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2025-06-06 21:49:41] [INFO ] Invariant cache hit.
[2025-06-06 21:49:41] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:41] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:41] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 31/66 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/67 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/67 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 59 constraints, problems are : Problem set: 0 solved, 38 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 35/35 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/35 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 31/66 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:42] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/67 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/67 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 98 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 35/35 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1773ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1774ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/157 places, 39/185 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1862 ms. Remains : 35/157 places, 39/185 transitions.
[2025-06-06 21:49:42] [INFO ] Flatten gal took : 3 ms
[2025-06-06 21:49:42] [INFO ] Flatten gal took : 3 ms
[2025-06-06 21:49:42] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-06 21:49:42] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:49:42] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:49:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality8644362496403927957.gal : 1 ms
[2025-06-06 21:49:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2787548119213758668.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/CTLCardinality8644362496403927957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2787548119213758668.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,13729,0.013999,4088,2,207,5,1265,6,0,176,993,0


Converting to forward existential form...Done !
original formula: AG(((AG((((p2!=0)&&(p9!=1))||(p84!=0))) + (p110==0)) + ((p105==1) + (EG(AG((p106==0))) * (p112==1)))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((p105==1) + (EG(!(E(TRUE U !((p106==0))))) * (p112==1))))) * !((p110==0))),TRUE) *...199
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.096858,8440,1,0,172,26361,110,116,1197,29215,198
FORMULA SmartHome-PT-05-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 130 transition count 158
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 130 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 130 transition count 156
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 123 transition count 149
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 123 transition count 149
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 118 transition count 144
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 118 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 118 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 116 transition count 141
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 116 transition count 141
Applied a total of 85 rules in 14 ms. Remains 116 /157 variables (removed 41) and now considering 141/185 (removed 44) transitions.
// Phase 1: matrix 141 rows 116 cols
[2025-06-06 21:49:43] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:49:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 21:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:49:43] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2025-06-06 21:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:44] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:44] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/257 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/257 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 128 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4755 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/257 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 140/268 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:49] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:50] [INFO ] Deduced a trap along path composed of 2 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:50] [INFO ] Deduced a trap along path composed of 13 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:49:54] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/257 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 272 constraints, problems are : Problem set: 0 solved, 140 unsolved in 13067 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 17841ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 17842ms
Starting structural reductions in LTL mode, iteration 1 : 116/157 places, 141/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17965 ms. Remains : 116/157 places, 141/185 transitions.
[2025-06-06 21:50:00] [INFO ] Flatten gal took : 11 ms
[2025-06-06 21:50:00] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:50:00] [INFO ] Input system was already deterministic with 141 transitions.
[2025-06-06 21:50:01] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:50:01] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:50:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality6911476527647964873.gal : 1 ms
[2025-06-06 21:50:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality17459454051472891018.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/CTLCardinality6911476527647964873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17459454051472891018.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.94081e+08,0.099733,8328,2,1600,5,20238,6,0,607,19296,0


Converting to forward existential form...Done !
original formula: E(!(((p105==0)||(p97==1))) U AX(AF(((p85==0)||(p143==1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(((p105==0)||(p97==1)))) * !(EX(!(!(EG(!(((p85==0)||(p143==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t67, t87, t121, Intersection with reachable at each step enabled. (destroy...195
Hit Full ! (commute/partial/dont) 137/4/4
(forward)formula 0,1,0.690238,31776,1,0,208,148000,313,133,3428,122335,337
FORMULA SmartHome-PT-05-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Graph (trivial) has 141 edges and 157 vertex of which 56 / 157 are part of one of the 4 SCC in 1 ms
Free SCC test removed 52 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 104 transition count 87
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 73 transition count 81
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 74 place count 70 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 68 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 76 place count 68 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 88 place count 62 transition count 73
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 100 place count 50 transition count 61
Iterating global reduction 4 with 12 rules applied. Total rules applied 112 place count 50 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 116 place count 50 transition count 57
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 49 transition count 56
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 49 transition count 56
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 148 place count 34 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 34 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 33 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 158 place count 33 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 159 place count 32 transition count 32
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 161 place count 30 transition count 30
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 11 edges and 29 vertex of which 2 / 29 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 163 place count 28 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 165 place count 28 transition count 28
Applied a total of 165 rules in 20 ms. Remains 28 /157 variables (removed 129) and now considering 28/185 (removed 157) transitions.
[2025-06-06 21:50:01] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 28 cols
[2025-06-06 21:50:01] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:01] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 21:50:01] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
[2025-06-06 21:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:01] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:50:01] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-06 21:50:01] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
[2025-06-06 21:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:01] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 24/52 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 37 constraints, problems are : Problem set: 0 solved, 18 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 24/52 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 55 constraints, problems are : Problem set: 0 solved, 18 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 470ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 470ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/157 places, 28/185 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 557 ms. Remains : 28/157 places, 28/185 transitions.
[2025-06-06 21:50:02] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:02] [INFO ] Flatten gal took : 3 ms
[2025-06-06 21:50:02] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-06 21:50:02] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:50:02] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:50:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality17039635260059493133.gal : 0 ms
[2025-06-06 21:50:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality2588079263032962743.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/CTLCardinality17039635260059493133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2588079263032962743.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,3488,0.00685,3980,2,211,5,1134,6,0,139,779,0


Converting to forward existential form...Done !
original formula: AG((EG(((p178!=0)&&(p158!=1))) + AF(((p114==0)||(p183==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(((p178!=0)&&(p158!=1))))),!(((p114==0)||(p183==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
Hit Full ! (commute/partial/dont) 20/8/8
(forward)formula 0,0,0.024159,4876,1,0,48,5515,81,28,855,3734,74
FORMULA SmartHome-PT-05-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Graph (trivial) has 143 edges and 157 vertex of which 51 / 157 are part of one of the 5 SCC in 0 ms
Free SCC test removed 46 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 110 transition count 91
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 76 place count 76 transition count 84
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 83 place count 73 transition count 80
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 87 place count 69 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 87 place count 69 transition count 76
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 95 place count 65 transition count 76
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 108 place count 52 transition count 63
Iterating global reduction 4 with 13 rules applied. Total rules applied 121 place count 52 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 52 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 149 place count 39 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 150 place count 39 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 152 place count 38 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 159 place count 38 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 160 place count 37 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 37 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 162 place count 37 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 164 place count 35 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 165 place count 34 transition count 36
Applied a total of 165 rules in 12 ms. Remains 34 /157 variables (removed 123) and now considering 36/185 (removed 149) transitions.
[2025-06-06 21:50:02] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 34 cols
[2025-06-06 21:50:02] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:02] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-06 21:50:02] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2025-06-06 21:50:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-06 21:50:02] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:50:02] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-06 21:50:02] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2025-06-06 21:50:02] [INFO ] Invariant cache hit.
[2025-06-06 21:50:02] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 3/34 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:02] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 31/65 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 3/34 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 31/65 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:03] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 73 constraints, problems are : Problem set: 0 solved, 26 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 897ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 897ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/157 places, 36/185 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 973 ms. Remains : 34/157 places, 36/185 transitions.
[2025-06-06 21:50:03] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:50:03] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:50:03] [INFO ] Input system was already deterministic with 36 transitions.
[2025-06-06 21:50:03] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:50:03] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11029081082536837933.gal : 0 ms
[2025-06-06 21:50:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17453324381368031030.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/CTLCardinality11029081082536837933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17453324381368031030.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,12048,0.01296,3916,2,214,5,942,6,0,169,723,0


Converting to forward existential form...Done !
original formula: EF(AG((((p96!=1)||(((p160!=0)&&(p195!=1))&&(p46!=0)))||((p93!=0)&&(p66!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p96!=1)||(((p160!=0)&&(p195!=1))&&(p46!=0)))||((p93!=0)&&(p66!=1)))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.043289,5452,1,0,57,8842,87,33,977,7795,80
FORMULA SmartHome-PT-05-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 130 transition count 158
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 130 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 130 transition count 156
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 122 transition count 148
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 122 transition count 148
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 116 transition count 142
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 116 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 116 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 113 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 113 transition count 138
Applied a total of 91 rules in 4 ms. Remains 113 /157 variables (removed 44) and now considering 138/185 (removed 47) transitions.
// Phase 1: matrix 138 rows 113 cols
[2025-06-06 21:50:03] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 21:50:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:03] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2025-06-06 21:50: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/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:04] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:04] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:04] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/251 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 128 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 137/265 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:10] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:10] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:11] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/251 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 268 constraints, problems are : Problem set: 0 solved, 137 unsolved in 8794 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 13832ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 13833ms
Starting structural reductions in LTL mode, iteration 1 : 113/157 places, 138/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13949 ms. Remains : 113/157 places, 138/185 transitions.
[2025-06-06 21:50:17] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:50:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:50:17] [INFO ] Input system was already deterministic with 138 transitions.
[2025-06-06 21:50:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:50:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:50:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality3912300894565554505.gal : 2 ms
[2025-06-06 21:50:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality9005886765715938079.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/CTLCardinality3912300894565554505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9005886765715938079.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.64118e+08,0.097777,8020,2,1558,5,19293,6,0,592,18537,0


Converting to forward existential form...Done !
original formula: AX((EF(EG((p196==0))) * (AG(((p201==0)&&(p159==1))) + EF(AG(((p88==0)&&(p191==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EG((p196==0)))))] = FALSE * [(FwdU((EY(Init) * !(E(TRUE U !(E(TRUE U !(((p88==0)&&(p191...211
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t12, t32, t64, t84, t118, Intersection with reachable at each step enabled. (de...200
(forward)formula 0,0,0.763206,34304,1,0,177,151286,301,120,3617,128492,293
FORMULA SmartHome-PT-05-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 132 transition count 160
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 132 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 132 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 125 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 125 transition count 152
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 120 transition count 147
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 120 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 120 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 118 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 118 transition count 144
Applied a total of 80 rules in 5 ms. Remains 118 /157 variables (removed 39) and now considering 144/185 (removed 41) transitions.
// Phase 1: matrix 144 rows 118 cols
[2025-06-06 21:50:18] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:18] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 21:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:18] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2025-06-06 21:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:19] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:19] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/262 variables, 118/130 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 130 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/262 variables, 118/130 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 143/273 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:24] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:27] [INFO ] Deduced a trap along path composed of 11 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:27] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:50:29] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 278 constraints, problems are : Problem set: 0 solved, 143 unsolved in 12424 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 17491ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 17493ms
Starting structural reductions in LTL mode, iteration 1 : 118/157 places, 144/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17626 ms. Remains : 118/157 places, 144/185 transitions.
[2025-06-06 21:50:35] [INFO ] Flatten gal took : 9 ms
[2025-06-06 21:50:35] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:50:35] [INFO ] Input system was already deterministic with 144 transitions.
[2025-06-06 21:50:35] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:50:35] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:50:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality6469168377587775413.gal : 1 ms
[2025-06-06 21:50:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13770214016092388330.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/CTLCardinality6469168377587775413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13770214016092388330.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.0805e+08,0.121413,9100,2,1799,5,22989,6,0,618,22820,0


Converting to forward existential form...Done !
original formula: AG(AF(AX(((p27==0)&&((p105==1)||(p5==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(((p27==0)&&((p105==1)||(p5==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t67, t87, t122, t123, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,0,0.787367,34244,1,0,185,152498,311,124,3483,133153,305
FORMULA SmartHome-PT-05-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Graph (trivial) has 148 edges and 157 vertex of which 59 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 102 transition count 80
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 67 transition count 73
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 82 place count 64 transition count 72
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 63 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 62 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 86 place count 62 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 94 place count 58 transition count 66
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 105 place count 47 transition count 55
Iterating global reduction 5 with 11 rules applied. Total rules applied 116 place count 47 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 118 place count 47 transition count 53
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 148 place count 32 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 149 place count 32 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 151 place count 31 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 158 place count 31 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 159 place count 30 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 161 place count 28 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 162 place count 27 transition count 27
Applied a total of 162 rules in 18 ms. Remains 27 /157 variables (removed 130) and now considering 27/185 (removed 158) transitions.
[2025-06-06 21:50:36] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 27 cols
[2025-06-06 21:50:36] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 21:50:36] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2025-06-06 21:50:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:50:36] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 21:50:36] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2025-06-06 21:50:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 22/49 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 22/49 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/50 variables, and 49 constraints, problems are : Problem set: 0 solved, 14 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 331ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 331ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/157 places, 27/185 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 417 ms. Remains : 27/157 places, 27/185 transitions.
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:37] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:50:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality4718533374135633967.gal : 0 ms
[2025-06-06 21:50:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality7478889754924025354.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/CTLCardinality4718533374135633967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7478889754924025354.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3312,0.013979,4084,2,155,5,1286,6,0,133,1159,0


Converting to forward existential form...Done !
original formula: E(EG(!(EF((p103==1)))) U AG(EF(!(((p17==0)||(p175==1))))))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(E(TRUE U (p103==1))))) * !(E(TRUE U !(E(TRUE U !(((p17==0)||(p175==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.039048,5236,1,0,50,8760,69,28,778,7098,68
FORMULA SmartHome-PT-05-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Graph (trivial) has 152 edges and 157 vertex of which 67 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 94 transition count 74
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 63 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 60 transition count 67
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 73 place count 60 transition count 63
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 81 place count 56 transition count 63
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 93 place count 44 transition count 51
Iterating global reduction 3 with 12 rules applied. Total rules applied 105 place count 44 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 44 transition count 49
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 137 place count 29 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 29 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 140 place count 28 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 147 place count 28 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 148 place count 27 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 150 place count 25 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 151 place count 24 transition count 23
Applied a total of 151 rules in 8 ms. Remains 24 /157 variables (removed 133) and now considering 23/185 (removed 162) transitions.
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 24 cols
[2025-06-06 21:50:37] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2025-06-06 21:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:50:37] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2025-06-06 21:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/42 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/43 variables, and 32 constraints, problems are : Problem set: 0 solved, 11 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 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/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/42 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 43 constraints, problems are : Problem set: 0 solved, 11 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 269ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/157 places, 23/185 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 341 ms. Remains : 24/157 places, 23/185 transitions.
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:37] [INFO ] Input system was already deterministic with 23 transitions.
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 0 ms
[2025-06-06 21:50:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality5432151206149767008.gal : 0 ms
[2025-06-06 21:50:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9940456334096914839.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/CTLCardinality5432151206149767008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9940456334096914839.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1296,0.006188,3892,2,113,5,444,6,0,117,328,0


Converting to forward existential form...Done !
original formula: EG(EF(AG((p182!=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !((p182!=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.016465,4276,1,0,10,2879,19,6,619,1986,12
FORMULA SmartHome-PT-05-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 185/185 transitions.
Graph (trivial) has 151 edges and 157 vertex of which 60 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 101 transition count 80
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 43 rules applied. Total rules applied 78 place count 67 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 82 place count 63 transition count 71
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 82 place count 63 transition count 66
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 58 transition count 66
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 105 place count 45 transition count 53
Iterating global reduction 3 with 13 rules applied. Total rules applied 118 place count 45 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 45 transition count 51
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 148 place count 31 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 31 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 30 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 159 place count 30 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 161 place count 28 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 26 transition count 25
Applied a total of 163 rules in 10 ms. Remains 26 /157 variables (removed 131) and now considering 25/185 (removed 160) transitions.
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 26 cols
[2025-06-06 21:50:37] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2025-06-06 21:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:50:37] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2025-06-06 21:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 20/46 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 20/46 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 326ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/157 places, 25/185 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 407 ms. Remains : 26/157 places, 25/185 transitions.
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 3 ms
[2025-06-06 21:50:37] [INFO ] Input system was already deterministic with 25 transitions.
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:37] [INFO ] Flatten gal took : 0 ms
[2025-06-06 21:50:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality3151609227833219099.gal : 0 ms
[2025-06-06 21:50:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1087052316833107853.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/CTLCardinality3151609227833219099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1087052316833107853.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1792,0.004883,3924,2,94,5,417,6,0,127,310,0


Converting to forward existential form...Done !
original formula: EG(EF(((p200==0)&&(p61==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p200==0)&&(p61==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.021906,4820,1,0,41,5379,20,38,630,6717,45
FORMULA SmartHome-PT-05-CTLCardinality-2023-14 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 : 157/157 places, 185/185 transitions.
Graph (trivial) has 153 edges and 157 vertex of which 67 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 94 transition count 74
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 63 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 60 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 73 place count 60 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 79 place count 57 transition count 64
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 92 place count 44 transition count 51
Iterating global reduction 3 with 13 rules applied. Total rules applied 105 place count 44 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 44 transition count 49
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 137 place count 29 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 29 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 140 place count 28 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 148 place count 28 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 26 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 152 place count 24 transition count 22
Applied a total of 152 rules in 7 ms. Remains 24 /157 variables (removed 133) and now considering 22/185 (removed 163) transitions.
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
// Phase 1: matrix 18 rows 24 cols
[2025-06-06 21:50:37] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2025-06-06 21:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:50:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:50:37] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 21:50:37] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2025-06-06 21:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 17/41 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/42 variables, and 32 constraints, problems are : Problem set: 0 solved, 11 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 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/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 17/41 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 43 constraints, problems are : Problem set: 0 solved, 11 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 254ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/157 places, 22/185 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 326 ms. Remains : 24/157 places, 22/185 transitions.
[2025-06-06 21:50:38] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:38] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:50:38] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-06 21:50:38] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:50:38] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:50:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality1382632522883959752.gal : 0 ms
[2025-06-06 21:50:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality2244433820307428982.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/CTLCardinality1382632522883959752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2244433820307428982.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,992,0.006128,3872,2,112,5,445,6,0,116,327,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((p207==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((p207==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 20/0/2
(forward)formula 0,1,0.016846,4256,1,0,16,2109,24,10,589,1365,13
FORMULA SmartHome-PT-05-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-06 21:50:38] [INFO ] Flatten gal took : 8 ms
[2025-06-06 21:50:38] [INFO ] Flatten gal took : 5 ms
Total runtime 177044 ms.

BK_STOP 1749246638296

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

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