Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SmartHome-PT-17-LTLCardinality-00
FORMULA_NAME SmartHome-PT-17-LTLCardinality-01
FORMULA_NAME SmartHome-PT-17-LTLCardinality-02
FORMULA_NAME SmartHome-PT-17-LTLCardinality-03
FORMULA_NAME SmartHome-PT-17-LTLCardinality-04
FORMULA_NAME SmartHome-PT-17-LTLCardinality-05
FORMULA_NAME SmartHome-PT-17-LTLCardinality-06
FORMULA_NAME SmartHome-PT-17-LTLCardinality-07
FORMULA_NAME SmartHome-PT-17-LTLCardinality-08
FORMULA_NAME SmartHome-PT-17-LTLCardinality-09
FORMULA_NAME SmartHome-PT-17-LTLCardinality-10
FORMULA_NAME SmartHome-PT-17-LTLCardinality-11
FORMULA_NAME SmartHome-PT-17-LTLCardinality-12
FORMULA_NAME SmartHome-PT-17-LTLCardinality-13
FORMULA_NAME SmartHome-PT-17-LTLCardinality-14
FORMULA_NAME SmartHome-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749251341223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 23:09:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 23:09:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:09:02] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-06-06 23:09:02] [INFO ] Transformed 571 places.
[2025-06-06 23:09:02] [INFO ] Transformed 617 transitions.
[2025-06-06 23:09:02] [INFO ] Found NUPN structural information;
[2025-06-06 23:09:02] [INFO ] Parsed PT model containing 571 places and 617 transitions and 1410 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 176 places in 6 ms
Reduce places removed 176 places and 150 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-17-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 467/467 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 380 transition count 467
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 119 place count 276 transition count 363
Iterating global reduction 1 with 104 rules applied. Total rules applied 223 place count 276 transition count 363
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 231 place count 276 transition count 355
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 251 place count 256 transition count 335
Iterating global reduction 2 with 20 rules applied. Total rules applied 271 place count 256 transition count 335
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 290 place count 237 transition count 316
Iterating global reduction 2 with 19 rules applied. Total rules applied 309 place count 237 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 311 place count 237 transition count 314
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 319 place count 229 transition count 306
Iterating global reduction 3 with 8 rules applied. Total rules applied 327 place count 229 transition count 306
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 228 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 228 transition count 305
Applied a total of 329 rules in 99 ms. Remains 228 /395 variables (removed 167) and now considering 305/467 (removed 162) transitions.
// Phase 1: matrix 305 rows 228 cols
[2025-06-06 23:09:02] [INFO ] Computed 3 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:09:03] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-06 23:09:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:09:03] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-06 23:09:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/533 variables, 228/231 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 0/533 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 231 constraints, problems are : Problem set: 0 solved, 304 unsolved in 18337 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/533 variables, 228/231 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 304/535 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:09:29] [INFO ] Deduced a trap along path composed of 4 places in 51 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:09:29] [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/533 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 0/533 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 533/533 variables, and 537 constraints, problems are : Problem set: 0 solved, 304 unsolved in 28498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46901ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 46919ms
Starting structural reductions in LTL mode, iteration 1 : 228/395 places, 305/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47459 ms. Remains : 228/395 places, 305/467 transitions.
Support contains 14 out of 228 places after structural reductions.
[2025-06-06 23:09:50] [INFO ] Flatten gal took : 39 ms
[2025-06-06 23:09:50] [INFO ] Flatten gal took : 23 ms
[2025-06-06 23:09:50] [INFO ] Input system was already deterministic with 305 transitions.
RANDOM walk for 32715 steps (119 resets) in 820 ms. (39 steps per ms) remains 0/8 properties
FORMULA SmartHome-PT-17-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 45 stabilizing places and 44 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(X(X(X(G((p0||X((X(p1) U (p0&&X(p1))))))))))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 305/305 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 222 transition count 299
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 222 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 222 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 218 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 218 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 215 transition count 291
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 215 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 214 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 214 transition count 290
Applied a total of 29 rules in 22 ms. Remains 214 /228 variables (removed 14) and now considering 290/305 (removed 15) transitions.
// Phase 1: matrix 290 rows 214 cols
[2025-06-06 23:09:51] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:09:51] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 23:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:09:51] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-06-06 23:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/504 variables, 214/217 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 0/504 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 217 constraints, problems are : Problem set: 0 solved, 289 unsolved in 15804 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/504 variables, 214/217 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 289/506 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:10:13] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:10:13] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 0/504 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 508 constraints, problems are : Problem set: 0 solved, 289 unsolved in 24936 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40778ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 40779ms
Starting structural reductions in LTL mode, iteration 1 : 214/228 places, 290/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40977 ms. Remains : 214/228 places, 290/305 transitions.
Stuttering acceptance computed with spot in 512 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-05
Product exploration explored 100000 steps with 10026 reset in 185 ms.
Stack based approach found an accepted trace after 2839 steps with 281 reset with depth 12 and stack size 12 in 4 ms.
FORMULA SmartHome-PT-17-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-17-LTLCardinality-05 finished in 41745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(X(X(p0))))))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 305/305 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 220 transition count 297
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 220 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 220 transition count 295
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 216 transition count 291
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 216 transition count 291
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 213 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 213 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 212 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 212 transition count 287
Applied a total of 34 rules in 20 ms. Remains 212 /228 variables (removed 16) and now considering 287/305 (removed 18) transitions.
// Phase 1: matrix 287 rows 212 cols
[2025-06-06 23:10:32] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:10:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 23:10:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:10:32] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-06 23:10:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 215 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15610 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 286/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:10:54] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 502 constraints, problems are : Problem set: 0 solved, 286 unsolved in 24135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39771ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 39772ms
Starting structural reductions in LTL mode, iteration 1 : 212/228 places, 287/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39939 ms. Remains : 212/228 places, 287/305 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-06
Product exploration explored 100000 steps with 16666 reset in 95 ms.
Product exploration explored 100000 steps with 16666 reset in 164 ms.
Computed a total of 33 stabilizing places and 32 stable transitions
Computed a total of 33 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 10 states, 14 edges and 1 AP (stutter sensitive) to 10 states, 14 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3586 steps (10 resets) in 18 ms. (188 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 10 states, 14 edges and 1 AP (stutter sensitive) to 10 states, 14 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 406 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 287/287 transitions.
Applied a total of 0 rules in 10 ms. Remains 212 /212 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2025-06-06 23:11:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:11:14] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 23:11:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:11:14] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-06 23:11:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 215 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15721 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 286/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:11:36] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 502 constraints, problems are : Problem set: 0 solved, 286 unsolved in 24356 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40101ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 40103ms
Finished structural reductions in LTL mode , in 1 iterations and 40269 ms. Remains : 212/212 places, 287/287 transitions.
Computed a total of 33 stabilizing places and 32 stable transitions
Computed a total of 33 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 10 states, 14 edges and 1 AP (stutter sensitive) to 10 states, 14 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2688 steps (9 resets) in 15 ms. (168 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 10 states, 14 edges and 1 AP (stutter sensitive) to 10 states, 14 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 373 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 98 ms.
Product exploration explored 100000 steps with 16666 reset in 152 ms.
Built C files in :
/tmp/ltsmin6884416847333941109
[2025-06-06 23:11:57] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6884416847333941109
Running compilation step : cd /tmp/ltsmin6884416847333941109;'/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 485 ms.
Running link step : cd /tmp/ltsmin6884416847333941109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6884416847333941109;'/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/stateBased6528487050611301140.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA SmartHome-PT-17-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-17-LTLCardinality-06 finished in 85114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 305/305 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 220 transition count 297
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 220 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 220 transition count 295
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 215 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 215 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 211 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 211 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 210 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 210 transition count 285
Applied a total of 38 rules in 12 ms. Remains 210 /228 variables (removed 18) and now considering 285/305 (removed 20) transitions.
// Phase 1: matrix 285 rows 210 cols
[2025-06-06 23:11:57] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:11:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-06 23:11:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:11:58] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-06 23:11:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/495 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/495 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 213 constraints, problems are : Problem set: 0 solved, 284 unsolved in 15507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/495 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 284/497 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:12:19] [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/495 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 0/495 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 498 constraints, problems are : Problem set: 0 solved, 284 unsolved in 25176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40716ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 40716ms
Starting structural reductions in LTL mode, iteration 1 : 210/228 places, 285/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40887 ms. Remains : 210/228 places, 285/305 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-17-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-17-LTLCardinality-08 finished in 41002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 305/305 transitions.
Graph (trivial) has 242 edges and 228 vertex of which 141 / 228 are part of one of the 12 SCC in 4 ms
Free SCC test removed 129 places
Ensure Unique test removed 175 transitions
Reduce isomorphic transitions removed 175 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 99 transition count 95
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 64 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 62 transition count 91
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 77 place count 62 transition count 89
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 60 transition count 89
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 87 place count 54 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 54 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 54 transition count 80
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 148 place count 27 transition count 53
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 150 place count 25 transition count 45
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 25 transition count 45
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 165 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 168 place count 22 transition count 28
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 22 transition count 28
Applied a total of 170 rules in 39 ms. Remains 22 /228 variables (removed 206) and now considering 28/305 (removed 277) transitions.
[2025-06-06 23:12:38] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 22 cols
[2025-06-06 23:12:38] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:12:38] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 23:12:38] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 23:12:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:12:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 23:12:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:12:38] [INFO ] Redundant transitions in 25 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-06 23:12:38] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 23:12:38] [INFO ] Invariant cache hit.
[2025-06-06 23:12:38] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 21/43 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 37 constraints, problems are : Problem set: 0 solved, 27 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 21/43 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/44 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 64 constraints, problems are : Problem set: 0 solved, 27 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 827ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/228 places, 28/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 963 ms. Remains : 22/228 places, 28/305 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-11
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 1 ms.
FORMULA SmartHome-PT-17-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-17-LTLCardinality-11 finished in 1059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 305/305 transitions.
Graph (trivial) has 238 edges and 228 vertex of which 139 / 228 are part of one of the 12 SCC in 0 ms
Free SCC test removed 127 places
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 100 transition count 99
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 67 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 65 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 73 place count 65 transition count 94
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 75 place count 64 transition count 94
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 58 transition count 86
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 58 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 58 transition count 84
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 139 place count 33 transition count 59
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 32 transition count 55
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 32 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 156 place count 32 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 158 place count 30 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 158 place count 30 transition count 39
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 160 place count 29 transition count 39
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 162 place count 27 transition count 35
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 27 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 26 transition count 34
Applied a total of 165 rules in 21 ms. Remains 26 /228 variables (removed 202) and now considering 34/305 (removed 271) transitions.
[2025-06-06 23:12:39] [INFO ] Flow matrix only has 27 transitions (discarded 7 similar events)
// Phase 1: matrix 27 rows 26 cols
[2025-06-06 23:12:39] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:12:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 23:12:39] [INFO ] Flow matrix only has 27 transitions (discarded 7 similar events)
[2025-06-06 23:12:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:12:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:12:39] [INFO ] Redundant transitions in 20 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-06 23:12:40] [INFO ] Flow matrix only has 27 transitions (discarded 7 similar events)
[2025-06-06 23:12:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 23/44 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 6/50 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/53 variables, and 26 constraints, problems are : Problem set: 0 solved, 15 unsolved in 170 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 23/44 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 6/50 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/51 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 1/52 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 42 constraints, problems are : Problem set: 0 solved, 15 unsolved in 273 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 446ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 447ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/228 places, 34/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 26/228 places, 34/305 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-13
Stuttering criterion allowed to conclude after 420 steps with 16 reset in 7 ms.
FORMULA SmartHome-PT-17-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-17-LTLCardinality-13 finished in 720 ms.
All properties solved by simple procedures.
Total runtime 218166 ms.

BK_STOP 1749251560659

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-17, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901995100819"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-17.tgz
mv SmartHome-PT-17 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;