Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 139K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749251169177

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 202505121319
[2025-06-06 23:06:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 23:06:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:06:10] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2025-06-06 23:06:10] [INFO ] Transformed 571 places.
[2025-06-06 23:06:10] [INFO ] Transformed 617 transitions.
[2025-06-06 23:06:10] [INFO ] Found NUPN structural information;
[2025-06-06 23:06:10] [INFO ] Parsed PT model containing 571 places and 617 transitions and 1410 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 176 places in 8 ms
Reduce places removed 176 places and 150 transitions.
FORMULA SmartHome-PT-17-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 467/467 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 381 transition count 467
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 113 place count 282 transition count 368
Iterating global reduction 1 with 99 rules applied. Total rules applied 212 place count 282 transition count 368
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 221 place count 282 transition count 359
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 240 place count 263 transition count 340
Iterating global reduction 2 with 19 rules applied. Total rules applied 259 place count 263 transition count 340
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 276 place count 246 transition count 323
Iterating global reduction 2 with 17 rules applied. Total rules applied 293 place count 246 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 294 place count 246 transition count 322
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 301 place count 239 transition count 315
Iterating global reduction 3 with 7 rules applied. Total rules applied 308 place count 239 transition count 315
Applied a total of 308 rules in 86 ms. Remains 239 /395 variables (removed 156) and now considering 315/467 (removed 152) transitions.
// Phase 1: matrix 315 rows 239 cols
[2025-06-06 23:06:10] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:06:10] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-06-06 23:06:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:06:11] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2025-06-06 23:06:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 2/239 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/554 variables, 239/243 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 0/554 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 243 constraints, problems are : Problem set: 0 solved, 314 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 2/239 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/554 variables, 239/243 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 314/557 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:06:39] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 558 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50176ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 50187ms
Starting structural reductions in LTL mode, iteration 1 : 239/395 places, 315/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50712 ms. Remains : 239/395 places, 315/467 transitions.
Support contains 38 out of 239 places after structural reductions.
[2025-06-06 23:07:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-06 23:07:01] [INFO ] Flatten gal took : 42 ms
[2025-06-06 23:07:01] [INFO ] Initial state reduction rules for CTL removed 4 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-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 23:07:01] [INFO ] Flatten gal took : 17 ms
[2025-06-06 23:07:01] [INFO ] Input system was already deterministic with 315 transitions.
Support contains 17 out of 239 places (down from 38) after GAL structural reductions.
RANDOM walk for 6525 steps (23 resets) in 274 ms. (23 steps per ms) remains 0/10 properties
[2025-06-06 23:07:01] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:07:01] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:07:01] [INFO ] Input system was already deterministic with 315 transitions.
Computed a total of 43 stabilizing places and 42 stable transitions
Graph (complete) has 375 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 315/315 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 315
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 222 transition count 299
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 222 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 222 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 216 transition count 292
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 216 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 212 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 212 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 212 transition count 287
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 210 transition count 285
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 210 transition count 285
Applied a total of 59 rules in 23 ms. Remains 210 /239 variables (removed 29) and now considering 285/315 (removed 30) transitions.
// Phase 1: matrix 285 rows 210 cols
[2025-06-06 23:07:01] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:07:01] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 23:07:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:07:02] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-06 23:07:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 15478 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:07:23] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 0/495 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 498 constraints, problems are : Problem set: 0 solved, 284 unsolved in 23609 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, Known Traps Along Path: 1/1 constraints]
After SMT, in 39120ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 39122ms
Starting structural reductions in LTL mode, iteration 1 : 210/239 places, 285/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39325 ms. Remains : 210/239 places, 285/315 transitions.
[2025-06-06 23:07:41] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:07:41] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:07:41] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-06 23:07:41] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:07:41] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:07:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality17104492566504696734.gal : 4 ms
[2025-06-06 23:07:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9625910871744555606.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17104492566504696734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9625910871744555606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.50116e+16,0.563987,27148,2,4833,5,108471,6,0,1115,115131,0


Converting to forward existential form...Done !
original formula: EX(AG(((p456==0)||(p441==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p456==0)||(p441==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t60, t92, t95, t112, t115, t132, t135, t147, t150, t167, t182, t202, t...302
(forward)formula 0,0,6.62104,228460,1,0,364,1.30525e+06,592,256,6354,1.10532e+06,614
FORMULA SmartHome-PT-17-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 315/315 transitions.
Graph (trivial) has 254 edges and 239 vertex of which 145 / 239 are part of one of the 12 SCC in 2 ms
Free SCC test removed 133 places
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Graph (complete) has 196 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 104 transition count 107
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 73 transition count 102
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 71 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 70 transition count 101
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 73 place count 70 transition count 96
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 83 place count 65 transition count 96
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 90 place count 58 transition count 87
Iterating global reduction 4 with 7 rules applied. Total rules applied 97 place count 58 transition count 87
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 151 place count 31 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 31 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 160 place count 28 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 27 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 27 transition count 49
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 176 place count 27 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 26 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 177 place count 26 transition count 34
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 179 place count 25 transition count 34
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 181 place count 23 transition count 30
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 23 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 22 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 185 place count 21 transition count 29
Applied a total of 185 rules in 27 ms. Remains 21 /239 variables (removed 218) and now considering 29/315 (removed 286) transitions.
[2025-06-06 23:07:48] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 23:07:48] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:07:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 23:07:48] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2025-06-06 23:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:07:48] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:07:48] [INFO ] Redundant transitions in 19 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 23:07:48] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2025-06-06 23:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 32 constraints, problems are : Problem set: 0 solved, 11 unsolved in 207 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 371ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/239 places, 29/315 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 622 ms. Remains : 21/239 places, 29/315 transitions.
[2025-06-06 23:07:48] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:07:48] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:07:48] [INFO ] Input system was already deterministic with 29 transitions.
RANDOM walk for 62 steps (3 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-17-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 23:07:48] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:07:48] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:07:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14706641506124385378.gal : 1 ms
[2025-06-06 23:07:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14338716547002149325.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14706641506124385378.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14338716547002149325.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 : 239/239 places, 315/315 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 315
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 222 transition count 299
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 222 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 222 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 217 transition count 293
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 217 transition count 293
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 213 transition count 289
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 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 53 place count 213 transition count 288
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 211 transition count 286
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 211 transition count 286
Applied a total of 57 rules in 15 ms. Remains 211 /239 variables (removed 28) and now considering 286/315 (removed 29) transitions.
// Phase 1: matrix 286 rows 211 cols
[2025-06-06 23:07:48] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:07:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-06 23:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:07:48] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2025-06-06 23:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 211/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/497 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 214 constraints, problems are : Problem set: 0 solved, 285 unsolved in 15078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 211/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 285/499 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:08:10] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 500 constraints, problems are : Problem set: 0 solved, 285 unsolved in 24617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39737ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 39738ms
Starting structural reductions in LTL mode, iteration 1 : 211/239 places, 286/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39965 ms. Remains : 211/239 places, 286/315 transitions.
[2025-06-06 23:08:28] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:08:28] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:08:28] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-06 23:08:28] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:08:28] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:08:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality8055674755241834747.gal : 5 ms
[2025-06-06 23:08:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3165100115802523095.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8055674755241834747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3165100115802523095.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.71407e+16,0.435224,23184,2,3870,5,92733,6,0,1120,91531,0


Converting to forward existential form...Done !
original formula: A((p78!=1) U AX(FALSE))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((p78!=1)) * !(!(EX(!(FALSE))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...292
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.76186,205388,1,0,432,1.14587e+06,597,323,6536,1.14976e+06,697
FORMULA SmartHome-PT-17-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 315/315 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 315
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 223 transition count 300
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 223 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 223 transition count 299
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 38 place count 217 transition count 293
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 217 transition count 293
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 213 transition count 289
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 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 53 place count 213 transition count 288
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 211 transition count 286
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 211 transition count 286
Applied a total of 57 rules in 15 ms. Remains 211 /239 variables (removed 28) and now considering 286/315 (removed 29) transitions.
// Phase 1: matrix 286 rows 211 cols
[2025-06-06 23:08:34] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:08:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-06 23:08:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:08:34] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2025-06-06 23:08:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 211/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/497 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 214 constraints, problems are : Problem set: 0 solved, 285 unsolved in 15463 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 211/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 285/499 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:08:56] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 500 constraints, problems are : Problem set: 0 solved, 285 unsolved in 24243 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39730ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 39732ms
Starting structural reductions in LTL mode, iteration 1 : 211/239 places, 286/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39963 ms. Remains : 211/239 places, 286/315 transitions.
[2025-06-06 23:09:14] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:09:14] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:09:14] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-06 23:09:14] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:09:14] [INFO ] Flatten gal took : 15 ms
[2025-06-06 23:09:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality28466364518420082.gal : 2 ms
[2025-06-06 23:09:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11124678569017432774.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality28466364518420082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11124678569017432774.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.30723e+16,0.458554,23352,2,4017,5,93660,6,0,1120,92729,0


Converting to forward existential form...Done !
original formula: (AG(EX(EF(((p291==1)&&(p66==0))))) + AF(AG((p404!=0))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(EX(E(TRUE U ((p291==1)&&(p66==0))))))))),!(!(E(TRUE U !((p404!=0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t60, t92, t95, t112, t115, t117, t133, t136, t148, t151, t168, t183, t...302
(forward)formula 0,0,6.3734,201944,1,0,377,1.07075e+06,599,268,6920,949599,650
FORMULA SmartHome-PT-17-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 315/315 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 315
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 223 transition count 300
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 223 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 223 transition count 299
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 38 place count 217 transition count 293
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 217 transition count 293
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 213 transition count 289
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 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 53 place count 213 transition count 288
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 211 transition count 286
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 211 transition count 286
Applied a total of 57 rules in 14 ms. Remains 211 /239 variables (removed 28) and now considering 286/315 (removed 29) transitions.
// Phase 1: matrix 286 rows 211 cols
[2025-06-06 23:09:20] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:09:21] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-06 23:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:09:21] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2025-06-06 23:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 211/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/497 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 214 constraints, problems are : Problem set: 0 solved, 285 unsolved in 15451 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 211/214 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 285/499 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:09:42] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 500 constraints, problems are : Problem set: 0 solved, 285 unsolved in 23618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39085ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 39086ms
Starting structural reductions in LTL mode, iteration 1 : 211/239 places, 286/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39251 ms. Remains : 211/239 places, 286/315 transitions.
[2025-06-06 23:10:00] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:10:00] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:10:00] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-06 23:10:00] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:10:00] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:10:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13456811670258116299.gal : 1 ms
[2025-06-06 23:10:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17813925430406206967.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13456811670258116299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17813925430406206967.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46777e+16,0.422808,21944,2,3937,5,86555,6,0,1120,84960,0


Converting to forward existential form...Done !
original formula: EF(AX(((p204!=0)||((p97!=0)&&(p86!=0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p204!=0)||((p97!=0)&&(p86!=0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t167, t182, t202, t217,...292
(forward)formula 0,1,3.76496,126844,1,0,336,606707,589,243,6007,601701,579
FORMULA SmartHome-PT-17-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 315/315 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 315
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 222 transition count 299
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 222 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 222 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 216 transition count 292
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 216 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 213 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 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 53 place count 213 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 212 transition count 287
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 212 transition count 287
Applied a total of 55 rules in 8 ms. Remains 212 /239 variables (removed 27) and now considering 287/315 (removed 28) transitions.
// Phase 1: matrix 287 rows 212 cols
[2025-06-06 23:10:04] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:10:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 23:10:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:10:04] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-06 23:10:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 15370 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:10:25] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 502 constraints, problems are : Problem set: 0 solved, 286 unsolved in 23542 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, Known Traps Along Path: 1/1 constraints]
After SMT, in 38928ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 38928ms
Starting structural reductions in LTL mode, iteration 1 : 212/239 places, 287/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39076 ms. Remains : 212/239 places, 287/315 transitions.
[2025-06-06 23:10:43] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:10:43] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:10:43] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-06 23:10:43] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:10:43] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:10:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality11167251089292210692.gal : 1 ms
[2025-06-06 23:10:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality5379227347060486198.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11167251089292210692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5379227347060486198.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.36935e+16,0.527743,25452,2,4349,5,103486,6,0,1125,103462,0


Converting to forward existential form...Done !
original formula: EX(EF(((p348==1)&&(((p87==0)||(p151==0))||(p389==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((p348==1)&&(((p87==0)||(p151==0))||(p389==1))))] != FALSE
(forward)formula 0,1,0.905335,27116,1,0,9,106287,9,1,2174,107047,4
FORMULA SmartHome-PT-17-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 315/315 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 315
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 222 transition count 299
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 222 transition count 299
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 216 transition count 293
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 216 transition count 293
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 212 transition count 289
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 212 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 212 transition count 288
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 210 transition count 286
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 210 transition count 286
Applied a total of 58 rules in 8 ms. Remains 210 /239 variables (removed 29) and now considering 286/315 (removed 29) transitions.
// Phase 1: matrix 286 rows 210 cols
[2025-06-06 23:10:44] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:10:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 23:10:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:10:44] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2025-06-06 23:10:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 15075 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:11:05] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/496 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 499 constraints, problems are : Problem set: 0 solved, 285 unsolved in 23995 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, Known Traps Along Path: 1/1 constraints]
After SMT, in 39093ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 39093ms
Starting structural reductions in LTL mode, iteration 1 : 210/239 places, 286/315 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39243 ms. Remains : 210/239 places, 286/315 transitions.
[2025-06-06 23:11:23] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:11:23] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:11:23] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-06 23:11:23] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:11:23] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:11:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5743499261069617554.gal : 1 ms
[2025-06-06 23:11:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality3778053196674995034.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5743499261069617554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3778053196674995034.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.91355e+16,0.48764,24432,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.
[2025-06-06 23:11:53] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:11:53] [INFO ] Applying decomposition
[2025-06-06 23:11:53] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph10963667952285150376.txt' '-o' '/tmp/graph10963667952285150376.bin' '-w' '/tmp/graph10963667952285150376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10963667952285150376.bin' '-l' '-1' '-v' '-w' '/tmp/graph10963667952285150376.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:11:53] [INFO ] Decomposing Gal with order
[2025-06-06 23:11:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:11:53] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-06 23:11:53] [INFO ] Flatten gal took : 42 ms
[2025-06-06 23:11:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2025-06-06 23:11:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality6417173888225579901.gal : 3 ms
[2025-06-06 23:11:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality12983763619496287230.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6417173888225579901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12983763619496287230.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.91355e+16,0.07765,7228,393,38,6612,477,446,9834,52,1380,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(EX((i11.i0.i0.u61.p369==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U EX((i11.i0.i0.u61.p369==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t30, t95, t115, t135, t150, i0.t10, i0.u1.t254, i0.u73.t27, i2.u7.t251, i3.u15.t237, i4.u...448
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 315/315 transitions.
Graph (trivial) has 251 edges and 239 vertex of which 138 / 239 are part of one of the 12 SCC in 0 ms
Free SCC test removed 126 places
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 205 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 111 transition count 113
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 77 place count 77 transition count 106
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 74 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 73 transition count 105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 82 place count 73 transition count 100
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 92 place count 68 transition count 100
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 99 place count 61 transition count 91
Iterating global reduction 4 with 7 rules applied. Total rules applied 106 place count 61 transition count 91
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 160 place count 34 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 34 transition count 60
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 33 transition count 56
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 33 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 171 place count 30 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 29 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 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 5 with 12 rules applied. Total rules applied 185 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 28 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 186 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 6 with 2 rules applied. Total rules applied 188 place count 27 transition count 36
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 190 place count 25 transition count 32
Iterating global reduction 6 with 2 rules applied. Total rules applied 192 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 194 place count 23 transition count 31
Applied a total of 194 rules in 14 ms. Remains 23 /239 variables (removed 216) and now considering 31/315 (removed 284) transitions.
[2025-06-06 23:12:23] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2025-06-06 23:12:23] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:12:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-06 23:12:23] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2025-06-06 23:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:12:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:12:23] [INFO ] Redundant transitions in 16 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 23:12:23] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2025-06-06 23:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 163 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 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 172 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 339ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/239 places, 31/315 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 432 ms. Remains : 23/239 places, 31/315 transitions.
[2025-06-06 23:12:24] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:12:24] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:12:24] [INFO ] Input system was already deterministic with 31 transitions.
[2025-06-06 23:12:24] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:12:24] [INFO ] Flatten gal took : 0 ms
[2025-06-06 23:12:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9728989393644551668.gal : 0 ms
[2025-06-06 23:12:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12527253622473084145.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9728989393644551668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12527253622473084145.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,123648,0.005418,3896,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, t18, t20, t23, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,1,0.048436,6584,1,0,137,15273,79,80,611,21870,164
FORMULA SmartHome-PT-17-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 23:12:24] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:12:24] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:12:24] [INFO ] Applying decomposition
[2025-06-06 23:12:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4711901393518184015.txt' '-o' '/tmp/graph4711901393518184015.bin' '-w' '/tmp/graph4711901393518184015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4711901393518184015.bin' '-l' '-1' '-v' '-w' '/tmp/graph4711901393518184015.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:12:24] [INFO ] Decomposing Gal with order
[2025-06-06 23:12:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:12:24] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 23:12:24] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:12:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2025-06-06 23:12:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality5050716510395515766.gal : 3 ms
[2025-06-06 23:12:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality483107488705214694.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5050716510395515766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality483107488705214694.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.65907e+17,0.09732,8032,502,44,7626,877,584,12215,81,2801,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(EX((i12.i0.u53.p369==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U EX((i12.i0.u53.p369==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t114, t159, t246, i0.u1.t283, i1.i1.u11.t280, i2.u18.t264, i3.u20.t243, i4.u24.t228, i6....518
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local SCC at level 2
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,49.4286,493280,1,0,757401,1049,3962,1.43688e+06,401,5757,536154
FORMULA SmartHome-PT-17-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 423466 ms.

BK_STOP 1749251593845

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-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-5832"
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 r212-tall-174901995100817"
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.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 ;