Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1749252712395

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-06-06 23:31:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 23:31:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:31:53] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-06-06 23:31:53] [INFO ] Transformed 741 places.
[2025-06-06 23:31:53] [INFO ] Transformed 809 transitions.
[2025-06-06 23:31:53] [INFO ] Found NUPN structural information;
[2025-06-06 23:31:53] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 227 places in 9 ms
Reduce places removed 227 places and 198 transitions.
FORMULA SmartHome-PT-19-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 137 places :
Symmetric choice reduction at 1 with 137 rule applications. Total rules 156 place count 358 transition count 474
Iterating global reduction 1 with 137 rules applied. Total rules applied 293 place count 358 transition count 474
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 306 place count 358 transition count 461
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 333 place count 331 transition count 434
Iterating global reduction 2 with 27 rules applied. Total rules applied 360 place count 331 transition count 434
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 386 place count 305 transition count 408
Iterating global reduction 2 with 26 rules applied. Total rules applied 412 place count 305 transition count 408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 415 place count 305 transition count 405
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 425 place count 295 transition count 395
Iterating global reduction 3 with 10 rules applied. Total rules applied 435 place count 295 transition count 395
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 437 place count 293 transition count 393
Iterating global reduction 3 with 2 rules applied. Total rules applied 439 place count 293 transition count 393
Applied a total of 439 rules in 115 ms. Remains 293 /514 variables (removed 221) and now considering 393/611 (removed 218) transitions.
// Phase 1: matrix 393 rows 293 cols
[2025-06-06 23:31:54] [INFO ] Computed 3 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:31:54] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-06 23:31:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:31:54] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2025-06-06 23:31:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/293 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/686 variables, 293/296 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 0/686 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 296 constraints, problems are : Problem set: 0 solved, 392 unsolved in 29206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/293 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/686 variables, 293/296 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 392/688 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:32:35] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/686 variables, and 689 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59313ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 59324ms
Starting structural reductions in LTL mode, iteration 1 : 293/514 places, 393/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59902 ms. Remains : 293/514 places, 393/611 transitions.
Support contains 28 out of 293 places after structural reductions.
[2025-06-06 23:32:54] [INFO ] Flatten gal took : 43 ms
[2025-06-06 23:32:54] [INFO ] Flatten gal took : 19 ms
[2025-06-06 23:32:54] [INFO ] Input system was already deterministic with 393 transitions.
RANDOM walk for 8526 steps (22 resets) in 307 ms. (27 steps per ms) remains 0/25 properties
Computed a total of 52 stabilizing places and 51 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' '!(X(X((F(p0)||X(p1)))))'
Support contains 2 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 283 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 283 transition count 383
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 278 transition count 378
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 278 transition count 378
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 275 transition count 375
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 275 transition count 375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 274 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 274 transition count 374
Applied a total of 38 rules in 29 ms. Remains 274 /293 variables (removed 19) and now considering 374/393 (removed 19) transitions.
// Phase 1: matrix 374 rows 274 cols
[2025-06-06 23:32:54] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:32:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-06 23:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:32:54] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-06 23:32:54] [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 26059 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:33:31] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 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 30025 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 56122ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 56124ms
Starting structural reductions in LTL mode, iteration 1 : 274/293 places, 374/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56330 ms. Remains : 274/293 places, 374/393 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 280 ms.
Product exploration explored 100000 steps with 25000 reset in 135 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 : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2033 steps (4 resets) in 42 ms. (47 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 374/374 transitions.
Applied a total of 0 rules in 6 ms. Remains 274 /274 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2025-06-06 23:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:33:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 23:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:33:52] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-06 23:33:52] [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 26156 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:34:29] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/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 30016 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 56201ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 56209ms
Finished structural reductions in LTL mode , in 1 iterations and 56402 ms. Remains : 274/274 places, 374/374 transitions.
Computed a total of 38 stabilizing places and 37 stable transitions
Computed a total of 38 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3818 steps (9 resets) in 26 ms. (141 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 374/374 transitions.
Graph (trivial) has 297 edges and 274 vertex of which 183 / 274 are part of one of the 16 SCC in 6 ms
Free SCC test removed 167 places
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 107 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 145
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 36 place count 107 transition count 145
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 107 transition count 145
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 64 place count 82 transition count 115
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 89 place count 82 transition count 115
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 122 place count 82 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 82 transition count 114
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 138 place count 67 transition count 90
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 153 place count 67 transition count 90
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 156 place count 64 transition count 87
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 159 place count 64 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 64 transition count 87
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 162 place count 62 transition count 85
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 62 transition count 85
Deduced a syphon composed of 33 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 178 place count 62 transition count 71
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 182 edges and 61 vertex of which 60 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 180 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 58 transition count 66
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 58 transition count 66
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 184 rules in 69 ms. Remains 58 /274 variables (removed 216) and now considering 66/374 (removed 308) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:34:50] [INFO ] Redundant transitions in 26 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-06 23:34:50] [INFO ] Flow matrix only has 59 transitions (discarded 7 similar events)
// Phase 1: matrix 59 rows 58 cols
[2025-06-06 23:34:50] [INFO ] Computed 2 invariants in 1 ms
[2025-06-06 23:34:50] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:34:50] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 7 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 63 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD44 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 TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 5 (OVERLAPS) 58/116 variables, 58/61 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 14/75 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/75 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/117 variables, 1/76 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/76 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/76 constraints. Problems are: Problem set: 32 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 76 constraints, problems are : Problem set: 32 solved, 33 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 33 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 3/28 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/2 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 58/87 variables, 29/32 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 14/46 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 33/79 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/79 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 29/116 variables, 29/108 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/108 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 1/117 variables, 1/109 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 0/109 constraints. Problems are: Problem set: 32 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 0/117 variables, 0/109 constraints. Problems are: Problem set: 32 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 109 constraints, problems are : Problem set: 32 solved, 33 unsolved in 1258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 33/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2423ms problems are : Problem set: 32 solved, 33 unsolved
Search for dead transitions found 32 dead transitions in 2425ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/274 places, 34/374 transitions.
Graph (complete) has 64 edges and 58 vertex of which 26 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 26 /58 variables (removed 32) and now considering 34/34 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/274 places, 34/374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2531 ms. Remains : 26/274 places, 34/374 transitions.
Built C files in :
/tmp/ltsmin1460520846817257170
[2025-06-06 23:34:52] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1460520846817257170
Running compilation step : cd /tmp/ltsmin1460520846817257170;'/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 580 ms.
Running link step : cd /tmp/ltsmin1460520846817257170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1460520846817257170;'/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/stateBased15034599093169187699.hoa' '--buchi-type=spotba'
LTSmin run took 191 ms.
FORMULA SmartHome-PT-19-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-19-LTLFireability-03 finished in 119209 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((G(p0)||X(G(p1)))))'
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 282 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 282 transition count 382
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 276 transition count 376
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 276 transition count 376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 272 transition count 372
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 271 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 271 transition count 371
Applied a total of 44 rules in 41 ms. Remains 271 /293 variables (removed 22) and now considering 371/393 (removed 22) transitions.
// Phase 1: matrix 371 rows 271 cols
[2025-06-06 23:34:53] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:34:53] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-06 23:34:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:34:53] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-06 23:34:53] [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 24908 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:35:28] [INFO ] Deduced a trap along path composed of 2 places in 25 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 30015 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 54952ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 54953ms
Starting structural reductions in LTL mode, iteration 1 : 271/293 places, 371/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55197 ms. Remains : 271/293 places, 371/393 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-05 finished in 55418 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((p0||X(X(X(p1)))||G((p0||(!p0 U (p2||G(!p0))))))))'
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 284 transition count 384
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 284 transition count 384
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 279 transition count 379
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 279 transition count 379
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 275 transition count 375
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 275 transition count 375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 274 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 274 transition count 374
Applied a total of 38 rules in 32 ms. Remains 274 /293 variables (removed 19) and now considering 374/393 (removed 19) transitions.
// Phase 1: matrix 374 rows 274 cols
[2025-06-06 23:35:49] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:35:49] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 23:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:35:49] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-06 23:35:49] [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 25728 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:36:25] [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/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
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 648/648 variables, and 651 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30015 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 55768ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 55769ms
Starting structural reductions in LTL mode, iteration 1 : 274/293 places, 374/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55992 ms. Remains : 274/293 places, 374/393 transitions.
Stuttering acceptance computed with spot in 444 ms :[false, (AND p0 (NOT p2) (NOT p1)), false, (NOT p1), (AND p0 (NOT p2) (NOT p1)), (NOT p1), true, false, (AND p0 (NOT p2) (NOT p1)), false, (AND p0 (NOT p2)), false]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-06
Product exploration explored 100000 steps with 314 reset in 202 ms.
Product exploration explored 100000 steps with 312 reset in 271 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 (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 127 ms. Reduced automaton from 12 states, 18 edges and 3 AP (stutter sensitive) to 12 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[false, (AND (NOT p2) p0 (NOT p1)), false, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), true, false, (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 11332 steps (32 resets) in 67 ms. (166 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 p2 (NOT p0)))), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0))), (F p1)]
Knowledge based reduction with 9 factoid took 341 ms. Reduced automaton from 12 states, 18 edges and 3 AP (stutter sensitive) to 12 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[false, (AND (NOT p2) p0 (NOT p1)), false, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), true, false, (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0), false]
Stuttering acceptance computed with spot in 409 ms :[false, (AND (NOT p2) p0 (NOT p1)), false, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), true, false, (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0), false]
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 374/374 transitions.
Applied a total of 0 rules in 9 ms. Remains 274 /274 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2025-06-06 23:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:36:47] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-06 23:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:36:48] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-06 23:36: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/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 25917 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:37:24] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 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 30015 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 55955ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 55956ms
Finished structural reductions in LTL mode , in 1 iterations and 56162 ms. Remains : 274/274 places, 374/374 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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 12 states, 18 edges and 3 AP (stutter sensitive) to 12 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[false, (AND (NOT p2) p0 (NOT p1)), false, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), true, false, (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 7215 steps (17 resets) in 42 ms. (167 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 p2 (NOT p0)))), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0))), (F p1)]
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 12 states, 18 edges and 3 AP (stutter sensitive) to 12 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[false, (AND (NOT p2) p0 (NOT p1)), false, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), true, false, (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0), false]
Stuttering acceptance computed with spot in 398 ms :[false, (AND (NOT p2) p0 (NOT p1)), false, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), true, false, (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0), false]
Stuttering acceptance computed with spot in 432 ms :[false, (AND (NOT p2) p0 (NOT p1)), false, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), true, false, (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0), false]
Product exploration explored 100000 steps with 307 reset in 142 ms.
Product exploration explored 100000 steps with 315 reset in 186 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 407 ms :[false, (AND (NOT p2) p0 (NOT p1)), false, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), true, false, (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0), false]
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 374/374 transitions.
Graph (trivial) has 293 edges and 274 vertex of which 176 / 274 are part of one of the 15 SCC in 2 ms
Free SCC test removed 161 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 113 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 37 place count 113 transition count 155
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 113 transition count 155
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 65 place count 87 transition count 124
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 91 place count 87 transition count 124
Performed 34 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 125 place count 87 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 87 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 146 place count 69 transition count 99
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 164 place count 69 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 68 transition count 98
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 68 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 68 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 169 place count 66 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 66 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 181 place count 66 transition count 86
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 210 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 64 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 184 place count 63 transition count 83
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 63 transition count 83
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 185 rules in 28 ms. Remains 63 /274 variables (removed 211) and now considering 83/374 (removed 291) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:37:47] [INFO ] Redundant transitions in 27 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-06 23:37:47] [INFO ] Flow matrix only has 67 transitions (discarded 16 similar events)
// Phase 1: matrix 67 rows 63 cols
[2025-06-06 23:37:47] [INFO ] Computed 2 invariants in 1 ms
[2025-06-06 23:37:47] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 4 (OVERLAPS) 66/129 variables, 63/65 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 14/79 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/79 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/80 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/80 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/80 constraints. Problems are: Problem set: 31 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 80 constraints, problems are : Problem set: 31 solved, 51 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/2 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 66/99 variables, 33/35 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 14/49 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 51/100 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 30/129 variables, 30/130 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/130 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 1/130 variables, 1/131 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/131 constraints. Problems are: Problem set: 31 solved, 51 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/131 constraints. Problems are: Problem set: 31 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 131 constraints, problems are : Problem set: 31 solved, 51 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 51/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3599ms problems are : Problem set: 31 solved, 51 unsolved
Search for dead transitions found 31 dead transitions in 3600ms
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 : 63/274 places, 52/374 transitions.
Graph (complete) has 89 edges and 63 vertex of which 32 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 6 ms. Remains 32 /63 variables (removed 31) and now considering 52/52 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/274 places, 52/374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3666 ms. Remains : 32/274 places, 52/374 transitions.
Built C files in :
/tmp/ltsmin17969282226662026447
[2025-06-06 23:37:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17969282226662026447
Running compilation step : cd /tmp/ltsmin17969282226662026447;'/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 473 ms.
Running link step : cd /tmp/ltsmin17969282226662026447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17969282226662026447;'/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/stateBased13999990240737399323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 374/374 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 374/374 (removed 0) transitions.
// Phase 1: matrix 374 rows 274 cols
[2025-06-06 23:38:05] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:38:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 23:38:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:38:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-06 23:38:06] [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 27115 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:38:43] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 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 30015 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 57161ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 57162ms
Finished structural reductions in LTL mode , in 1 iterations and 57360 ms. Remains : 274/274 places, 374/374 transitions.
Built C files in :
/tmp/ltsmin3038037170171260901
[2025-06-06 23:39:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3038037170171260901
Running compilation step : cd /tmp/ltsmin3038037170171260901;'/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 507 ms.
Running link step : cd /tmp/ltsmin3038037170171260901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3038037170171260901;'/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/stateBased1050020333280905010.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 23:39:18] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:39:18] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:39:18] [INFO ] Time to serialize gal into /tmp/LTL13077813954689834762.gal : 4 ms
[2025-06-06 23:39:18] [INFO ] Time to serialize properties into /tmp/LTL16569471319821481028.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13077813954689834762.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5986111165946775869.hoa' '-atoms' '/tmp/LTL16569471319821481028.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16569471319821481028.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5986111165946775869.hoa
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t30, t33, t62, t96, t99, t119, t122, t141, t144, t156, t159, t176, t194, t219, t235,...316
Computing Next relation with stutter on 75 deadlock states
10 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 items max in DFS search stack
1451 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.5558,418620,1,0,437,1.92245e+06,785,331,8481,1.99782e+06,827
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-19-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property SmartHome-PT-19-LTLFireability-06 finished in 224363 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' '!(F(G(p0)))'
Support contains 1 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Graph (trivial) has 318 edges and 293 vertex of which 195 / 293 are part of one of the 16 SCC in 2 ms
Free SCC test removed 179 places
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 113 transition count 112
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 75 transition count 112
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 77 place count 75 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 71 transition count 108
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 64 transition count 96
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 64 transition count 96
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 165 place count 31 transition count 62
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 27 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 186 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 188 place count 25 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 22 transition count 28
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 21 transition count 27
Applied a total of 195 rules in 18 ms. Remains 21 /293 variables (removed 272) and now considering 27/393 (removed 366) transitions.
[2025-06-06 23:39:33] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2025-06-06 23:39:33] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:39:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-06 23:39:33] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 23:39:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:39:33] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:39:33] [INFO ] Redundant transitions in 16 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 23:39:33] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 23:39:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/39 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/42 variables, and 21 constraints, problems are : Problem set: 0 solved, 11 unsolved in 191 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4/39 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 200 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 408ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/293 places, 27/393 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 21/293 places, 27/393 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-07 finished in 568 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(p0) U X(X((((p1||G(p0)) U !p0) U p2)))))'
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 283 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 283 transition count 383
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 277 transition count 377
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 277 transition count 377
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 273 transition count 373
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 273 transition count 373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 272 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 272 transition count 372
Applied a total of 42 rules in 28 ms. Remains 272 /293 variables (removed 21) and now considering 372/393 (removed 21) transitions.
// Phase 1: matrix 372 rows 272 cols
[2025-06-06 23:39:34] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:39:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 23:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:39:34] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-06 23:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 25683 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:40:10] [INFO ] Deduced a trap along path composed of 2 places in 26 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
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 30013 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 55719ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 55720ms
Starting structural reductions in LTL mode, iteration 1 : 272/293 places, 372/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55958 ms. Remains : 272/293 places, 372/393 transitions.
Stuttering acceptance computed with spot in 374 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), p0, true, (NOT p2), false]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-08
Entered a terminal (fully accepting) state of product in 119 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-08 finished in 56356 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' '!((F(p0)&&X(X(X(F(p1))))))'
Support contains 2 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 282 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 282 transition count 382
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 276 transition count 376
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 276 transition count 376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 272 transition count 372
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 271 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 271 transition count 371
Applied a total of 44 rules in 20 ms. Remains 271 /293 variables (removed 22) and now considering 371/393 (removed 22) transitions.
// Phase 1: matrix 371 rows 271 cols
[2025-06-06 23:40:30] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:40:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 23:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:40:30] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-06 23:40:30] [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 25199 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:41:05] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/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 30014 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 55241ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55242ms
Starting structural reductions in LTL mode, iteration 1 : 271/293 places, 371/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55434 ms. Remains : 271/293 places, 371/393 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-09
Stuttering criterion allowed to conclude after 508 steps with 1 reset in 2 ms.
FORMULA SmartHome-PT-19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-09 finished in 55642 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((p0 U X(p1))) U X(G((F(p2)||X(p3))))))'
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 286 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 286 transition count 386
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 282 transition count 382
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 282 transition count 382
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 280 transition count 380
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 280 transition count 380
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 279 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 279 transition count 379
Applied a total of 28 rules in 20 ms. Remains 279 /293 variables (removed 14) and now considering 379/393 (removed 14) transitions.
// Phase 1: matrix 379 rows 279 cols
[2025-06-06 23:41:26] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:41:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 23:41:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:41:26] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2025-06-06 23:41:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/658 variables, 279/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (OVERLAPS) 0/658 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 282 constraints, problems are : Problem set: 0 solved, 378 unsolved in 26801 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 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/278 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/658 variables, 279/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 378/660 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:42:04] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 378 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 658/658 variables, and 661 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56845ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 56846ms
Starting structural reductions in LTL mode, iteration 1 : 279/293 places, 379/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57050 ms. Remains : 279/293 places, 379/393 transitions.
Stuttering acceptance computed with spot in 630 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-10
Product exploration explored 100000 steps with 29768 reset in 133 ms.
Product exploration explored 100000 steps with 29783 reset in 146 ms.
Computed a total of 43 stabilizing places and 42 stable transitions
Computed a total of 43 stabilizing places and 42 stable transitions
Detected a total of 43/279 stabilizing places and 42/379 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p2) p3))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 137 ms. Reduced automaton from 15 states, 34 edges and 4 AP (stutter sensitive) to 15 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 20335 steps (59 resets) in 55 ms. (363 steps per ms) remains 0/15 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p2) p3))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR p0 p2 p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT p3)), (F p0), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 22 factoid took 701 ms. Reduced automaton from 15 states, 34 edges and 4 AP (stutter sensitive) to 15 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 604 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 621 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 379/379 transitions.
Applied a total of 0 rules in 8 ms. Remains 279 /279 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2025-06-06 23:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:42:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 23:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:42:26] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2025-06-06 23:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/658 variables, 279/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (OVERLAPS) 0/658 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 282 constraints, problems are : Problem set: 0 solved, 378 unsolved in 26609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 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/278 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/658 variables, 279/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 378/660 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:43:04] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/658 variables, and 661 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56646ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 56646ms
Finished structural reductions in LTL mode , in 1 iterations and 56819 ms. Remains : 279/279 places, 379/379 transitions.
Computed a total of 43 stabilizing places and 42 stable transitions
Computed a total of 43 stabilizing places and 42 stable transitions
Detected a total of 43/279 stabilizing places and 42/379 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p3), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p2) p3))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 146 ms. Reduced automaton from 15 states, 34 edges and 4 AP (stutter sensitive) to 15 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 613 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 21825 steps (60 resets) in 90 ms. (239 steps per ms) remains 0/15 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p3), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) (NOT p2) p3))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR p0 p2 p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT p3)), (F p0), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 22 factoid took 725 ms. Reduced automaton from 15 states, 34 edges and 4 AP (stutter sensitive) to 15 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 614 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 611 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 628 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 29754 reset in 112 ms.
Product exploration explored 100000 steps with 29789 reset in 126 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, true, true, false, false, true, true, false]
Stuttering acceptance computed with spot in 563 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 379/379 transitions.
Graph (trivial) has 298 edges and 279 vertex of which 183 / 279 are part of one of the 16 SCC in 1 ms
Free SCC test removed 167 places
Ensure Unique test removed 227 transitions
Reduce isomorphic transitions removed 227 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 112 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 112 transition count 151
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 39 place count 112 transition count 151
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 112 transition count 151
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 69 place count 86 transition count 123
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 95 place count 86 transition count 123
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 128 place count 86 transition count 123
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 144 place count 70 transition count 95
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 160 place count 70 transition count 95
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 66 transition count 91
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 66 transition count 91
Deduced a syphon composed of 34 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 182 place count 66 transition count 77
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 190 edges and 64 vertex of which 62 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 62 transition count 75
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 59 transition count 70
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 59 transition count 70
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 191 rules in 15 ms. Remains 59 /279 variables (removed 220) and now considering 70/379 (removed 309) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:43:27] [INFO ] Redundant transitions in 16 ms returned []
Running 69 sub problems to find dead transitions.
[2025-06-06 23:43:27] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
// Phase 1: matrix 62 rows 59 cols
[2025-06-06 23:43:27] [INFO ] Computed 1 invariants in 0 ms
[2025-06-06 23:43:27] [INFO ] State equation strengthened by 14 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, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 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 TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 2 (OVERLAPS) 61/119 variables, 58/59 constraints. Problems are: Problem set: 31 solved, 38 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 13/72 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/72 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/73 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/73 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/121 variables, 1/74 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/74 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/121 variables, 0/74 constraints. Problems are: Problem set: 31 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 74 constraints, problems are : Problem set: 31 solved, 38 unsolved in 710 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 38 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, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 1/1 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 61/89 variables, 28/29 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 13/42 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 38/80 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/80 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 31/120 variables, 31/111 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/111 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/121 variables, 1/112 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/112 constraints. Problems are: Problem set: 31 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/112 constraints. Problems are: Problem set: 31 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 112 constraints, problems are : Problem set: 31 solved, 38 unsolved in 1339 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 38/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2055ms problems are : Problem set: 31 solved, 38 unsolved
Search for dead transitions found 31 dead transitions in 2055ms
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/279 places, 39/379 transitions.
Graph (complete) has 65 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 4 ms. Remains 28 /59 variables (removed 31) and now considering 39/39 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/279 places, 39/379 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2097 ms. Remains : 28/279 places, 39/379 transitions.
Built C files in :
/tmp/ltsmin17235987975029801884
[2025-06-06 23:43:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17235987975029801884
Running compilation step : cd /tmp/ltsmin17235987975029801884;'/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 480 ms.
Running link step : cd /tmp/ltsmin17235987975029801884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17235987975029801884;'/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/stateBased2758896356824369888.hoa' '--buchi-type=spotba'
LTSmin run took 410 ms.
FORMULA SmartHome-PT-19-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-19-LTLFireability-10 finished in 124867 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' '!(F(G(p0)))'
Support contains 1 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Graph (trivial) has 317 edges and 293 vertex of which 188 / 293 are part of one of the 16 SCC in 0 ms
Free SCC test removed 172 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 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 120 transition count 116
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 77 transition count 115
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 76 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 75 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 92 place count 75 transition count 110
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 98 place count 72 transition count 110
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 106 place count 64 transition count 97
Iterating global reduction 4 with 8 rules applied. Total rules applied 114 place count 64 transition count 97
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 180 place count 31 transition count 63
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 184 place count 27 transition count 47
Iterating global reduction 4 with 4 rules applied. Total rules applied 188 place count 27 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 201 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 203 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 203 place count 25 transition count 33
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 205 place count 24 transition count 33
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 207 place count 22 transition count 29
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 21 transition count 28
Applied a total of 210 rules in 17 ms. Remains 21 /293 variables (removed 272) and now considering 28/393 (removed 365) transitions.
[2025-06-06 23:43:30] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 23:43:30] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:43:31] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 23:43:31] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 23:43:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:43:31] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:43:31] [INFO ] Redundant transitions in 18 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:43:31] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 23:43:31] [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) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 130 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 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) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 205 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 339ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/293 places, 28/393 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 21/293 places, 28/393 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-11 finished in 482 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(G(p0)) U (p1||F(p2))))'
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 284 transition count 384
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 284 transition count 384
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 279 transition count 379
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 279 transition count 379
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 275 transition count 375
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 275 transition count 375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 274 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 274 transition count 374
Applied a total of 38 rules in 21 ms. Remains 274 /293 variables (removed 19) and now considering 374/393 (removed 19) transitions.
// Phase 1: matrix 374 rows 274 cols
[2025-06-06 23:43:31] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:43:31] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 23:43:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:43:31] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-06 23:43:31] [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 25411 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:44:07] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 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 30019 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 55452ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 55454ms
Starting structural reductions in LTL mode, iteration 1 : 274/293 places, 374/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55663 ms. Remains : 274/293 places, 374/393 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-12
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-12 finished in 55790 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 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 282 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 282 transition count 382
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 276 transition count 376
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 276 transition count 376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 272 transition count 372
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 271 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 271 transition count 371
Applied a total of 44 rules in 19 ms. Remains 271 /293 variables (removed 22) and now considering 371/393 (removed 22) transitions.
// Phase 1: matrix 371 rows 271 cols
[2025-06-06 23:44:27] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:44:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 23:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:44:27] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-06 23:44:27] [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 25294 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:45:02] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/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 30014 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 55326ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55327ms
Starting structural reductions in LTL mode, iteration 1 : 271/293 places, 371/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55531 ms. Remains : 271/293 places, 371/393 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-13
Product exploration explored 100000 steps with 714 reset in 150 ms.
Stack based approach found an accepted trace after 208 steps with 1 reset with depth 54 and stack size 54 in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-19-LTLFireability-13 finished in 55766 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)||(p1 U p2)))'
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 282 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 282 transition count 382
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 276 transition count 376
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 276 transition count 376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 272 transition count 372
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 271 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 271 transition count 371
Applied a total of 44 rules in 20 ms. Remains 271 /293 variables (removed 22) and now considering 371/393 (removed 22) transitions.
[2025-06-06 23:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:45:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 23:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:45:23] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-06 23:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 25231 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:45:58] [INFO ] Deduced a trap along path composed of 2 places in 25 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 30011 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 55263ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55264ms
Starting structural reductions in LTL mode, iteration 1 : 271/293 places, 371/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55471 ms. Remains : 271/293 places, 371/393 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Detected a total of 37/271 stabilizing places and 36/371 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLFireability-15 finished in 55933 ms.
All properties solved by simple procedures.
Total runtime 865368 ms.

BK_STOP 1749253578974

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LTLFireability"
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 LTLFireability"
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-174901995200836"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;