Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Apr 12 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-05-CTLCardinality-2024-11
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

=== Now, execution of the tool begins

BK_START 1717029903371

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 202405141337
[2024-05-30 00:45:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 00:45:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:45:05] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2024-05-30 00:45:05] [INFO ] Transformed 213 places.
[2024-05-30 00:45:05] [INFO ] Transformed 245 transitions.
[2024-05-30 00:45:05] [INFO ] Found NUPN structural information;
[2024-05-30 00:45:05] [INFO ] Parsed PT model containing 213 places and 245 transitions and 557 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-05-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 227/227 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 163 transition count 194
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 163 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 163 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 161 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 161 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 159 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 159 transition count 188
Applied a total of 76 rules in 113 ms. Remains 159 /196 variables (removed 37) and now considering 188/227 (removed 39) transitions.
// Phase 1: matrix 188 rows 159 cols
[2024-05-30 00:45:06] [INFO ] Computed 10 invariants in 34 ms
[2024-05-30 00:45:06] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-30 00:45:06] [INFO ] Invariant cache hit.
[2024-05-30 00:45:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-30 00:45:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-30 00:45:09] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 37 ms to minimize.
[2024-05-30 00:45:09] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2024-05-30 00:45:09] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
[2024-05-30 00:45:09] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 3 ms to minimize.
[2024-05-30 00:45:10] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-30 00:45:10] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/347 variables, 159/175 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 0/347 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 175 constraints, problems are : Problem set: 0 solved, 187 unsolved in 9208 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/347 variables, 159/175 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 187/362 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-30 00:45:18] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-30 00:45:19] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
[2024-05-30 00:45:19] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 00:45:19] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-30 00:45:19] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 3 ms to minimize.
[2024-05-30 00:45:19] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-30 00:45:20] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 3 ms to minimize.
[2024-05-30 00:45:20] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 370 constraints, problems are : Problem set: 0 solved, 187 unsolved in 11033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 14/14 constraints]
After SMT, in 20407ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 20441ms
Starting structural reductions in LTL mode, iteration 1 : 159/196 places, 188/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21298 ms. Remains : 159/196 places, 188/227 transitions.
Support contains 60 out of 159 places after structural reductions.
[2024-05-30 00:45:27] [INFO ] Flatten gal took : 55 ms
[2024-05-30 00:45:27] [INFO ] Flatten gal took : 31 ms
[2024-05-30 00:45:27] [INFO ] Input system was already deterministic with 188 transitions.
RANDOM walk for 40000 steps (284 resets) in 2394 ms. (16 steps per ms) remains 3/39 properties
BEST_FIRST walk for 40001 steps (52 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (51 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (53 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
[2024-05-30 00:45:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 98/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 54/159 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 188/347 variables, 159/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 98/105 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 00:45:29] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-05-30 00:45:29] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 00:45:29] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 54/159 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 188/347 variables, 159/172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 2/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/347 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 174 constraints, problems are : Problem set: 1 solved, 2 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 526ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 557 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 188/188 transitions.
Graph (trivial) has 148 edges and 159 vertex of which 47 / 159 are part of one of the 5 SCC in 4 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 117 transition count 86
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 55 rules applied. Total rules applied 99 place count 74 transition count 74
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 109 place count 67 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 65 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 111 place count 65 transition count 67
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 119 place count 61 transition count 67
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 131 place count 49 transition count 55
Iterating global reduction 4 with 12 rules applied. Total rules applied 143 place count 49 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 147 place count 49 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 148 place count 48 transition count 51
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 180 place count 32 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 92 edges and 32 vertex of which 31 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 6 with 9 rules applied. Total rules applied 189 place count 31 transition count 26
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 190 place count 31 transition count 25
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 196 place count 31 transition count 19
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 202 place count 25 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 203 place count 24 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 207 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 207 place count 20 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 213 place count 17 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 214 place count 17 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 215 place count 16 transition count 14
Applied a total of 215 rules in 60 ms. Remains 16 /159 variables (removed 143) and now considering 14/188 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 16/159 places, 14/188 transitions.
RANDOM walk for 168 steps (0 resets) in 13 ms. (12 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA SmartHome-PT-05-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:45:29] [INFO ] Flatten gal took : 16 ms
[2024-05-30 00:45:29] [INFO ] Flatten gal took : 14 ms
[2024-05-30 00:45:30] [INFO ] Input system was already deterministic with 188 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 136 transition count 162
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 126 transition count 152
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 126 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 126 transition count 151
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 118 transition count 143
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 118 transition count 143
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 113 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 113 transition count 138
Applied a total of 96 rules in 27 ms. Remains 113 /159 variables (removed 46) and now considering 138/188 (removed 50) transitions.
// Phase 1: matrix 138 rows 113 cols
[2024-05-30 00:45:30] [INFO ] Computed 10 invariants in 4 ms
[2024-05-30 00:45:30] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 00:45:30] [INFO ] Invariant cache hit.
[2024-05-30 00:45:30] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-30 00:45:30] [INFO ] Invariant cache hit.
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
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 2 ms to minimize.
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-30 00:45:31] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 132 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5250 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
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, 9/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-30 00:45:36] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/251 variables, 113/133 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 137/270 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 270 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5811 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 10/10 constraints]
After SMT, in 11090ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 11093ms
Starting structural reductions in LTL mode, iteration 1 : 113/159 places, 138/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11298 ms. Remains : 113/159 places, 138/188 transitions.
[2024-05-30 00:45:41] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:45:41] [INFO ] Flatten gal took : 14 ms
[2024-05-30 00:45:41] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-30 00:45:41] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:45:41] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:45:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality10346462508243476129.gal : 5 ms
[2024-05-30 00:45:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality2224864244997088482.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10346462508243476129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2224864244997088482.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.80418e+08,0.144221,7236,2,1493,5,17633,6,0,592,15904,0


Converting to forward existential form...Done !
original formula: AX((EF((p208==1)) + AF(EX(((p136==0)&&(p41==1))))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(E(TRUE U (p208==1)))),!(EX(((p136==0)&&(p41==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t63, t83, t104, t118, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,1,1.24653,35984,1,0,192,183440,304,127,3506,139962,311
FORMULA SmartHome-PT-05-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 167
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 138 transition count 164
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 130 transition count 156
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 130 transition count 156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 124 transition count 150
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 124 transition count 150
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 121 transition count 147
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 121 transition count 147
Applied a total of 79 rules in 11 ms. Remains 121 /159 variables (removed 38) and now considering 147/188 (removed 41) transitions.
// Phase 1: matrix 147 rows 121 cols
[2024-05-30 00:45:42] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:45:42] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-30 00:45:42] [INFO ] Invariant cache hit.
[2024-05-30 00:45:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-30 00:45:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-30 00:45:44] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-30 00:45:44] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-30 00:45:44] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/268 variables, 121/134 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/268 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 134 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4992 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/268 variables, 121/134 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 146/280 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-30 00:45:50] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 2 ms to minimize.
[2024-05-30 00:45:50] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6725 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 5/5 constraints]
After SMT, in 11744ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 11749ms
Starting structural reductions in LTL mode, iteration 1 : 121/159 places, 147/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12058 ms. Remains : 121/159 places, 147/188 transitions.
[2024-05-30 00:45:54] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:45:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:45:54] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-30 00:45:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:45:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:45:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality4680656173768978211.gal : 5 ms
[2024-05-30 00:45:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11048977669128267312.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4680656173768978211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11048977669128267312.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47842e+08,0.164249,8408,2,1777,5,22291,6,0,633,20641,0


Converting to forward existential form...Done !
original formula: E(((EX(AF(((EF((p87==1)) * ((p117==0)||(p186==1))) * ((p122==0)||(p99==1))))) + EF(((p176==1)&&(p144==1)))) + AX(!(((p199==0)&&(p117==1))...232
=> equivalent forward existential formula: [(((FwdU(Init,((EX(!(EG(!(((E(TRUE U (p87==1)) * ((p117==0)||(p186==1))) * ((p122==0)||(p99==1))))))) + E(TRUE U...358
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t13, t37, t72, t93, t127, Intersection with reachable at each step enabled. (destroy...195
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.8069,388596,1,0,906,1.93649e+06,343,615,3956,2.76965e+06,1069
FORMULA SmartHome-PT-05-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 166
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 137 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 128 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 128 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 128 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 122 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 122 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 118 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 118 transition count 144
Applied a total of 85 rules in 14 ms. Remains 118 /159 variables (removed 41) and now considering 144/188 (removed 44) transitions.
// Phase 1: matrix 144 rows 118 cols
[2024-05-30 00:46:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:46:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 00:46:10] [INFO ] Invariant cache hit.
[2024-05-30 00:46:11] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-30 00:46:11] [INFO ] Invariant cache hit.
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
[2024-05-30 00:46:12] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 3 ms to minimize.
[2024-05-30 00:46:12] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-30 00:46:12] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-05-30 00:46:12] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 3 ms to minimize.
[2024-05-30 00:46:12] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-30 00:46:13] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-30 00:46:13] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 00:46:13] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/262 variables, 118/136 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 136 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6852 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
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, 8/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:46:18] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 144/262 variables, 118/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 143/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 280 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5393 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 9/9 constraints]
After SMT, in 12279ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 12281ms
Starting structural reductions in LTL mode, iteration 1 : 118/159 places, 144/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12535 ms. Remains : 118/159 places, 144/188 transitions.
[2024-05-30 00:46:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:46:23] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:46:23] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-30 00:46:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:46:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:46:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9721041863364103306.gal : 2 ms
[2024-05-30 00:46:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2309877577737639443.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9721041863364103306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2309877577737639443.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.33856e+08,0.230258,10496,2,2650,5,32114,6,0,618,27990,0


Converting to forward existential form...Done !
original formula: AG((((p4==1) + AX(EX(TRUE))) + A((p182==1) U (EF(EG(((p84==0)||(p92==1)))) * ((p142==0)||(p164==1))))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(!((E(!((E(TRUE U EG(((p84==0)||(p92==1)))) * ((p142==0)||(p164==1)))) U (!((p182==1))...338
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t9, t11, t13, t32, t66, t88, t122, t123, Intersection with reachable at each step en...211
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.61087,229260,1,0,576,1.45214e+06,326,335,3837,1.35189e+06,723
FORMULA SmartHome-PT-05-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 140 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 140 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 140 transition count 166
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 134 transition count 160
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 134 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 134 transition count 159
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 130 transition count 155
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 130 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 128 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 128 transition count 153
Applied a total of 66 rules in 28 ms. Remains 128 /159 variables (removed 31) and now considering 153/188 (removed 35) transitions.
// Phase 1: matrix 153 rows 128 cols
[2024-05-30 00:46:32] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:46:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 00:46:32] [INFO ] Invariant cache hit.
[2024-05-30 00:46:32] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-30 00:46:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:46:33] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 3 ms to minimize.
[2024-05-30 00:46:33] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 3 ms to minimize.
[2024-05-30 00:46:33] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/281 variables, 128/141 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 141 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5493 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/281 variables, 128/141 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 152/293 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:46:41] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:46:42] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-30 00:46:43] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/281 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 296 constraints, problems are : Problem set: 0 solved, 152 unsolved in 10037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 6/6 constraints]
After SMT, in 15564ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 15567ms
Starting structural reductions in LTL mode, iteration 1 : 128/159 places, 153/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15821 ms. Remains : 128/159 places, 153/188 transitions.
[2024-05-30 00:46:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:46:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:46:47] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-30 00:46:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:46:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:46:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10658339249911196965.gal : 2 ms
[2024-05-30 00:46:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality15695067067086551009.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10658339249911196965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15695067067086551009.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.84394e+08,0.190896,9492,2,2594,5,28774,6,0,667,24767,0


Converting to forward existential form...Done !
original formula: AG(((AX(((EX(((p74==0)||(p32==1))) + (p146==0)) + ((p204==1)||(p145==1)))) + (p136==1)) + (AF((p91==0)) * ((p105==0)||(p157==1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((!(EX(!(((EX(((p74==0)||(p32==1))) + (p146==0)) + ((p204==1)||(p145==1)))))) + (p136...340
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t32, t36, t71, t98, t118, t133, Intersection with reachable at each step enable...206
(forward)formula 0,1,1.69107,46628,1,0,203,192471,337,135,3713,192648,324
FORMULA SmartHome-PT-05-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 167
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 167
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 138 transition count 165
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 132 transition count 159
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 132 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 126 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 126 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 123 transition count 150
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 123 transition count 150
Applied a total of 74 rules in 9 ms. Remains 123 /159 variables (removed 36) and now considering 150/188 (removed 38) transitions.
// Phase 1: matrix 150 rows 123 cols
[2024-05-30 00:46:49] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:46:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 00:46:49] [INFO ] Invariant cache hit.
[2024-05-30 00:46:49] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-30 00:46:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-30 00:46:50] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-30 00:46:50] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 3 ms to minimize.
[2024-05-30 00:46:51] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-05-30 00:46:51] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/273 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 137 constraints, problems are : Problem set: 0 solved, 149 unsolved in 6126 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/273 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 149/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-30 00:46:57] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 287 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5957 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 5/5 constraints]
After SMT, in 12108ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 12110ms
Starting structural reductions in LTL mode, iteration 1 : 123/159 places, 150/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12346 ms. Remains : 123/159 places, 150/188 transitions.
[2024-05-30 00:47:01] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:47:01] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:47:01] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-30 00:47:02] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:47:02] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:47:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality9859617984210400554.gal : 5 ms
[2024-05-30 00:47:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality12784870988917541228.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9859617984210400554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12784870988917541228.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.82081e+08,0.163631,8688,2,1847,5,24045,6,0,644,21602,0


Converting to forward existential form...Done !
original formula: (EF(AG(((p194==0)||(p118==1)))) * (EG(AX((p203==0))) + A(AG(!(AF(((p97==0)||(p6==1))))) U !(((!(EX((p178==1))) + (p128==1)) + ((!((p98==0...210
=> equivalent forward existential formula: ([FwdG((Init * E(TRUE U !(E(TRUE U !(((p194==0)||(p118==1))))))),!(EX(!((p203==0)))))] != FALSE + [(((Init * E(T...598
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t12, t37, t73, t93, t128, t129, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,1,8.50777,214592,1,0,469,978312,330,331,3794,1.48912e+06,541
FORMULA SmartHome-PT-05-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Graph (trivial) has 149 edges and 159 vertex of which 58 / 159 are part of one of the 5 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 106 transition count 84
Reduce places removed 38 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 47 rules applied. Total rules applied 86 place count 68 transition count 75
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 90 place count 64 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 90 place count 64 transition count 71
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 98 place count 60 transition count 71
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 110 place count 48 transition count 59
Iterating global reduction 3 with 12 rules applied. Total rules applied 122 place count 48 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 48 transition count 57
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 154 place count 33 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 155 place count 33 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 5 with 2 rules applied. Total rules applied 157 place count 32 transition count 39
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 165 place count 32 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 167 place count 30 transition count 31
Applied a total of 167 rules in 29 ms. Remains 30 /159 variables (removed 129) and now considering 31/188 (removed 157) transitions.
[2024-05-30 00:47:10] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 30 cols
[2024-05-30 00:47:10] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 00:47:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 00:47:10] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-30 00:47:10] [INFO ] Invariant cache hit.
[2024-05-30 00:47:10] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-30 00:47:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-30 00:47:10] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 00:47:10] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-30 00:47:10] [INFO ] Invariant cache hit.
[2024-05-30 00:47:10] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 26/56 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/57 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 49 constraints, problems are : Problem set: 0 solved, 30 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 26/56 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 30/78 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/57 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/57 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 79 constraints, problems are : Problem set: 0 solved, 30 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1176ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1186ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/159 places, 31/188 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1315 ms. Remains : 30/159 places, 31/188 transitions.
[2024-05-30 00:47:11] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:47:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:47:11] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-30 00:47:11] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:47:11] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:47:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5307612651106567985.gal : 2 ms
[2024-05-30 00:47:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality11002970007358776267.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5307612651106567985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11002970007358776267.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4466,0.009216,3508,2,148,5,654,6,0,148,487,0


Converting to forward existential form...Done !
original formula: AG((EF(!(A(AF((p157==1)) U ((p1==1)&&((p208==0)||(p89==1)))))) + (p61==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p61==0))) * !(E(TRUE U !(!((E(!(((p1==1)&&((p208==0)||(p89==1)))) U (!(!(EG(!((p157==1))...255
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.086212,6464,1,0,140,15815,89,90,904,17442,287
FORMULA SmartHome-PT-05-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 135 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 135 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 135 transition count 161
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 125 transition count 151
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 125 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 125 transition count 150
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 80 place count 117 transition count 142
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 117 transition count 142
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 112 transition count 137
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 112 transition count 137
Applied a total of 98 rules in 13 ms. Remains 112 /159 variables (removed 47) and now considering 137/188 (removed 51) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-30 00:47:12] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:47:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 00:47:12] [INFO ] Invariant cache hit.
[2024-05-30 00:47:12] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-30 00:47:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 00:47:13] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-30 00:47:13] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-05-30 00:47:13] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-30 00:47:13] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-30 00:47:13] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 19 ms to minimize.
[2024-05-30 00:47:14] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 3 ms to minimize.
[2024-05-30 00:47:14] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5177 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4257 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 9469ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9472ms
Starting structural reductions in LTL mode, iteration 1 : 112/159 places, 137/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9691 ms. Remains : 112/159 places, 137/188 transitions.
[2024-05-30 00:47:21] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:47:21] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:47:21] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-30 00:47:21] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:47:21] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:47:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14568909242778443911.gal : 2 ms
[2024-05-30 00:47:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality14999791016720566437.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14568909242778443911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14999791016720566437.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76705e+08,0.211575,7568,2,1490,5,18519,6,0,587,16755,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.221034,7568,1,0,6,18519,7,1,718,16755,1
FORMULA SmartHome-PT-05-CTLCardinality-2024-07 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 : 159/159 places, 188/188 transitions.
Graph (trivial) has 152 edges and 159 vertex of which 60 / 159 are part of one of the 5 SCC in 0 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 103 transition count 79
Reduce places removed 38 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 47 rules applied. Total rules applied 86 place count 65 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 90 place count 61 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 90 place count 61 transition count 66
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 98 place count 57 transition count 66
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 109 place count 46 transition count 55
Iterating global reduction 3 with 11 rules applied. Total rules applied 120 place count 46 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 46 transition count 54
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 151 place count 31 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 31 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 5 with 2 rules applied. Total rules applied 154 place count 30 transition count 36
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 162 place count 30 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 29 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 165 place count 27 transition count 26
Applied a total of 165 rules in 20 ms. Remains 27 /159 variables (removed 132) and now considering 26/188 (removed 162) transitions.
[2024-05-30 00:47:22] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 27 cols
[2024-05-30 00:47:22] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:47:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 00:47:22] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2024-05-30 00:47:22] [INFO ] Invariant cache hit.
[2024-05-30 00:47:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-30 00:47:22] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 00:47:22] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2024-05-30 00:47:22] [INFO ] Invariant cache hit.
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) 3/27 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 21/48 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/49 variables, and 36 constraints, problems are : Problem set: 0 solved, 13 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
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) 3/27 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 21/48 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/49 variables, and 49 constraints, problems are : Problem set: 0 solved, 13 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 453ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 453ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/159 places, 26/188 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 609 ms. Remains : 27/159 places, 26/188 transitions.
[2024-05-30 00:47:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:47:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:47:22] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-30 00:47:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:47:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:47:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16082204832567488877.gal : 1 ms
[2024-05-30 00:47:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality904195358892665638.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16082204832567488877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality904195358892665638.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3456,0.009996,3488,2,92,5,443,6,0,132,334,0


Converting to forward existential form...Done !
original formula: AG((EF((p4==0)) + (p61==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p61==0))) * !(E(TRUE U (p4==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.020059,3804,1,0,7,1761,14,1,606,618,5
FORMULA SmartHome-PT-05-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 136 transition count 162
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 126 transition count 152
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 126 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 126 transition count 151
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 118 transition count 143
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 118 transition count 143
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 113 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 113 transition count 138
Applied a total of 96 rules in 11 ms. Remains 113 /159 variables (removed 46) and now considering 138/188 (removed 50) transitions.
// Phase 1: matrix 138 rows 113 cols
[2024-05-30 00:47:22] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:47:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 00:47:22] [INFO ] Invariant cache hit.
[2024-05-30 00:47:22] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-30 00:47:22] [INFO ] Invariant cache hit.
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
[2024-05-30 00:47:24] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-30 00:47:24] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-30 00:47:24] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-05-30 00:47:24] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-05-30 00:47:24] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 3 ms to minimize.
[2024-05-30 00:47:24] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 4 ms to minimize.
[2024-05-30 00:47:24] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-30 00:47:24] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 131 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6199 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
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, 8/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 137/268 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (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 4596 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 8/8 constraints]
After SMT, in 10814ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 10816ms
Starting structural reductions in LTL mode, iteration 1 : 113/159 places, 138/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11046 ms. Remains : 113/159 places, 138/188 transitions.
[2024-05-30 00:47:33] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:47:33] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:47:33] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-30 00:47:33] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:47:33] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:47:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality2725586459905312810.gal : 1 ms
[2024-05-30 00:47:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality5582297012917665387.ctl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2725586459905312810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5582297012917665387.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(EF(AG(EX(((p56==0)&&(p137==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(EX(((p56==0)&&(p137==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t64, t84, t118, Intersection with reachable at each step enabled. (destroy...195
(forward)formula 0,0,0.935106,28436,1,0,173,130113,297,118,3413,99907,290
FORMULA SmartHome-PT-05-CTLCardinality-2024-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 : 159/159 places, 188/188 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 166
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 137 transition count 163
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 127 transition count 153
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 127 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 127 transition count 152
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 119 transition count 144
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 119 transition count 144
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 114 transition count 139
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 114 transition count 139
Applied a total of 94 rules in 7 ms. Remains 114 /159 variables (removed 45) and now considering 139/188 (removed 49) transitions.
// Phase 1: matrix 139 rows 114 cols
[2024-05-30 00:47:34] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:47:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 00:47:34] [INFO ] Invariant cache hit.
[2024-05-30 00:47:34] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-30 00:47:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-30 00:47:36] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
[2024-05-30 00:47:36] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-30 00:47:36] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/253 variables, 114/127 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 127 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6008 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/253 variables, 114/127 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 138/265 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 265 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4318 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 3/3 constraints]
After SMT, in 10346ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 10347ms
Starting structural reductions in LTL mode, iteration 1 : 114/159 places, 139/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10529 ms. Remains : 114/159 places, 139/188 transitions.
[2024-05-30 00:47:45] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:47:45] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:47:45] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-30 00:47:45] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:47:45] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:47:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality14708098397019124522.gal : 1 ms
[2024-05-30 00:47:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality11744349080743573525.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14708098397019124522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11744349080743573525.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9232e+08,0.077709,5724,2,1039,5,8794,6,0,597,10159,0


Converting to forward existential form...Done !
original formula: AX(AG(AF(((p103==0)||(p41==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),!(((p103==0)||(p41==1))))] = FALSE
Hit Full ! (commute/partial/dont) 134/5/5
(forward)formula 0,0,0.339965,13644,1,0,13,44063,21,3,2879,25975,15
FORMULA SmartHome-PT-05-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 139 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 139 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 139 transition count 167
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 129 transition count 157
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 129 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 129 transition count 156
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 121 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 121 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 116 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 116 transition count 143
Applied a total of 88 rules in 5 ms. Remains 116 /159 variables (removed 43) and now considering 143/188 (removed 45) transitions.
// Phase 1: matrix 143 rows 116 cols
[2024-05-30 00:47:45] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:47:45] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 00:47:45] [INFO ] Invariant cache hit.
[2024-05-30 00:47:45] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-30 00:47:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-30 00:47:47] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 2 ms to minimize.
[2024-05-30 00:47:47] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-30 00:47:47] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/259 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 129 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5969 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/259 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 142/271 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-30 00:47:53] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-30 00:47:54] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-30 00:47:54] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 274 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7210 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 6/6 constraints]
After SMT, in 13198ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 13199ms
Starting structural reductions in LTL mode, iteration 1 : 116/159 places, 143/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13395 ms. Remains : 116/159 places, 143/188 transitions.
[2024-05-30 00:47:59] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:47:59] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:47:59] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-30 00:47:59] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:47:59] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:47:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6279963185385314125.gal : 2 ms
[2024-05-30 00:47:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14709673607817999482.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6279963185385314125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14709673607817999482.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12104e+08,0.427147,11296,2,2270,5,37212,6,0,609,33199,0


Converting to forward existential form...Done !
original formula: A(((EX((AF(((p27==0)||(p126==0))) * !(((p88==0)||(p150==1))))) * (p204==1)) * AG(!(EX(((p27==0)||(p12==1)))))) U EF(AG(((p165==0)||(p5==1...160
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U !(((p165==0)||(p5==1)))))))))) * !(E(!(E(TRUE U !(E(TRUE U !(((p165==0)||(p...365
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t9, t11, t31, t33, t65, t85, t120, t121, Intersection with reachable at each step en...211
(forward)formula 0,1,2.81086,66456,1,0,205,366498,317,135,3538,267554,341
FORMULA SmartHome-PT-05-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Graph (trivial) has 154 edges and 159 vertex of which 67 / 159 are part of one of the 5 SCC in 0 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 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 96 transition count 74
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 62 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 59 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 79 place count 59 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 87 place count 55 transition count 63
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 98 place count 44 transition count 52
Iterating global reduction 3 with 11 rules applied. Total rules applied 109 place count 44 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 44 transition count 50
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 141 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 142 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 144 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 151 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 152 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 154 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 155 place count 24 transition count 23
Applied a total of 155 rules in 28 ms. Remains 24 /159 variables (removed 135) and now considering 23/188 (removed 165) transitions.
[2024-05-30 00:48:01] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 24 cols
[2024-05-30 00:48:01] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 00:48:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 00:48:02] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2024-05-30 00:48:02] [INFO ] Invariant cache hit.
[2024-05-30 00:48:02] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-30 00:48:02] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 00:48:02] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2024-05-30 00:48:02] [INFO ] Invariant cache hit.
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 228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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 178 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 413ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/159 places, 23/188 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 544 ms. Remains : 24/159 places, 23/188 transitions.
[2024-05-30 00:48:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:48:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:48:02] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-30 00:48:02] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:48:02] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:48:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality12292264880096675226.gal : 1 ms
[2024-05-30 00:48:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality7934998211311853897.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12292264880096675226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7934998211311853897.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1296,0.00989,3476,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.031711,4056,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 : 159/159 places, 188/188 transitions.
Graph (trivial) has 153 edges and 159 vertex of which 60 / 159 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 103 transition count 80
Reduce places removed 37 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 46 rules applied. Total rules applied 84 place count 66 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 62 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 88 place count 62 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 98 place count 57 transition count 66
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 110 place count 45 transition count 54
Iterating global reduction 3 with 12 rules applied. Total rules applied 122 place count 45 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 45 transition count 52
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 152 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 153 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 155 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 163 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 165 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 167 place count 26 transition count 25
Applied a total of 167 rules in 15 ms. Remains 26 /159 variables (removed 133) and now considering 25/188 (removed 163) transitions.
[2024-05-30 00:48:02] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 26 cols
[2024-05-30 00:48:02] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 00:48:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 00:48:02] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-30 00:48:02] [INFO ] Invariant cache hit.
[2024-05-30 00:48:02] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-30 00:48:02] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 00:48:02] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-30 00:48:02] [INFO ] Invariant cache hit.
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 171 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
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 170 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 349ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 349ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/159 places, 25/188 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 488 ms. Remains : 26/159 places, 25/188 transitions.
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:48:03] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 0 ms
[2024-05-30 00:48:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15894762070956002315.gal : 1 ms
[2024-05-30 00:48:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality10373656874822376920.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15894762070956002315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10373656874822376920.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1792,0.010359,3484,2,104,5,440,6,0,127,327,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.055387,4592,1,0,41,5774,20,38,634,7081,45
FORMULA SmartHome-PT-05-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 188/188 transitions.
Graph (trivial) has 155 edges and 159 vertex of which 67 / 159 are part of one of the 5 SCC in 0 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 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 96 transition count 74
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 62 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 59 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 79 place count 59 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 85 place count 56 transition count 64
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 97 place count 44 transition count 52
Iterating global reduction 3 with 12 rules applied. Total rules applied 109 place count 44 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 44 transition count 50
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 141 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 142 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 144 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 152 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 154 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 156 place count 24 transition count 22
Applied a total of 156 rules in 19 ms. Remains 24 /159 variables (removed 135) and now considering 22/188 (removed 166) transitions.
[2024-05-30 00:48:03] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
// Phase 1: matrix 18 rows 24 cols
[2024-05-30 00:48:03] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 00:48:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 00:48:03] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2024-05-30 00:48:03] [INFO ] Invariant cache hit.
[2024-05-30 00:48:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-30 00:48:03] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 00:48:03] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2024-05-30 00:48:03] [INFO ] Invariant cache hit.
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 198 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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 162 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 365ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 365ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/159 places, 22/188 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 482 ms. Remains : 24/159 places, 22/188 transitions.
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:48:03] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:48:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15639486566734518251.gal : 1 ms
[2024-05-30 00:48:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17720262972073365707.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15639486566734518251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17720262972073365707.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,992,0.007019,3456,2,104,5,429,6,0,116,317,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.017418,3772,1,0,16,2031,24,10,590,1336,13
FORMULA SmartHome-PT-05-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 00:48:03] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 5 ms
Total runtime 178300 ms.

BK_STOP 1717030083689

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-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-5568"
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 r378-smll-171683811300369"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;