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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 03:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 139K 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-17-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-17-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717035909094

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 02:25:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 02:25:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:25:12] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-05-30 02:25:12] [INFO ] Transformed 571 places.
[2024-05-30 02:25:12] [INFO ] Transformed 617 transitions.
[2024-05-30 02:25:12] [INFO ] Found NUPN structural information;
[2024-05-30 02:25:12] [INFO ] Parsed PT model containing 571 places and 617 transitions and 1410 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Deduced a syphon composed of 176 places in 14 ms
Reduce places removed 176 places and 150 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-17-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 467/467 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 383 transition count 467
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 102 place count 293 transition count 377
Iterating global reduction 1 with 90 rules applied. Total rules applied 192 place count 293 transition count 377
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 201 place count 293 transition count 368
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 215 place count 279 transition count 354
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 279 transition count 354
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 240 place count 268 transition count 343
Iterating global reduction 2 with 11 rules applied. Total rules applied 251 place count 268 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 252 place count 268 transition count 342
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 258 place count 262 transition count 336
Iterating global reduction 3 with 6 rules applied. Total rules applied 264 place count 262 transition count 336
Applied a total of 264 rules in 201 ms. Remains 262 /395 variables (removed 133) and now considering 336/467 (removed 131) transitions.
// Phase 1: matrix 336 rows 262 cols
[2024-05-30 02:25:12] [INFO ] Computed 6 invariants in 20 ms
[2024-05-30 02:25:13] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-30 02:25:13] [INFO ] Invariant cache hit.
[2024-05-30 02:25:13] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-05-30 02:25:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/262 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-30 02:25:20] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 336/598 variables, 262/269 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 0/598 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 269 constraints, problems are : Problem set: 0 solved, 335 unsolved in 27839 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/262 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 336/598 variables, 262/269 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 335/604 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/598 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 604 constraints, problems are : Problem set: 0 solved, 335 unsolved in 22614 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 1/1 constraints]
After SMT, in 50674ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 50713ms
Starting structural reductions in LTL mode, iteration 1 : 262/395 places, 336/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51897 ms. Remains : 262/395 places, 336/467 transitions.
Support contains 66 out of 262 places after structural reductions.
[2024-05-30 02:26:04] [INFO ] Flatten gal took : 73 ms
[2024-05-30 02:26:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA SmartHome-PT-17-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:26:04] [INFO ] Flatten gal took : 29 ms
[2024-05-30 02:26:04] [INFO ] Input system was already deterministic with 336 transitions.
Support contains 31 out of 262 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (148 resets) in 2035 ms. (19 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40003 steps (16 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
[2024-05-30 02:26:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/74 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 101/175 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/287 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 118/405 variables, 54/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/406 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 83/489 variables, 46/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/489 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 57/546 variables, 29/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/546 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 21/567 variables, 14/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/567 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/575 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/575 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/580 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/580 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/584 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/584 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/589 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/589 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/595 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/595 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 3/598 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/598 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/598 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/74 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 101/175 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/287 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/405 variables, 54/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/406 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 83/489 variables, 46/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/489 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 57/546 variables, 29/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 21/567 variables, 14/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/575 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/575 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/580 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/580 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/584 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/584 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/589 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/589 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 6/595 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/595 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/598 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/598 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/598 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1038ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 336/336 transitions.
Graph (trivial) has 277 edges and 262 vertex of which 149 / 262 are part of one of the 12 SCC in 6 ms
Free SCC test removed 137 places
Drop transitions (Empty/Sink Transition effects.) removed 199 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 200 transitions.
Graph (complete) has 192 edges and 125 vertex of which 118 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 118 transition count 84
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 72 transition count 73
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 116 place count 67 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 116 place count 67 transition count 68
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 126 place count 62 transition count 68
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 54 transition count 60
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 54 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 54 transition count 59
Performed 30 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 203 place count 24 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 32 edges and 24 vertex of which 11 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 4 with 19 rules applied. Total rules applied 222 place count 11 transition count 8
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 224 place count 11 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 10 transition count 5
Reduce places removed 4 places and 0 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 6 with 7 rules applied. Total rules applied 232 place count 6 transition count 2
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 235 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 235 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 237 place count 2 transition count 1
Applied a total of 237 rules in 63 ms. Remains 2 /262 variables (removed 260) and now considering 1/336 (removed 335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 2/262 places, 1/336 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
[2024-05-30 02:26:06] [INFO ] Flatten gal took : 23 ms
[2024-05-30 02:26:06] [INFO ] Flatten gal took : 21 ms
[2024-05-30 02:26:06] [INFO ] Input system was already deterministic with 336 transitions.
Computed a total of 55 stabilizing places and 53 stable transitions
Graph (complete) has 400 edges and 262 vertex of which 259 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Graph (trivial) has 274 edges and 262 vertex of which 149 / 262 are part of one of the 12 SCC in 1 ms
Free SCC test removed 137 places
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Graph (complete) has 220 edges and 125 vertex of which 122 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 121 transition count 113
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 53 rules applied. Total rules applied 99 place count 77 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 103 place count 73 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 103 place count 73 transition count 99
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 113 place count 68 transition count 99
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 121 place count 60 transition count 91
Iterating global reduction 3 with 8 rules applied. Total rules applied 129 place count 60 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 60 transition count 90
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 184 place count 33 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 186 place count 33 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 31 transition count 59
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 30 transition count 55
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 30 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 206 place count 30 transition count 41
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 208 place count 28 transition count 37
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 28 transition count 37
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 28 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 28 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 26 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 215 place count 25 transition count 34
Applied a total of 215 rules in 46 ms. Remains 25 /262 variables (removed 237) and now considering 34/336 (removed 302) transitions.
[2024-05-30 02:26:06] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
// Phase 1: matrix 26 rows 25 cols
[2024-05-30 02:26:06] [INFO ] Computed 2 invariants in 4 ms
[2024-05-30 02:26:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 02:26:06] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2024-05-30 02:26:06] [INFO ] Invariant cache hit.
[2024-05-30 02:26:06] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-30 02:26:06] [INFO ] Redundant transitions in 29 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 02:26:07] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2024-05-30 02:26:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 21/41 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 3/44 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/51 variables, and 24 constraints, problems are : Problem set: 0 solved, 13 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/25 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/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 21/41 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 3/44 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 2/46 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 2/48 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/48 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/51 variables, and 39 constraints, problems are : Problem set: 0 solved, 13 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 538ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/262 places, 34/336 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 697 ms. Remains : 25/262 places, 34/336 transitions.
[2024-05-30 02:26:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:26:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:26:07] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-30 02:26:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:26:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:26:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4923821669712531221.gal : 1 ms
[2024-05-30 02:26:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality12582689962221566750.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/CTLCardinality4923821669712531221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12582689962221566750.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,353280,0.020784,3380,2,62,5,344,6,0,110,323,0


Converting to forward existential form...Done !
original formula: EG(A(!(EF((p459==0))) U EF((p86!=0))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (p86!=0))) U (!(!(E(TRUE U (p459==0)))) * !(E(TRUE U (p86!=0))))) + EG(!(E(TRUE U (p8...176
Reverse transition relation is NOT exact ! Due to transitions t16, t21, t23, t25, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.160289,6632,1,0,184,18148,93,148,701,29630,214
FORMULA SmartHome-PT-17-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Graph (trivial) has 277 edges and 262 vertex of which 149 / 262 are part of one of the 12 SCC in 2 ms
Free SCC test removed 137 places
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Graph (complete) has 220 edges and 125 vertex of which 122 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 121 transition count 113
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 55 rules applied. Total rules applied 101 place count 77 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 72 transition count 102
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 106 place count 72 transition count 97
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 116 place count 67 transition count 97
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 125 place count 58 transition count 88
Iterating global reduction 3 with 9 rules applied. Total rules applied 134 place count 58 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 58 transition count 87
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 187 place count 32 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 189 place count 32 transition count 59
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 191 place count 30 transition count 52
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 30 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 197 place count 28 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 27 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 212 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 214 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 214 place count 25 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 216 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 218 place count 22 transition count 28
Iterating global reduction 6 with 2 rules applied. Total rules applied 220 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 221 place count 21 transition count 27
Applied a total of 221 rules in 56 ms. Remains 21 /262 variables (removed 241) and now considering 27/336 (removed 309) transitions.
[2024-05-30 02:26:07] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2024-05-30 02:26:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 02:26:07] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 02:26:07] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:26:07] [INFO ] Invariant cache hit.
[2024-05-30 02:26:07] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-30 02:26:07] [INFO ] Redundant transitions in 36 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-30 02:26:07] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:26:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 18/36 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/42 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 235 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 18/36 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/39 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/42 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 288 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 534ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/262 places, 27/336 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 750 ms. Remains : 21/262 places, 27/336 transitions.
[2024-05-30 02:26:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:26:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:26:08] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 936 steps (61 resets) in 10 ms. (85 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-17-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 02:26:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:26:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:26:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13321971508069020242.gal : 2 ms
[2024-05-30 02:26:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2432681580654961917.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13321971508069020242.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2432681580654961917.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 336
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 30 place count 232 transition count 309
Iterating global reduction 1 with 27 rules applied. Total rules applied 57 place count 232 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 232 transition count 308
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 222 transition count 298
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 222 transition count 298
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 213 transition count 289
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 213 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 213 transition count 288
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 209 transition count 284
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 209 transition count 284
Applied a total of 105 rules in 56 ms. Remains 209 /262 variables (removed 53) and now considering 284/336 (removed 52) transitions.
// Phase 1: matrix 284 rows 209 cols
[2024-05-30 02:26:08] [INFO ] Computed 3 invariants in 6 ms
[2024-05-30 02:26:08] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 02:26:08] [INFO ] Invariant cache hit.
[2024-05-30 02:26:08] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-30 02:26:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/493 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 212 constraints, problems are : Problem set: 0 solved, 283 unsolved in 17715 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/493 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 283/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 495 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15328 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
After SMT, in 33139ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 33150ms
Starting structural reductions in LTL mode, iteration 1 : 209/262 places, 284/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33554 ms. Remains : 209/262 places, 284/336 transitions.
[2024-05-30 02:26:42] [INFO ] Flatten gal took : 26 ms
[2024-05-30 02:26:42] [INFO ] Flatten gal took : 24 ms
[2024-05-30 02:26:42] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-30 02:26:42] [INFO ] Flatten gal took : 20 ms
[2024-05-30 02:26:42] [INFO ] Flatten gal took : 19 ms
[2024-05-30 02:26:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5696616912235388842.gal : 10 ms
[2024-05-30 02:26:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality9640227185191787841.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/CTLCardinality5696616912235388842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9640227185191787841.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.68692e+16,0.972026,23204,2,3957,5,94713,6,0,1110,94825,0


Converting to forward existential form...Done !
original formula: AX(AX(AX(FALSE)))
=> equivalent forward existential formula: [(EY(EY(EY(Init))) * !(FALSE))] = FALSE
(forward)formula 0,0,0.994622,23204,1,0,8,94713,7,1,1360,94825,3
FORMULA SmartHome-PT-17-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 336
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 233 transition count 310
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 233 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 233 transition count 309
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 65 place count 224 transition count 300
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 224 transition count 300
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 216 transition count 292
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 216 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 216 transition count 291
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 212 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 212 transition count 287
Applied a total of 99 rules in 45 ms. Remains 212 /262 variables (removed 50) and now considering 287/336 (removed 49) transitions.
// Phase 1: matrix 287 rows 212 cols
[2024-05-30 02:26:43] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:26:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 02:26:43] [INFO ] Invariant cache hit.
[2024-05-30 02:26:43] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-30 02:26:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 215 constraints, problems are : Problem set: 0 solved, 286 unsolved in 16953 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 286/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 501 constraints, problems are : Problem set: 0 solved, 286 unsolved in 14959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
After SMT, in 31993ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32000ms
Starting structural reductions in LTL mode, iteration 1 : 212/262 places, 287/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32391 ms. Remains : 212/262 places, 287/336 transitions.
[2024-05-30 02:27:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:27:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:27:15] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-30 02:27:15] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:27:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:27:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality2041562547854080523.gal : 3 ms
[2024-05-30 02:27:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality18247916177188037553.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/CTLCardinality2041562547854080523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18247916177188037553.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,6.23739e+16,0.618687,22632,2,4144,5,91086,6,0,1125,89813,0


Converting to forward existential form...Done !
original formula: EF((EG(AG(EX(((p558==0)||(p376==1))))) + AF(((p318==1)&&(p233==1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(E(TRUE U !(EX(((p558==0)||(p376==1)))))))] != FALSE + [(FwdU(Init,TRUE) * !(EG(!(((p318...186
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t60, t92, t95, t112, t115, t132, t135, t147, t152, t169, t184, t204, t219,...292
Detected timeout of ITS tools.
[2024-05-30 02:27:45] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:27:45] [INFO ] Applying decomposition
[2024-05-30 02:27:45] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph241729463578048321.txt' '-o' '/tmp/graph241729463578048321.bin' '-w' '/tmp/graph241729463578048321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph241729463578048321.bin' '-l' '-1' '-v' '-w' '/tmp/graph241729463578048321.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:27:46] [INFO ] Decomposing Gal with order
[2024-05-30 02:27:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:27:46] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-30 02:27:46] [INFO ] Flatten gal took : 98 ms
[2024-05-30 02:27:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-30 02:27:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality8775640818705347162.gal : 11 ms
[2024-05-30 02:27:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17830767192236738970.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/CTLCardinality8775640818705347162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17830767192236738970.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.23739e+16,0.217002,7260,353,44,6863,809,463,11380,59,2451,0


Converting to forward existential form...Done !
original formula: EF((EG(AG(EX(((i14.u76.p558==0)||(i10.i0.u67.p376==1))))) + AF(((i8.u49.p318==1)&&(i6.u35.p233==1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(E(TRUE U !(EX(((i14.u76.p558==0)||(i10.i0.u67.p376==1)))))))] != FALSE + [(FwdU(Init,TR...219
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t95, t115, t135, i1.u9.t253, i2.u15.t239, i3.u19.t219, i4.u20.t204, i5.u25.t184, i6...429
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,0.804811,24156,1,0,40877,809,3215,76922,313,2451,75762
FORMULA SmartHome-PT-17-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 336
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 30 place count 232 transition count 309
Iterating global reduction 1 with 27 rules applied. Total rules applied 57 place count 232 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 232 transition count 308
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 222 transition count 298
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 222 transition count 298
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 213 transition count 289
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 213 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 213 transition count 288
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 209 transition count 284
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 209 transition count 284
Applied a total of 105 rules in 33 ms. Remains 209 /262 variables (removed 53) and now considering 284/336 (removed 52) transitions.
// Phase 1: matrix 284 rows 209 cols
[2024-05-30 02:27:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:27:47] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 02:27:47] [INFO ] Invariant cache hit.
[2024-05-30 02:27:47] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-30 02:27:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/493 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 212 constraints, problems are : Problem set: 0 solved, 283 unsolved in 17737 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/493 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 283/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 495 constraints, problems are : Problem set: 0 solved, 283 unsolved in 10323 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
After SMT, in 28105ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 28109ms
Starting structural reductions in LTL mode, iteration 1 : 209/262 places, 284/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28573 ms. Remains : 209/262 places, 284/336 transitions.
[2024-05-30 02:28:15] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:28:15] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:28:15] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-30 02:28:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:28:15] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:28:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality14896700605755185191.gal : 2 ms
[2024-05-30 02:28:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality210943913696195971.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/CTLCardinality14896700605755185191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality210943913696195971.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.68692e+16,0.712239,23236,2,3957,5,94713,6,0,1110,94825,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.68692e+16,0.122748,7036,379,41,6509,699,491,11124,58,1847,0


Converting to forward existential form...Done !
original formula: EX(EG(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(EY(Init),EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i0.u9.t250, i1.u11.t236, i2.u17.t216, i3.u21.t201, i4.i0.u1....425
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,23.3201,310900,1,0,533466,699,2615,895509,263,2865,502144
FORMULA SmartHome-PT-17-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 336
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 240 transition count 317
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 240 transition count 317
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 234 transition count 311
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 234 transition count 311
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 228 transition count 305
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 228 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 228 transition count 304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 225 transition count 301
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 225 transition count 301
Applied a total of 72 rules in 21 ms. Remains 225 /262 variables (removed 37) and now considering 301/336 (removed 35) transitions.
// Phase 1: matrix 301 rows 225 cols
[2024-05-30 02:29:09] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:29:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 02:29:09] [INFO ] Invariant cache hit.
[2024-05-30 02:29:09] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-30 02:29:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/526 variables, 225/228 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/526 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 228 constraints, problems are : Problem set: 0 solved, 300 unsolved in 18477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/526 variables, 225/228 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 300/528 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 528 constraints, problems are : Problem set: 0 solved, 300 unsolved in 17447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 35968ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 35972ms
Starting structural reductions in LTL mode, iteration 1 : 225/262 places, 301/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36231 ms. Remains : 225/262 places, 301/336 transitions.
[2024-05-30 02:29:45] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:29:45] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:29:45] [INFO ] Input system was already deterministic with 301 transitions.
[2024-05-30 02:29:45] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:29:45] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:29:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8241640005004936084.gal : 8 ms
[2024-05-30 02:29:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality11552325509273605542.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/CTLCardinality8241640005004936084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11552325509273605542.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.35057e+17,0.901205,24352,2,4289,5,98923,6,0,1191,98524,0


Converting to forward existential form...Done !
original formula: !(A(((!(((EX(TRUE) + (p429==0)) + (p210==1))) * (p408==1)) * ((p200!=0)||(p61==0))) U E((p345!=1) U ((A((p360==0) U ((p322==0)||(p271==1)...221
=> equivalent forward existential formula: ([((FwdU(Init,!(E((p345!=1) U ((!((E(!(((p322==0)||(p271==1))) U (!((p360==0)) * !(((p322==0)||(p271==1))))) + E...775
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t29, t32, t36, t64, t69, t98, t101, t103, t119, t122, t141, t144, t156, t159, t1...313
(forward)formula 0,0,14.8894,401956,1,0,595,2.39192e+06,652,380,6580,2.58694e+06,873
FORMULA SmartHome-PT-17-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Graph (trivial) has 277 edges and 262 vertex of which 149 / 262 are part of one of the 12 SCC in 2 ms
Free SCC test removed 137 places
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Graph (complete) has 220 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 122 transition count 112
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 56 rules applied. Total rules applied 103 place count 77 transition count 101
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 72 transition count 101
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 108 place count 72 transition count 97
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 116 place count 68 transition count 97
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 124 place count 60 transition count 89
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 60 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 60 transition count 88
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 189 place count 32 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 32 transition count 58
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 193 place count 30 transition count 51
Iterating global reduction 5 with 2 rules applied. Total rules applied 195 place count 30 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 199 place count 28 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 27 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 27 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 214 place count 27 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 216 place count 25 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 216 place count 25 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 24 transition count 31
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 220 place count 22 transition count 27
Iterating global reduction 6 with 2 rules applied. Total rules applied 222 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 21 transition count 26
Applied a total of 223 rules in 30 ms. Remains 21 /262 variables (removed 241) and now considering 26/336 (removed 310) transitions.
[2024-05-30 02:30:00] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 21 cols
[2024-05-30 02:30:00] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 02:30:00] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 02:30:00] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-05-30 02:30:00] [INFO ] Invariant cache hit.
[2024-05-30 02:30:00] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-30 02:30:00] [INFO ] Redundant transitions in 31 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 02:30:00] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-05-30 02:30:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 17/36 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/41 variables, and 21 constraints, problems are : Problem set: 0 solved, 11 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 17/36 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/41 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 384ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 384ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/262 places, 26/336 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 545 ms. Remains : 21/262 places, 26/336 transitions.
[2024-05-30 02:30:01] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:30:01] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:30:01] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-30 02:30:01] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:30:01] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:30:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2481908058932063866.gal : 2 ms
[2024-05-30 02:30:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality7561188080001070407.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/CTLCardinality2481908058932063866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7561188080001070407.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,33600,0.005904,3472,2,59,5,318,6,0,88,307,0


Converting to forward existential form...Done !
original formula: EF(EG((p556==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p556==1))] != FALSE
Hit Full ! (commute/partial/dont) 25/0/1
(forward)formula 0,1,0.011446,3792,1,0,9,1193,19,3,469,905,8
FORMULA SmartHome-PT-17-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 336
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 233 transition count 310
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 233 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 233 transition count 309
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 65 place count 224 transition count 300
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 224 transition count 300
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 217 transition count 293
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 217 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 217 transition count 292
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 214 transition count 289
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 214 transition count 289
Applied a total of 95 rules in 20 ms. Remains 214 /262 variables (removed 48) and now considering 289/336 (removed 47) transitions.
// Phase 1: matrix 289 rows 214 cols
[2024-05-30 02:30:01] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:30:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 02:30:01] [INFO ] Invariant cache hit.
[2024-05-30 02:30:01] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-30 02:30:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/503 variables, 214/217 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 0/503 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 217 constraints, problems are : Problem set: 0 solved, 288 unsolved in 12786 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/503 variables, 214/217 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 288/505 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/503 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 505 constraints, problems are : Problem set: 0 solved, 288 unsolved in 12764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 25613ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 25618ms
Starting structural reductions in LTL mode, iteration 1 : 214/262 places, 289/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25935 ms. Remains : 214/262 places, 289/336 transitions.
[2024-05-30 02:30:27] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:30:27] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:30:27] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-30 02:30:27] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:30:27] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:30:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality5669412716654916703.gal : 2 ms
[2024-05-30 02:30:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality9715675581010314306.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/CTLCardinality5669412716654916703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9715675581010314306.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,8.06508e+16,0.63355,22140,2,4071,5,89558,6,0,1135,87108,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) * EG(EF(((p270!=0)&&(p202!=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * [(Init * !(EG(E(TRUE U ((p270!=0)&&(p202!=1))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t134, t137, t149, t152, t169, t186, t206, t221,...292
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.93617,156540,1,0,355,801598,607,257,6971,767604,617
FORMULA SmartHome-PT-17-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 336
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 233 transition count 310
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 233 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 233 transition count 309
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 66 place count 223 transition count 299
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 223 transition count 299
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 214 transition count 290
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 214 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 214 transition count 289
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 210 transition count 285
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 210 transition count 285
Applied a total of 103 rules in 11 ms. Remains 210 /262 variables (removed 52) and now considering 285/336 (removed 51) transitions.
// Phase 1: matrix 285 rows 210 cols
[2024-05-30 02:30:33] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:30:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 02:30:33] [INFO ] Invariant cache hit.
[2024-05-30 02:30:33] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-30 02:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/495 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/495 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 213 constraints, problems are : Problem set: 0 solved, 284 unsolved in 18447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/495 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 284/497 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/495 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 497 constraints, problems are : Problem set: 0 solved, 284 unsolved in 15370 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
After SMT, in 33868ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 33873ms
Starting structural reductions in LTL mode, iteration 1 : 210/262 places, 285/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34194 ms. Remains : 210/262 places, 285/336 transitions.
[2024-05-30 02:31:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:31:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:31:07] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-30 02:31:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:31:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:31:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality11161044375973739845.gal : 2 ms
[2024-05-30 02:31:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality7901124667921125178.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/CTLCardinality11161044375973739845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7901124667921125178.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,6.06354e+16,0.77308,21420,2,3777,5,84993,6,0,1115,83850,0


Converting to forward existential form...Done !
original formula: (EX((((p92==0)&&(p190==1)) * E(((p339==1)||(p315==1)) U AG((p315==1))))) + AG((p455==1)))
=> equivalent forward existential formula: [(FwdU((Init * !(EX((((p92==0)&&(p190==1)) * E(((p339==1)||(p315==1)) U !(E(TRUE U !((p315==1))))))))),TRUE) * !...176
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...292
(forward)formula 0,0,5.80406,141120,1,0,337,685164,600,243,6526,663439,584
FORMULA SmartHome-PT-17-CTLCardinality-2024-11 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 : 262/262 places, 336/336 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 336
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 233 transition count 310
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 233 transition count 310
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 223 transition count 300
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 223 transition count 300
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 84 place count 214 transition count 291
Iterating global reduction 1 with 9 rules applied. Total rules applied 93 place count 214 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 214 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 210 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 210 transition count 286
Applied a total of 102 rules in 12 ms. Remains 210 /262 variables (removed 52) and now considering 286/336 (removed 50) transitions.
// Phase 1: matrix 286 rows 210 cols
[2024-05-30 02:31:13] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:31:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 02:31:13] [INFO ] Invariant cache hit.
[2024-05-30 02:31:13] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-30 02:31:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/496 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/496 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 213 constraints, problems are : Problem set: 0 solved, 285 unsolved in 15535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/496 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 285/498 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/496 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 498 constraints, problems are : Problem set: 0 solved, 285 unsolved in 14004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
After SMT, in 29577ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 29580ms
Starting structural reductions in LTL mode, iteration 1 : 210/262 places, 286/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29829 ms. Remains : 210/262 places, 286/336 transitions.
[2024-05-30 02:31:42] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:31:42] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:31:43] [INFO ] Input system was already deterministic with 286 transitions.
[2024-05-30 02:31:43] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:31:43] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:31:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5026752902249601992.gal : 2 ms
[2024-05-30 02:31:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality7841775489972838228.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/CTLCardinality5026752902249601992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7841775489972838228.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.91355e+16,1.18684,24084,2,4134,5,99569,6,0,1116,98949,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(EX((p369==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U EX((p369==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t64, t92, t95, t112, t115, t132, t135, t147, t150, t167, t182, t2...301
Detected timeout of ITS tools.
[2024-05-30 02:32:13] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:13] [INFO ] Applying decomposition
[2024-05-30 02:32:13] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7040435030872812554.txt' '-o' '/tmp/graph7040435030872812554.bin' '-w' '/tmp/graph7040435030872812554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7040435030872812554.bin' '-l' '-1' '-v' '-w' '/tmp/graph7040435030872812554.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:32:13] [INFO ] Decomposing Gal with order
[2024-05-30 02:32:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:32:13] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-30 02:32:13] [INFO ] Flatten gal took : 29 ms
[2024-05-30 02:32:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-30 02:32:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17471539325136319850.gal : 7 ms
[2024-05-30 02:32:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality18386198907488244336.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/CTLCardinality17471539325136319850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18386198907488244336.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.91355e+16,0.199553,9160,542,48,10643,596,480,19364,64,1567,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(EX((i10.i0.u52.p369==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U EX((i10.i0.u52.p369==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t30, t95, t115, t135, t150, i0.i0.u1.t254, i1.u11.t237, i2.u20.t217, i3.u26.t202, i4...446
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 336/336 transitions.
Graph (trivial) has 273 edges and 262 vertex of which 142 / 262 are part of one of the 12 SCC in 1 ms
Free SCC test removed 130 places
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 229 edges and 132 vertex of which 129 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 128 transition count 119
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 60 rules applied. Total rules applied 109 place count 81 transition count 106
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 116 place count 75 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 74 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 117 place count 74 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 125 place count 70 transition count 101
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 134 place count 61 transition count 92
Iterating global reduction 4 with 9 rules applied. Total rules applied 143 place count 61 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 61 transition count 91
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 198 place count 34 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 200 place count 34 transition count 62
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 202 place count 32 transition count 55
Iterating global reduction 6 with 2 rules applied. Total rules applied 204 place count 32 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 208 place count 30 transition count 53
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 209 place count 29 transition count 49
Iterating global reduction 6 with 1 rules applied. Total rules applied 210 place count 29 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 222 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 223 place count 28 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 223 place count 28 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 225 place count 27 transition count 36
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 227 place count 25 transition count 32
Iterating global reduction 7 with 2 rules applied. Total rules applied 229 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 230 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 231 place count 23 transition count 31
Applied a total of 231 rules in 18 ms. Remains 23 /262 variables (removed 239) and now considering 31/336 (removed 305) transitions.
[2024-05-30 02:32:43] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-30 02:32:43] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 02:32:43] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 02:32:43] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2024-05-30 02:32:43] [INFO ] Invariant cache hit.
[2024-05-30 02:32:43] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-30 02:32:43] [INFO ] Redundant transitions in 23 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 02:32:43] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2024-05-30 02:32:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/45 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/48 variables, and 23 constraints, problems are : Problem set: 0 solved, 14 unsolved in 212 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/45 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/48 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 207 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 423ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/262 places, 31/336 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 543 ms. Remains : 23/262 places, 31/336 transitions.
[2024-05-30 02:32:43] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:32:43] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:32:43] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-30 02:32:43] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:32:43] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:32:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality4486760001467806958.gal : 1 ms
[2024-05-30 02:32:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality1916635698366126009.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/CTLCardinality4486760001467806958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1916635698366126009.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,123648,0.008302,3492,2,87,5,551,6,0,106,516,0


Converting to forward existential form...Done !
original formula: EF((AF((p395!=0)) * (p433!=1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p433!=1)) * !(EG(!((p395!=0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t19, t21, t23, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,1,0.072214,6188,1,0,137,15273,79,80,611,21996,164
FORMULA SmartHome-PT-17-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 02:32:43] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:43] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:43] [INFO ] Applying decomposition
[2024-05-30 02:32:43] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3909014654620336336.txt' '-o' '/tmp/graph3909014654620336336.bin' '-w' '/tmp/graph3909014654620336336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3909014654620336336.bin' '-l' '-1' '-v' '-w' '/tmp/graph3909014654620336336.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:32:43] [INFO ] Decomposing Gal with order
[2024-05-30 02:32:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:32:43] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-30 02:32:44] [INFO ] Flatten gal took : 18 ms
[2024-05-30 02:32:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2024-05-30 02:32:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality17005828783198897243.gal : 5 ms
[2024-05-30 02:32:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality16230908867852808468.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/CTLCardinality17005828783198897243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16230908867852808468.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.08089e+17,0.182793,7800,583,39,8319,569,613,11277,67,1430,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(EX((i10.u75.p369==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U EX((i10.u75.p369==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t118, t166, i0.t3, i0.u1.t304, i0.u98.t8, i0.u98.t9, i1.u62.t120, i1.u62.t136, i2.u8.t28...505
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,24.7824,334368,1,0,663610,680,4082,1.00966e+06,324,2703,563820
FORMULA SmartHome-PT-17-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 477303 ms.

BK_STOP 1717036388968

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

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