Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 150K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 181K 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-19-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2023-15
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-00
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-01
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-02
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-03
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-04
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-05
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-06
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-07
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-08
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-09
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-10
FORMULA_NAME SmartHome-PT-19-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749252334880

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 23:25:36] [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:25:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:25:36] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2025-06-06 23:25:36] [INFO ] Transformed 741 places.
[2025-06-06 23:25:36] [INFO ] Transformed 809 transitions.
[2025-06-06 23:25:36] [INFO ] Found NUPN structural information;
[2025-06-06 23:25:36] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 227 places in 12 ms
Reduce places removed 227 places and 198 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-19-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 496 transition count 611
Discarding 123 places :
Symmetric choice reduction at 1 with 123 rule applications. Total rules 141 place count 373 transition count 488
Iterating global reduction 1 with 123 rules applied. Total rules applied 264 place count 373 transition count 488
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 275 place count 373 transition count 477
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 300 place count 348 transition count 452
Iterating global reduction 2 with 25 rules applied. Total rules applied 325 place count 348 transition count 452
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 344 place count 329 transition count 433
Iterating global reduction 2 with 19 rules applied. Total rules applied 363 place count 329 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 364 place count 329 transition count 432
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 372 place count 321 transition count 424
Iterating global reduction 3 with 8 rules applied. Total rules applied 380 place count 321 transition count 424
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 381 place count 320 transition count 423
Iterating global reduction 3 with 1 rules applied. Total rules applied 382 place count 320 transition count 423
Applied a total of 382 rules in 139 ms. Remains 320 /514 variables (removed 194) and now considering 423/611 (removed 188) transitions.
// Phase 1: matrix 423 rows 320 cols
[2025-06-06 23:25:36] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:25:36] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-06-06 23:25:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:25:36] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-06-06 23:25:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 2/320 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 423/743 variables, 320/324 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/743 variables, and 324 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 2/320 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 423/743 variables, 320/324 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 422/746 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:26:21] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:26:36] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)
(t2 1)
(t3 0)
(t4 0)
(t5 0)
(t6 0)
(t7 0)
(t8 0)
(t9 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/743 variables, and 748 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 320/514 places, 423/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60795 ms. Remains : 320/514 places, 423/611 transitions.
Support contains 71 out of 320 places after structural reductions.
[2025-06-06 23:26:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-06 23:26:37] [INFO ] Flatten gal took : 41 ms
[2025-06-06 23:26:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SmartHome-PT-19-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 23:26:37] [INFO ] Flatten gal took : 28 ms
[2025-06-06 23:26:37] [INFO ] Input system was already deterministic with 423 transitions.
Support contains 49 out of 320 places (down from 71) after GAL structural reductions.
RANDOM walk for 40000 steps (112 resets) in 832 ms. (48 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/2 properties
BEST_FIRST walk for 24039 steps (4 resets) in 30 ms. (775 steps per ms) remains 0/1 properties
[2025-06-06 23:26:37] [INFO ] Flatten gal took : 19 ms
[2025-06-06 23:26:37] [INFO ] Flatten gal took : 16 ms
[2025-06-06 23:26:37] [INFO ] Input system was already deterministic with 423 transitions.
Computed a total of 56 stabilizing places and 55 stable transitions
Graph (complete) has 493 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 423
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 290 transition count 394
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 290 transition count 394
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 290 transition count 391
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 281 transition count 382
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 281 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 281 transition count 381
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 87 place count 275 transition count 375
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 275 transition count 375
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 272 transition count 372
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 272 transition count 372
Applied a total of 99 rules in 45 ms. Remains 272 /320 variables (removed 48) and now considering 372/423 (removed 51) transitions.
// Phase 1: matrix 372 rows 272 cols
[2025-06-06 23:26:38] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:38] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-06 23:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:38] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-06 23:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/644 variables, 272/275 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 0/644 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 275 constraints, problems are : Problem set: 0 solved, 371 unsolved in 25570 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/644 variables, 272/275 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 371/646 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:27:13] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/644 variables, and 647 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55627ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 55629ms
Starting structural reductions in LTL mode, iteration 1 : 272/320 places, 372/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55923 ms. Remains : 272/320 places, 372/423 transitions.
[2025-06-06 23:27:33] [INFO ] Flatten gal took : 15 ms
[2025-06-06 23:27:33] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:27:33] [INFO ] Input system was already deterministic with 372 transitions.
[2025-06-06 23:27:33] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:27:33] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:27:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality12813338598247392622.gal : 7 ms
[2025-06-06 23:27:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4416200752750117105.ctl : 10 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/CTLCardinality12813338598247392622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4416200752750117105.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,2.67615e+21,1.48343,59516,2,8239,5,268681,6,0,1446,259327,0


Converting to forward existential form...Done !
original formula: EX(EF(EG((p72==1))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),(p72==1))] != FALSE
Hit Full ! (commute/partial/dont) 370/0/2
(forward)formula 0,1,6.81806,218340,1,0,13,1.25323e+06,20,3,7019,567155,15
FORMULA SmartHome-PT-19-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 334 edges and 320 vertex of which 176 / 320 are part of one of the 15 SCC in 6 ms
Free SCC test removed 161 places
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 281 edges and 159 vertex of which 158 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 157 transition count 163
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 61 rules applied. Total rules applied 114 place count 106 transition count 153
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 121 place count 101 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 99 transition count 151
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 123 place count 99 transition count 143
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 139 place count 91 transition count 143
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 147 place count 83 transition count 132
Iterating global reduction 4 with 8 rules applied. Total rules applied 155 place count 83 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 83 transition count 130
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 231 place count 46 transition count 91
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 239 place count 46 transition count 83
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 241 place count 45 transition count 82
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 244 place count 42 transition count 74
Iterating global reduction 7 with 3 rules applied. Total rules applied 247 place count 42 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 255 place count 38 transition count 70
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 256 place count 37 transition count 66
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 37 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 273 place count 37 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 274 place count 36 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 274 place count 36 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 276 place count 35 transition count 49
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 278 place count 33 transition count 45
Iterating global reduction 8 with 2 rules applied. Total rules applied 280 place count 33 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 281 place count 33 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 282 place count 33 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 283 place count 32 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 284 place count 31 transition count 43
Applied a total of 284 rules in 48 ms. Remains 31 /320 variables (removed 289) and now considering 43/423 (removed 380) transitions.
[2025-06-06 23:27:40] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
// Phase 1: matrix 36 rows 31 cols
[2025-06-06 23:27:40] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-06 23:27:40] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
[2025-06-06 23:27:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:41] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:27:41] [INFO ] Redundant transitions in 17 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-06 23:27:41] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
[2025-06-06 23:27:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 33/59 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 5/64 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/64 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/67 variables, and 31 constraints, problems are : Problem set: 0 solved, 26 unsolved in 405 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/31 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 33/59 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 5/64 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 1/66 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/66 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/67 variables, and 58 constraints, problems are : Problem set: 0 solved, 26 unsolved in 521 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 931ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 932ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/320 places, 43/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1083 ms. Remains : 31/320 places, 43/423 transitions.
[2025-06-06 23:27:42] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:27:42] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:42] [INFO ] Input system was already deterministic with 43 transitions.
[2025-06-06 23:27:42] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:42] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:27:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality512887729722850456.gal : 1 ms
[2025-06-06 23:27:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4334518922643930832.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/CTLCardinality512887729722850456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4334518922643930832.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,3.4776e+06,0.007224,3924,2,113,5,692,6,0,150,586,0


Converting to forward existential form...Done !
original formula: (EF(((p534==0) * AF((p57!=1)))) * EG(E(((p52==0)||(p467==1)) U AF((((p188==0)||(p441==1))&&(p321==1))))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((p534==0) * !(EG(!((p57!=1))))))),E(((p52==0)||(p467==1)) U !(EG(!((((p188==0)||(p441==1...184
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t8, t14, t16, t18, t21, t28, t37, t38, Intersection with reachable at each step enab...207
(forward)formula 0,1,0.176982,13780,1,0,312,61177,121,202,909,81637,344
FORMULA SmartHome-PT-19-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 346 edges and 320 vertex of which 201 / 320 are part of one of the 16 SCC in 3 ms
Free SCC test removed 185 places
Ensure Unique test removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Graph (complete) has 246 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 133 transition count 135
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 56 rules applied. Total rules applied 102 place count 89 transition count 123
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 109 place count 83 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 82 transition count 122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 110 place count 82 transition count 119
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 116 place count 79 transition count 119
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 125 place count 70 transition count 107
Iterating global reduction 4 with 9 rules applied. Total rules applied 134 place count 70 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 135 place count 70 transition count 106
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 207 place count 34 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 34 transition count 69
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 212 place count 30 transition count 57
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 30 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 29 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 235 place count 29 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 236 place count 28 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 236 place count 28 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 238 place count 27 transition count 38
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 240 place count 25 transition count 34
Iterating global reduction 7 with 2 rules applied. Total rules applied 242 place count 25 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 243 place count 24 transition count 33
Applied a total of 243 rules in 28 ms. Remains 24 /320 variables (removed 296) and now considering 33/423 (removed 390) transitions.
[2025-06-06 23:27:42] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
// Phase 1: matrix 25 rows 24 cols
[2025-06-06 23:27:42] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-06 23:27:42] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
[2025-06-06 23:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:27:42] [INFO ] Redundant transitions in 36 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:27:42] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
[2025-06-06 23:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 20/39 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/42 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/49 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/24 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 20/39 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/42 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2/44 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 2/46 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/49 variables, and 37 constraints, problems are : Problem set: 0 solved, 12 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 414ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 415ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/320 places, 33/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 552 ms. Remains : 24/320 places, 33/423 transitions.
[2025-06-06 23:27:42] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:42] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:42] [INFO ] Input system was already deterministic with 33 transitions.
[2025-06-06 23:27:42] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 168 steps (7 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-19-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 23:27:42] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10812290678258930132.gal : 1 ms
[2025-06-06 23:27:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14385906287194610998.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10812290678258930132.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14385906287194610998.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14385906287194610998.prop.
ITS runner timed out or was interrupted.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12,0.013527,4056,2,26,5,92,6,0,105,42,0
Total reachable state count : 12

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 423
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 296 transition count 400
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 296 transition count 400
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 296 transition count 398
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 289 transition count 391
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 289 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 289 transition count 390
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 69 place count 284 transition count 385
Iterating global reduction 3 with 5 rules applied. Total rules applied 74 place count 284 transition count 385
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 282 transition count 383
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 282 transition count 383
Applied a total of 78 rules in 25 ms. Remains 282 /320 variables (removed 38) and now considering 383/423 (removed 40) transitions.
// Phase 1: matrix 383 rows 282 cols
[2025-06-06 23:27:42] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 23:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:43] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-06-06 23:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/282 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 383/665 variables, 282/285 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 0/665 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 382 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 285 constraints, problems are : Problem set: 0 solved, 382 unsolved in 27162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/282 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 383/665 variables, 282/285 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 382/667 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:28:21] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:28:21] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 669 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57205ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 57206ms
Starting structural reductions in LTL mode, iteration 1 : 282/320 places, 383/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57427 ms. Remains : 282/320 places, 383/423 transitions.
[2025-06-06 23:28:40] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:28:40] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:28:40] [INFO ] Input system was already deterministic with 383 transitions.
[2025-06-06 23:28:40] [INFO ] Flatten gal took : 22 ms
[2025-06-06 23:28:40] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:28:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality4996052845306873626.gal : 2 ms
[2025-06-06 23:28:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality14421493574499803896.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/CTLCardinality4996052845306873626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14421493574499803896.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,7.54477e+21,1.8834,73604,2,9669,5,342834,6,0,1497,341292,0


Converting to forward existential form...Done !
original formula: (E(EX(TRUE) U (!(E(AF((p183==1)) U (p333!=1))) + ((!((p99==0)||(p248==1)))&&(p347==0)))) * ((AX(EX(TRUE)) + AX((EF((((p579==0)||(p192==0)...287
=> equivalent forward existential formula: ([(Init * !(E(EX(TRUE) U (!(E(!(EG(!((p183==1)))) U (p333!=1))) + ((!((p99==0)||(p248==1)))&&(p347==0))))))] = F...526
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t28, t31, t60, t92, t95, t112, t115, t132, t136, t138, t151, t154, t171, t176, t...344
Detected timeout of ITS tools.
[2025-06-06 23:29:10] [INFO ] Flatten gal took : 15 ms
[2025-06-06 23:29:10] [INFO ] Applying decomposition
[2025-06-06 23:29:10] [INFO ] Flatten gal took : 17 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/graph12243734153048654356.txt' '-o' '/tmp/graph12243734153048654356.bin' '-w' '/tmp/graph12243734153048654356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12243734153048654356.bin' '-l' '-1' '-v' '-w' '/tmp/graph12243734153048654356.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:29:10] [INFO ] Decomposing Gal with order
[2025-06-06 23:29:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:29:10] [INFO ] Removed a total of 95 redundant transitions.
[2025-06-06 23:29:10] [INFO ] Flatten gal took : 48 ms
[2025-06-06 23:29:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-06 23:29:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality3909258162469796802.gal : 6 ms
[2025-06-06 23:29:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality5561772626351314846.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/CTLCardinality3909258162469796802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5561772626351314846.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.54477e+21,0.150455,10504,493,47,12695,801,614,21936,66,2749,0


Converting to forward existential form...Done !
original formula: (E(EX(TRUE) U (!(E(AF((i5.u31.p183==1)) U (i8.i1.u58.p333!=1))) + ((!((i2.i1.u9.p99==0)||(i1.u43.p248==1)))&&(i8.i1.u55.p347==0)))) * ((A...419
=> equivalent forward existential formula: ([(Init * !(E(EX(TRUE) U (!(E(!(EG(!((i5.u31.p183==1)))) U (i8.i1.u58.p333!=1))) + ((!((i2.i1.u9.p99==0)||(i1.u4...707
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t31, t95, t115, t154, i0.u49.t209, i1.u39.t244, i2.i1.u9.t342, i3.i1.u23.t311, i4.u2...578
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,4.60445,147592,1,0,249451,801,4570,534839,343,3146,236664
FORMULA SmartHome-PT-19-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 343 edges and 320 vertex of which 196 / 320 are part of one of the 16 SCC in 2 ms
Free SCC test removed 180 places
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Graph (complete) has 253 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 138 transition count 145
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 51 rules applied. Total rules applied 94 place count 97 transition count 135
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 101 place count 92 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 90 transition count 133
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 103 place count 90 transition count 128
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 113 place count 85 transition count 128
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 122 place count 76 transition count 116
Iterating global reduction 4 with 9 rules applied. Total rules applied 131 place count 76 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 133 place count 76 transition count 114
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 209 place count 38 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 211 place count 38 transition count 73
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 215 place count 34 transition count 61
Iterating global reduction 6 with 4 rules applied. Total rules applied 219 place count 34 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 33 transition count 60
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 222 place count 32 transition count 56
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 32 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 236 place count 32 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 31 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 237 place count 31 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 239 place count 30 transition count 42
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 241 place count 28 transition count 38
Iterating global reduction 7 with 2 rules applied. Total rules applied 243 place count 28 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 27 transition count 37
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 12 edges and 26 vertex of which 2 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 246 place count 25 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 248 place count 25 transition count 35
Applied a total of 248 rules in 27 ms. Remains 25 /320 variables (removed 295) and now considering 35/423 (removed 388) transitions.
[2025-06-06 23:29:15] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
// Phase 1: matrix 28 rows 25 cols
[2025-06-06 23:29:15] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 23:29:15] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
[2025-06-06 23:29:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:29:15] [INFO ] Redundant transitions in 17 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-06 23:29:15] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
[2025-06-06 23:29:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 24/45 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/48 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/53 variables, and 24 constraints, problems are : Problem set: 0 solved, 15 unsolved in 171 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 24/45 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3/48 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 1/50 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/50 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/50 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/53 variables, and 40 constraints, problems are : Problem set: 0 solved, 15 unsolved in 245 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 419ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/320 places, 35/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 521 ms. Remains : 25/320 places, 35/423 transitions.
[2025-06-06 23:29:15] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:29:15] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:29:15] [INFO ] Input system was already deterministic with 35 transitions.
[2025-06-06 23:29:15] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:29:15] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:29:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality171253398977862588.gal : 0 ms
[2025-06-06 23:29:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality1658366093590760500.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/CTLCardinality171253398977862588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1658366093590760500.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,441600,0.004983,3956,2,71,5,406,6,0,115,371,0


Converting to forward existential form...Done !
original formula: (EG((p485==0)) * AG(AF(EG(((p423==0)||(p502==1))))))
=> equivalent forward existential formula: ([(Init * !(EG((p485==0))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(EG(((p423==0)||(p502==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t21, t28, t29, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,0,0.072367,7796,1,0,180,24009,88,108,654,34914,221
FORMULA SmartHome-PT-19-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 330 edges and 320 vertex of which 185 / 320 are part of one of the 16 SCC in 2 ms
Free SCC test removed 169 places
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Graph (complete) has 269 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 149 transition count 160
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 56 rules applied. Total rules applied 100 place count 107 transition count 146
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 110 place count 100 transition count 143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 113 place count 97 transition count 143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 113 place count 97 transition count 138
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 123 place count 92 transition count 138
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 131 place count 84 transition count 130
Iterating global reduction 4 with 8 rules applied. Total rules applied 139 place count 84 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 84 transition count 128
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 211 place count 49 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 49 transition count 92
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 215 place count 46 transition count 84
Iterating global reduction 6 with 3 rules applied. Total rules applied 218 place count 46 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 220 place count 45 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 238 place count 45 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 44 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 239 place count 44 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 43 transition count 64
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 243 place count 41 transition count 60
Iterating global reduction 7 with 2 rules applied. Total rules applied 245 place count 41 transition count 60
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 41 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 247 place count 40 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 248 place count 39 transition count 59
Applied a total of 248 rules in 36 ms. Remains 39 /320 variables (removed 281) and now considering 59/423 (removed 364) transitions.
[2025-06-06 23:29:15] [INFO ] Flow matrix only has 48 transitions (discarded 11 similar events)
// Phase 1: matrix 48 rows 39 cols
[2025-06-06 23:29:15] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 23:29:15] [INFO ] Flow matrix only has 48 transitions (discarded 11 similar events)
[2025-06-06 23:29:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-06 23:29:15] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:29:16] [INFO ] Redundant transitions in 31 ms returned []
Running 29 sub problems to find dead transitions.
[2025-06-06 23:29:16] [INFO ] Flow matrix only has 48 transitions (discarded 11 similar events)
[2025-06-06 23:29:16] [INFO ] Invariant cache hit.
[2025-06-06 23:29:16] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 40/70 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 12/82 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/87 variables, and 43 constraints, problems are : Problem set: 0 solved, 29 unsolved in 359 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/39 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 40/70 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 12/82 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/83 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/84 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (OVERLAPS) 0/84 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/87 variables, and 73 constraints, problems are : Problem set: 0 solved, 29 unsolved in 627 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/39 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 989ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 989ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/320 places, 59/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1129 ms. Remains : 39/320 places, 59/423 transitions.
[2025-06-06 23:29:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:29:17] [INFO ] Flatten gal took : 3 ms
[2025-06-06 23:29:17] [INFO ] Input system was already deterministic with 59 transitions.
[2025-06-06 23:29:17] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:29:17] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:29:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality2279515056550501626.gal : 0 ms
[2025-06-06 23:29:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality17277395044877908365.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/CTLCardinality2279515056550501626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17277395044877908365.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,4.70707e+07,0.007693,4028,2,130,5,802,6,0,186,649,0


Converting to forward existential form...Done !
original formula: E(E(((!(((p235==0)||(p559==1))) * E((p571==0) U (p153==0))) * !(EF(((p302==0)&&(p272==0))))) U (AF((p557==1)) + EG((p724==0)))) U ((p187=...187
=> equivalent forward existential formula: [(FwdU(Init,E(((!(((p235==0)||(p559==1))) * E((p571==0) U (p153==0))) * !(E(TRUE U ((p302==0)&&(p272==0))))) U (...245
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t21, t25, t29, t32, t35, t42, t52, t53, Intersection with reachable at each step ena...208
(forward)formula 0,1,0.348882,20500,1,0,494,100588,152,300,1112,137675,588
FORMULA SmartHome-PT-19-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 341 edges and 320 vertex of which 195 / 320 are part of one of the 16 SCC in 1 ms
Free SCC test removed 179 places
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 140 transition count 141
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 106 place count 95 transition count 126
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 87 transition count 126
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 114 place count 87 transition count 122
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 83 transition count 122
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 76 transition count 113
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 76 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 76 transition count 111
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 210 place count 40 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 40 transition count 74
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 215 place count 36 transition count 62
Iterating global reduction 5 with 4 rules applied. Total rules applied 219 place count 36 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 35 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 237 place count 35 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 34 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 238 place count 34 transition count 44
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 240 place count 33 transition count 44
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 242 place count 31 transition count 40
Iterating global reduction 6 with 2 rules applied. Total rules applied 244 place count 31 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 30 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 246 place count 29 transition count 39
Applied a total of 246 rules in 17 ms. Remains 29 /320 variables (removed 291) and now considering 39/423 (removed 384) transitions.
[2025-06-06 23:29:17] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
// Phase 1: matrix 30 rows 29 cols
[2025-06-06 23:29:17] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:17] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-06 23:29:17] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
[2025-06-06 23:29:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:17] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:29:17] [INFO ] Redundant transitions in 23 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-06 23:29:17] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
[2025-06-06 23:29:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 25/47 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 4/51 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/59 variables, and 26 constraints, problems are : Problem set: 0 solved, 18 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/29 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 25/47 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 4/51 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/52 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/53 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/53 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/59 variables, and 45 constraints, problems are : Problem set: 0 solved, 18 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/29 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 669ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 669ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/320 places, 39/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 782 ms. Remains : 29/320 places, 39/423 transitions.
[2025-06-06 23:29:18] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:29:18] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:29:18] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-06 23:29:18] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 1114 steps (41 resets) in 5 ms. (185 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-19-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 23:29:18] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:29:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8906990642975378239.gal : 0 ms
[2025-06-06 23:29:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8745380666559542396.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8906990642975378239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8745380666559542396.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8745380666559542396.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.005329,4152,2,30,5,99,6,0,126,42,0
Total reachable state count : 5

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 423
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 289 transition count 393
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 289 transition count 393
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 289 transition count 390
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 280 transition count 381
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 280 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 280 transition count 380
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 274 transition count 374
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 271 transition count 371
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 271 transition count 371
Applied a total of 101 rules in 12 ms. Remains 271 /320 variables (removed 49) and now considering 371/423 (removed 52) transitions.
// Phase 1: matrix 371 rows 271 cols
[2025-06-06 23:29:18] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 23:29:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:18] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-06 23:29:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25443 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:29:54] [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/642 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 645 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55484ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55485ms
Starting structural reductions in LTL mode, iteration 1 : 271/320 places, 371/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55670 ms. Remains : 271/320 places, 371/423 transitions.
[2025-06-06 23:30:13] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:30:13] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:30:13] [INFO ] Input system was already deterministic with 371 transitions.
[2025-06-06 23:30:13] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:30:13] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:30:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality778347743488829145.gal : 1 ms
[2025-06-06 23:30:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10121969823051922043.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/CTLCardinality778347743488829145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10121969823051922043.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57362e+21,1.4991,58016,2,8184,5,262962,6,0,1441,252928,0


Converting to forward existential form...Done !
original formula: AG(EX((p310==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p310==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...316
(forward)formula 0,0,11.7341,336752,1,0,421,1.56875e+06,758,312,7680,1.59279e+06,749
FORMULA SmartHome-PT-19-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 423
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 289 transition count 393
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 289 transition count 393
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 289 transition count 390
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 280 transition count 381
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 280 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 280 transition count 380
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 274 transition count 374
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 271 transition count 371
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 271 transition count 371
Applied a total of 101 rules in 19 ms. Remains 271 /320 variables (removed 49) and now considering 371/423 (removed 52) transitions.
[2025-06-06 23:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:30:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 23:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:30:25] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-06 23:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25583 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:31:01] [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/642 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 645 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55621ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55622ms
Starting structural reductions in LTL mode, iteration 1 : 271/320 places, 371/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55821 ms. Remains : 271/320 places, 371/423 transitions.
[2025-06-06 23:31:21] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:31:21] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:31:21] [INFO ] Input system was already deterministic with 371 transitions.
[2025-06-06 23:31:21] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:31:21] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:31:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality8773437823478166656.gal : 2 ms
[2025-06-06 23:31:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality16915619288504697291.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/CTLCardinality8773437823478166656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16915619288504697291.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,2.57362e+21,1.48406,59304,2,8184,5,262962,6,0,1441,252928,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((AX(FALSE) * (p86==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((!(EX(!(FALSE))) * (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, t166, t181, t201, t216,...316
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-06 23:31:51] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:31:51] [INFO ] Applying decomposition
[2025-06-06 23:31:51] [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/graph17057912155299054438.txt' '-o' '/tmp/graph17057912155299054438.bin' '-w' '/tmp/graph17057912155299054438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17057912155299054438.bin' '-l' '-1' '-v' '-w' '/tmp/graph17057912155299054438.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:31:51] [INFO ] Decomposing Gal with order
[2025-06-06 23:31:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:31:51] [INFO ] Removed a total of 94 redundant transitions.
[2025-06-06 23:31:51] [INFO ] Flatten gal took : 15 ms
[2025-06-06 23:31:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-06 23:31:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality18358747764708971065.gal : 3 ms
[2025-06-06 23:31:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality131197943533883514.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/CTLCardinality18358747764708971065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality131197943533883514.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 -...262
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.57362e+21,0.111083,8704,435,42,8508,829,559,13715,64,2498,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((AX(FALSE) * (i2.i1.u15.p86==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((!(EX(!(FALSE))) * (i2.i1.u15.p86==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i0.u1.t335, i0.u102.t8, i2.i0.u9.t332, i3.i1.u18.t301, i4.u2...485
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 a local SCC at level 5
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
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 a local SCC at level 5
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 423
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 289 transition count 393
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 289 transition count 393
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 289 transition count 390
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 280 transition count 381
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 280 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 280 transition count 380
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 274 transition count 374
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 271 transition count 371
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 271 transition count 371
Applied a total of 101 rules in 20 ms. Remains 271 /320 variables (removed 49) and now considering 371/423 (removed 52) transitions.
[2025-06-06 23:32:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:32:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 23:32:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:32:22] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-06 23:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25830 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:32:58] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 645 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55872ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55872ms
Starting structural reductions in LTL mode, iteration 1 : 271/320 places, 371/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56078 ms. Remains : 271/320 places, 371/423 transitions.
[2025-06-06 23:33:17] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:33:17] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:33:17] [INFO ] Input system was already deterministic with 371 transitions.
[2025-06-06 23:33:17] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:33:17] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:33:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality3713052446487638620.gal : 1 ms
[2025-06-06 23:33:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality7743375862693038233.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/CTLCardinality3713052446487638620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7743375862693038233.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57362e+21,1.49852,58624,2,8184,5,262962,6,0,1441,252928,0


Converting to forward existential form...Done !
original formula: EG(AG(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(EX(TRUE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...316
Detected timeout of ITS tools.
[2025-06-06 23:33:48] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:33:48] [INFO ] Applying decomposition
[2025-06-06 23:33:48] [INFO ] Flatten gal took : 5 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/graph16408837369284984152.txt' '-o' '/tmp/graph16408837369284984152.bin' '-w' '/tmp/graph16408837369284984152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16408837369284984152.bin' '-l' '-1' '-v' '-w' '/tmp/graph16408837369284984152.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:33:48] [INFO ] Decomposing Gal with order
[2025-06-06 23:33:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:33:48] [INFO ] Removed a total of 93 redundant transitions.
[2025-06-06 23:33:48] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:33:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-06 23:33:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality7968768600055423543.gal : 2 ms
[2025-06-06 23:33:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality15671368504282388965.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/CTLCardinality7968768600055423543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15671368504282388965.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,2.57362e+21,0.131922,10100,408,43,11985,960,563,21703,65,2861,0


Converting to forward existential form...Done !
original formula: EG(AG(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(EX(TRUE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t94, t114, t134, t149, i1.i2.u20.t332, i2.u22.t301, i3.u25.t286, i4.u34.t271, i5.u38.t25...502
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,0.30685,16116,1,0,22017,960,3998,46271,330,2861,67180
FORMULA SmartHome-PT-19-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 423
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 291 transition count 395
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 291 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 291 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 283 transition count 384
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 283 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 283 transition count 383
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 278 transition count 378
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 278 transition count 378
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 275 transition count 375
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 275 transition count 375
Applied a total of 93 rules in 12 ms. Remains 275 /320 variables (removed 45) and now considering 375/423 (removed 48) transitions.
// Phase 1: matrix 375 rows 275 cols
[2025-06-06 23:33: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:33:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-06 23:33:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:33:48] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2025-06-06 23:33: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/274 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/650 variables, 275/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 278 constraints, problems are : Problem set: 0 solved, 374 unsolved in 25908 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/650 variables, 275/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 374/652 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:34:24] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 653 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55946ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 55947ms
Starting structural reductions in LTL mode, iteration 1 : 275/320 places, 375/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56150 ms. Remains : 275/320 places, 375/423 transitions.
[2025-06-06 23:34:44] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:34:44] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:34:44] [INFO ] Input system was already deterministic with 375 transitions.
[2025-06-06 23:34:44] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:34:44] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:34:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12742686344125035844.gal : 2 ms
[2025-06-06 23:34:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality12766060783241239547.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/CTLCardinality12742686344125035844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12766060783241239547.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,3.29347e+21,1.7303,66344,2,9226,5,295326,6,0,1461,284508,0


Converting to forward existential form...Done !
original formula: AX(E(AX(FALSE) U E(((p357==0)||(p281==1)) U ((p500==0)||(p440==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EX(!(FALSE))) U E(((p357==0)||(p281==1)) U ((p500==0)||(p440==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t91, t94, t111, t114, t116, t132, t135, t147, t150, t170, t185, t...326
(forward)formula 0,1,14.5475,404336,1,0,439,1.96665e+06,773,324,8030,2.06646e+06,774
FORMULA SmartHome-PT-19-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 23:34:59] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:34:59] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:34:59] [INFO ] Applying decomposition
[2025-06-06 23:34:59] [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/graph2447491710267494051.txt' '-o' '/tmp/graph2447491710267494051.bin' '-w' '/tmp/graph2447491710267494051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2447491710267494051.bin' '-l' '-1' '-v' '-w' '/tmp/graph2447491710267494051.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:34:59] [INFO ] Decomposing Gal with order
[2025-06-06 23:34:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:34:59] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-06 23:34:59] [INFO ] Flatten gal took : 27 ms
[2025-06-06 23:34:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2025-06-06 23:34:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8465592707438387804.gal : 4 ms
[2025-06-06 23:34:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality16242355786841870488.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/CTLCardinality8465592707438387804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16242355786841870488.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,7.34019e+22,0.18754,11260,658,46,13834,932,720,25231,72,3145,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((AX(FALSE) * (i1.i3.u15.p86==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((!(EX(!(FALSE))) * (i1.i3.u15.p86==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t102, t123, t164, i1.i0.u19.t349, i1.i2.u18.t380, i2.u25.t329, i3.u33.t297, i3.u33.t314,...637
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,765.568,2457652,1,0,2.82427e+06,932,1407,4.41167e+06,129,3145,1606741
FORMULA SmartHome-PT-19-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1330035 ms.

BK_STOP 1749253666115

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-19"
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-19, 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-174901995100833"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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