Execution Chart

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

Trace from the execution

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

--------------------
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-LTLCardinality-00
FORMULA_NAME SmartHome-PT-19-LTLCardinality-01
FORMULA_NAME SmartHome-PT-19-LTLCardinality-02
FORMULA_NAME SmartHome-PT-19-LTLCardinality-03
FORMULA_NAME SmartHome-PT-19-LTLCardinality-04
FORMULA_NAME SmartHome-PT-19-LTLCardinality-05
FORMULA_NAME SmartHome-PT-19-LTLCardinality-06
FORMULA_NAME SmartHome-PT-19-LTLCardinality-07
FORMULA_NAME SmartHome-PT-19-LTLCardinality-08
FORMULA_NAME SmartHome-PT-19-LTLCardinality-09
FORMULA_NAME SmartHome-PT-19-LTLCardinality-10
FORMULA_NAME SmartHome-PT-19-LTLCardinality-11
FORMULA_NAME SmartHome-PT-19-LTLCardinality-12
FORMULA_NAME SmartHome-PT-19-LTLCardinality-13
FORMULA_NAME SmartHome-PT-19-LTLCardinality-14
FORMULA_NAME SmartHome-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749252404991

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-06-06 23:26:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 23:26:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:26:46] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-06 23:26:46] [INFO ] Transformed 741 places.
[2025-06-06 23:26:46] [INFO ] Transformed 809 transitions.
[2025-06-06 23:26:46] [INFO ] Found NUPN structural information;
[2025-06-06 23:26:46] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 227 places in 10 ms
Reduce places removed 227 places and 198 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SmartHome-PT-19-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 495 transition count 611
Discarding 136 places :
Symmetric choice reduction at 1 with 136 rule applications. Total rules 155 place count 359 transition count 475
Iterating global reduction 1 with 136 rules applied. Total rules applied 291 place count 359 transition count 475
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 302 place count 359 transition count 464
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 331 place count 330 transition count 435
Iterating global reduction 2 with 29 rules applied. Total rules applied 360 place count 330 transition count 435
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 388 place count 302 transition count 407
Iterating global reduction 2 with 28 rules applied. Total rules applied 416 place count 302 transition count 407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 419 place count 302 transition count 404
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 432 place count 289 transition count 391
Iterating global reduction 3 with 13 rules applied. Total rules applied 445 place count 289 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 447 place count 287 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 449 place count 287 transition count 389
Applied a total of 449 rules in 133 ms. Remains 287 /514 variables (removed 227) and now considering 389/611 (removed 222) transitions.
// Phase 1: matrix 389 rows 287 cols
[2025-06-06 23:26:46] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:46] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-06 23:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:47] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 388 sub problems to find dead transitions.
[2025-06-06 23:26:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 389/676 variables, 287/290 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (OVERLAPS) 0/676 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 388 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 290 constraints, problems are : Problem set: 0 solved, 388 unsolved in 28625 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 389/676 variables, 287/290 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 388/678 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:27:26] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:27:26] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 680 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 58756ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 58767ms
Starting structural reductions in LTL mode, iteration 1 : 287/514 places, 389/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59342 ms. Remains : 287/514 places, 389/611 transitions.
Support contains 15 out of 287 places after structural reductions.
[2025-06-06 23:27:46] [INFO ] Flatten gal took : 43 ms
[2025-06-06 23:27:46] [INFO ] Flatten gal took : 19 ms
[2025-06-06 23:27:46] [INFO ] Input system was already deterministic with 389 transitions.
RANDOM walk for 8521 steps (21 resets) in 261 ms. (32 steps per ms) remains 0/11 properties
FORMULA SmartHome-PT-19-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 44 stabilizing places and 43 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 389/389 transitions.
Graph (trivial) has 311 edges and 287 vertex of which 192 / 287 are part of one of the 16 SCC in 2 ms
Free SCC test removed 176 places
Ensure Unique test removed 238 transitions
Reduce isomorphic transitions removed 238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 110 transition count 117
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 77 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 67 place count 77 transition count 114
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 74 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 78 place count 69 transition count 106
Iterating global reduction 2 with 5 rules applied. Total rules applied 83 place count 69 transition count 106
Performed 36 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 155 place count 33 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 29 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 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 2 with 17 rules applied. Total rules applied 180 place count 29 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 181 place count 28 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 181 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 3 with 2 rules applied. Total rules applied 183 place count 27 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 25 transition count 34
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 25 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 24 transition count 33
Applied a total of 188 rules in 24 ms. Remains 24 /287 variables (removed 263) and now considering 33/389 (removed 356) transitions.
[2025-06-06 23:27:46] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
// Phase 1: matrix 25 rows 24 cols
[2025-06-06 23:27:46] [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:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 23:27:46] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
[2025-06-06 23:27:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:27:46] [INFO ] Redundant transitions in 27 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:27:46] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
[2025-06-06 23:27:46] [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 165 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 206 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 376ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/287 places, 33/389 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 500 ms. Remains : 24/287 places, 33/389 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA SmartHome-PT-19-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-00 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 389/389 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 278 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 278 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 278 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 276 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 276 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 274 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 274 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 273 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 273 transition count 373
Applied a total of 30 rules in 31 ms. Remains 273 /287 variables (removed 14) and now considering 373/389 (removed 16) transitions.
// Phase 1: matrix 373 rows 273 cols
[2025-06-06 23:27:47] [INFO ] Computed 3 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:47] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 23:27:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:47] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2025-06-06 23:27:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 276 constraints, problems are : Problem set: 0 solved, 372 unsolved in 25917 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 372/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:28:22] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 649 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55977ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 55979ms
Starting structural reductions in LTL mode, iteration 1 : 273/287 places, 373/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56194 ms. Remains : 273/287 places, 373/389 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 38 stabilizing places and 37 stable transitions
Computed a total of 38 stabilizing places and 37 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLCardinality-02 finished in 56703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 389/389 transitions.
Graph (trivial) has 308 edges and 287 vertex of which 168 / 287 are part of one of the 16 SCC in 1 ms
Free SCC test removed 152 places
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 134 transition count 139
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 91 transition count 136
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 89 transition count 133
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 99 place count 87 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 85 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 101 place count 85 transition count 127
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 109 place count 81 transition count 127
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 114 place count 76 transition count 121
Iterating global reduction 5 with 5 rules applied. Total rules applied 119 place count 76 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 120 place count 76 transition count 120
Performed 41 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 202 place count 35 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 204 place count 35 transition count 72
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 210 place count 29 transition count 52
Iterating global reduction 7 with 6 rules applied. Total rules applied 216 place count 29 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 230 place count 29 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 232 place count 27 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 232 place count 27 transition count 37
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 234 place count 26 transition count 37
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 236 place count 24 transition count 33
Iterating global reduction 8 with 2 rules applied. Total rules applied 238 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 239 place count 23 transition count 32
Applied a total of 239 rules in 18 ms. Remains 23 /287 variables (removed 264) and now considering 32/389 (removed 357) transitions.
[2025-06-06 23:28:43] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2025-06-06 23:28:43] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:28:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-06 23:28:43] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2025-06-06 23:28:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:28:43] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:28:43] [INFO ] Redundant transitions in 22 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-06 23:28:43] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2025-06-06 23:28: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/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 3/43 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/48 variables, and 22 constraints, problems are : Problem set: 0 solved, 13 unsolved in 139 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/43 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/45 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/48 variables, and 36 constraints, problems are : Problem set: 0 solved, 13 unsolved in 217 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 358ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/287 places, 32/389 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 23/287 places, 32/389 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-08 finished in 602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(F((G(p2)||p1))))))))'
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 389/389 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 281 transition count 383
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 281 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 281 transition count 382
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 279 transition count 380
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 279 transition count 380
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 278 transition count 379
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 278 transition count 379
Applied a total of 19 rules in 17 ms. Remains 278 /287 variables (removed 9) and now considering 379/389 (removed 10) transitions.
// Phase 1: matrix 379 rows 278 cols
[2025-06-06 23:28:44] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:28:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 23:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:28:44] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2025-06-06 23:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/657 variables, 278/281 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (OVERLAPS) 0/657 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 281 constraints, problems are : Problem set: 0 solved, 378 unsolved in 26669 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/657 variables, 278/281 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 378/659 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:29:21] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 660 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56715ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 56716ms
Starting structural reductions in LTL mode, iteration 1 : 278/287 places, 379/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56984 ms. Remains : 278/287 places, 379/389 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Computed a total of 39 stabilizing places and 38 stable transitions
Computed a total of 39 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 11032 steps (31 resets) in 128 ms. (85 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 p2), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 278 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 379/379 transitions.
Applied a total of 0 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2025-06-06 23:29:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 23:29:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:42] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2025-06-06 23:29: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/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/657 variables, 278/281 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (OVERLAPS) 0/657 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 281 constraints, problems are : Problem set: 0 solved, 378 unsolved in 26576 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/657 variables, 278/281 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 378/659 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:30:19] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 660 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56628ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 56629ms
Finished structural reductions in LTL mode , in 1 iterations and 56827 ms. Remains : 278/278 places, 379/379 transitions.
Computed a total of 39 stabilizing places and 38 stable transitions
Computed a total of 39 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 25871 steps (72 resets) in 121 ms. (212 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p2)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 110 ms.
Product exploration explored 100000 steps with 25000 reset in 102 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 379/379 transitions.
Graph (trivial) has 298 edges and 278 vertex of which 173 / 278 are part of one of the 15 SCC in 1 ms
Free SCC test removed 158 places
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 120 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 120 transition count 163
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 40 place count 120 transition count 163
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 120 transition count 163
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 69 place count 95 transition count 135
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 94 place count 95 transition count 135
Performed 39 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 133 place count 95 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 137 place count 95 transition count 130
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 160 place count 72 transition count 96
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 183 place count 72 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 69 transition count 93
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 69 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 191 place count 69 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 195 place count 65 transition count 89
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 65 transition count 89
Deduced a syphon composed of 34 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 214 place count 65 transition count 74
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 188 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 216 place count 63 transition count 73
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 219 place count 60 transition count 68
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 222 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 59 transition count 67
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 59 transition count 67
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 224 rules in 37 ms. Remains 59 /278 variables (removed 219) and now considering 67/379 (removed 312) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:30:40] [INFO ] Redundant transitions in 29 ms returned []
Running 66 sub problems to find dead transitions.
[2025-06-06 23:30:40] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
// Phase 1: matrix 61 rows 59 cols
[2025-06-06 23:30:40] [INFO ] Computed 2 invariants in 1 ms
[2025-06-06 23:30:40] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:30:41] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 64 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 5 (OVERLAPS) 60/119 variables, 59/62 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 12/74 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/74 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/120 variables, 1/75 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/75 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/75 constraints. Problems are: Problem set: 31 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 75 constraints, problems are : Problem set: 31 solved, 35 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 3/30 variables, 1/1 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/2 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1/31 variables, 1/3 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 60/91 variables, 31/34 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 12/46 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 35/81 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/81 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 28/119 variables, 28/109 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/109 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 1/120 variables, 1/110 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/110 constraints. Problems are: Problem set: 31 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/110 constraints. Problems are: Problem set: 31 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 110 constraints, problems are : Problem set: 31 solved, 35 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 35/66 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2565ms problems are : Problem set: 31 solved, 35 unsolved
Search for dead transitions found 31 dead transitions in 2565ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 59/278 places, 36/379 transitions.
Graph (complete) has 67 edges and 59 vertex of which 28 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 28 /59 variables (removed 31) and now considering 36/36 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/278 places, 36/379 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2639 ms. Remains : 28/278 places, 36/379 transitions.
Built C files in :
/tmp/ltsmin5122874913563786157
[2025-06-06 23:30:43] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5122874913563786157
Running compilation step : cd /tmp/ltsmin5122874913563786157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 602 ms.
Running link step : cd /tmp/ltsmin5122874913563786157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5122874913563786157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10574801195094893655.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA SmartHome-PT-19-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-19-LTLCardinality-10 finished in 119918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 389/389 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 278 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 278 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 278 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 276 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 276 transition count 376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 275 transition count 375
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 275 transition count 375
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 274 transition count 374
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 274 transition count 374
Applied a total of 28 rules in 41 ms. Remains 274 /287 variables (removed 13) and now considering 374/389 (removed 15) transitions.
// Phase 1: matrix 374 rows 274 cols
[2025-06-06 23:30:44] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:30:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 23:30:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:30:44] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-06 23:30:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 277 constraints, problems are : Problem set: 0 solved, 373 unsolved in 25794 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 373/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:31:20] [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/648 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 651 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55843ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 55844ms
Starting structural reductions in LTL mode, iteration 1 : 274/287 places, 374/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56089 ms. Remains : 274/287 places, 374/389 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 40 stabilizing places and 39 stable transitions
Computed a total of 40 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLCardinality-14 finished in 56458 ms.
All properties solved by simple procedures.
Total runtime 294613 ms.

BK_STOP 1749252700824

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-174901995100835"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;