Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027600011.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 CloudDeployment-PT-2b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027600011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 166K May 29 14:32 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 CloudDeployment-PT-2b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748552267097

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-2b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 20:57:48] [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-05-29 20:57:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:57:48] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-05-29 20:57:48] [INFO ] Transformed 556 places.
[2025-05-29 20:57:48] [INFO ] Transformed 684 transitions.
[2025-05-29 20:57:48] [INFO ] Found NUPN structural information;
[2025-05-29 20:57:48] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 178 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.
FORMULA CloudDeployment-PT-2b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 684/684 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 553 transition count 684
Discarding 125 places :
Symmetric choice reduction at 1 with 125 rule applications. Total rules 128 place count 428 transition count 548
Iterating global reduction 1 with 125 rules applied. Total rules applied 253 place count 428 transition count 548
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 294 place count 387 transition count 507
Iterating global reduction 1 with 41 rules applied. Total rules applied 335 place count 387 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 337 place count 387 transition count 505
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 342 place count 382 transition count 500
Iterating global reduction 2 with 5 rules applied. Total rules applied 347 place count 382 transition count 500
Applied a total of 347 rules in 138 ms. Remains 382 /556 variables (removed 174) and now considering 500/684 (removed 184) transitions.
// Phase 1: matrix 500 rows 382 cols
[2025-05-29 20:57:48] [INFO ] Computed 6 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:49] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-05-29 20:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:49] [INFO ] Implicit Places using invariants and state equation in 293 ms returned [8, 16, 187, 195]
[2025-05-29 20:57:49] [INFO ] Actually due to overlaps returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 619 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 381/556 places, 500/684 transitions.
Applied a total of 0 rules in 19 ms. Remains 381 /381 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 792 ms. Remains : 381/556 places, 500/684 transitions.
Support contains 11 out of 381 places after structural reductions.
[2025-05-29 20:57:49] [INFO ] Flatten gal took : 82 ms
[2025-05-29 20:57:49] [INFO ] Flatten gal took : 34 ms
[2025-05-29 20:57:49] [INFO ] Input system was already deterministic with 500 transitions.
RANDOM walk for 40000 steps (627 resets) in 1195 ms. (33 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (138 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (141 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (143 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (135 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
// Phase 1: matrix 500 rows 381 cols
[2025-05-29 20:57:50] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 76/91 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 24/115 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 48/163 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 237/400 variables, 125/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 217/617 variables, 95/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/617 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 165/782 variables, 82/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/782 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 80/862 variables, 47/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/862 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 19/881 variables, 15/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/881 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/881 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/881 variables, and 386 constraints, problems are : Problem set: 0 solved, 4 unsolved in 903 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 76/91 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 24/115 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 48/163 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 237/400 variables, 125/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 217/617 variables, 95/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/617 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 165/782 variables, 82/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/782 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 80/862 variables, 47/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/862 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 19/881 variables, 15/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/881 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/881 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/881 variables, and 390 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1954ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 198 ms.
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 500/500 transitions.
Graph (trivial) has 395 edges and 381 vertex of which 143 / 381 are part of one of the 16 SCC in 3 ms
Free SCC test removed 127 places
Drop transitions (Empty/Sink Transition effects.) removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Graph (complete) has 675 edges and 254 vertex of which 247 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 247 transition count 224
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 219 place count 142 transition count 224
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 219 place count 142 transition count 202
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 263 place count 120 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 267 place count 116 transition count 198
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 116 transition count 198
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 271 place count 116 transition count 196
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 275 place count 114 transition count 196
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 339 place count 82 transition count 164
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 367 place count 68 transition count 200
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 381 place count 68 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 413 place count 68 transition count 154
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 433 place count 68 transition count 132
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 233 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 43 rules applied. Total rules applied 476 place count 47 transition count 110
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 477 place count 47 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 479 place count 45 transition count 103
Iterating global reduction 5 with 2 rules applied. Total rules applied 481 place count 45 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 493 place count 45 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 494 place count 44 transition count 90
Applied a total of 494 rules in 81 ms. Remains 44 /381 variables (removed 337) and now considering 90/500 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 44/381 places, 90/500 transitions.
RANDOM walk for 4839 steps (145 resets) in 50 ms. (94 steps per ms) remains 0/1 properties
FORMULA CloudDeployment-PT-2b-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 61 stabilizing places and 113 stable transitions
Graph (complete) has 894 edges and 381 vertex of which 374 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 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 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 500/500 transitions.
Graph (trivial) has 398 edges and 381 vertex of which 143 / 381 are part of one of the 16 SCC in 1 ms
Free SCC test removed 127 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 725 edges and 254 vertex of which 247 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 246 transition count 247
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 212 place count 141 transition count 247
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 212 place count 141 transition count 226
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 254 place count 120 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 257 place count 117 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 260 place count 117 transition count 223
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 332 place count 81 transition count 187
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 356 place count 69 transition count 221
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 368 place count 69 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 392 place count 69 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 393 place count 68 transition count 184
Applied a total of 393 rules in 49 ms. Remains 68 /381 variables (removed 313) and now considering 184/500 (removed 316) transitions.
[2025-05-29 20:57:52] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
// Phase 1: matrix 145 rows 68 cols
[2025-05-29 20:57:52] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:52] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-29 20:57:52] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2025-05-29 20:57:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-29 20:57:52] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:57:53] [INFO ] Redundant transitions in 123 ms returned []
Running 167 sub problems to find dead transitions.
[2025-05-29 20:57:53] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2025-05-29 20:57:53] [INFO ] Invariant cache hit.
[2025-05-29 20:57:53] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/210 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 2/212 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/213 variables, and 76 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4933 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/210 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 2/212 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 156/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/213 variables, and 243 constraints, problems are : Problem set: 0 solved, 167 unsolved in 8724 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13764ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 13769ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/381 places, 184/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14085 ms. Remains : 68/381 places, 184/500 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-07
Stuttering criterion allowed to conclude after 33658 steps with 3215 reset in 160 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-07 finished in 14476 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((X(X(p0))&&(F(p1) U ((p0&&F(p1))||G(F(p1)))))))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 500/500 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 378 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 378 transition count 497
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 377 transition count 496
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 377 transition count 496
Applied a total of 8 rules in 33 ms. Remains 377 /381 variables (removed 4) and now considering 496/500 (removed 4) transitions.
// Phase 1: matrix 496 rows 377 cols
[2025-05-29 20:58:07] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-29 20:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:07] [INFO ] Implicit Places using invariants and state equation in 297 ms returned [15, 185, 193]
[2025-05-29 20:58:07] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 427 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 376/381 places, 496/500 transitions.
Applied a total of 0 rules in 16 ms. Remains 376 /376 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 477 ms. Remains : 376/381 places, 496/500 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-08
Product exploration explored 100000 steps with 1628 reset in 186 ms.
Product exploration explored 100000 steps with 1603 reset in 257 ms.
Computed a total of 59 stabilizing places and 111 stable transitions
Graph (complete) has 879 edges and 376 vertex of which 370 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 59 stabilizing places and 111 stable transitions
Detected a total of 59/376 stabilizing places and 111/496 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 127 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (622 resets) in 258 ms. (154 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (153 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (143 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
// Phase 1: matrix 496 rows 376 cols
[2025-05-29 20:58:08] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/118 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/163 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 240/403 variables, 121/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 200/603 variables, 94/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/603 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 166/769 variables, 75/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/769 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 87/856 variables, 55/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/856 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 13/869 variables, 9/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/872 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/872 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/872 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 380 constraints, problems are : Problem set: 0 solved, 2 unsolved in 316 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/118 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 45/163 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 240/403 variables, 121/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 200/603 variables, 94/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/603 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 166/769 variables, 75/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/769 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 87/856 variables, 55/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/856 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 13/869 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/872 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/872 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/872 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 872/872 variables, and 382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 658 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 984ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 25 ms.
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 496/496 transitions.
Graph (trivial) has 388 edges and 376 vertex of which 137 / 376 are part of one of the 15 SCC in 1 ms
Free SCC test removed 122 places
Drop transitions (Empty/Sink Transition effects.) removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Graph (complete) has 664 edges and 254 vertex of which 248 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 248 transition count 226
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 218 place count 143 transition count 226
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 218 place count 143 transition count 204
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 262 place count 121 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 264 place count 119 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 266 place count 119 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 266 place count 119 transition count 200
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 270 place count 117 transition count 200
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
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 336 place count 84 transition count 167
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 364 place count 70 transition count 203
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 378 place count 70 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 410 place count 70 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 412 place count 69 transition count 165
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 432 place count 69 transition count 143
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 245 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 43 rules applied. Total rules applied 475 place count 48 transition count 121
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 476 place count 48 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 478 place count 46 transition count 114
Iterating global reduction 5 with 2 rules applied. Total rules applied 480 place count 46 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 498 place count 46 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 499 place count 45 transition count 95
Applied a total of 499 rules in 45 ms. Remains 45 /376 variables (removed 331) and now considering 95/496 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 45/376 places, 95/496 transitions.
RANDOM walk for 24208 steps (706 resets) in 46 ms. (515 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 211 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2025-05-29 20:58:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 20:58:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-29 20:58:10] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2025-05-29 20:58:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 20:58:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-29 20:58:11] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2025-05-29 20:58:11] [INFO ] Computed and/alt/rep : 486/892/486 causal constraints (skipped 9 transitions) in 27 ms.
[2025-05-29 20:58:14] [INFO ] Added : 306 causal constraints over 62 iterations in 2920 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 496/496 transitions.
Applied a total of 0 rules in 8 ms. Remains 376 /376 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2025-05-29 20:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:14] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-29 20:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:14] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [184, 192]
[2025-05-29 20:58:14] [INFO ] Actually due to overlaps returned [184]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 496/496 transitions.
Applied a total of 0 rules in 4 ms. Remains 375 /375 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 331 ms. Remains : 375/376 places, 496/496 transitions.
Computed a total of 59 stabilizing places and 111 stable transitions
Graph (complete) has 871 edges and 375 vertex of which 370 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 59 stabilizing places and 111 stable transitions
Detected a total of 59/375 stabilizing places and 111/496 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (624 resets) in 222 ms. (179 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (140 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (143 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
// Phase 1: matrix 496 rows 375 cols
[2025-05-29 20:58:14] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/118 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/157 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 244/401 variables, 119/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 201/602 variables, 95/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 166/768 variables, 75/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/768 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 87/855 variables, 55/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/855 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 13/868 variables, 9/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/868 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/871 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/871 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/871 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 871/871 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/118 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/157 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 244/401 variables, 119/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 201/602 variables, 95/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 166/768 variables, 75/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/768 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 87/855 variables, 55/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/855 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 13/868 variables, 9/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/868 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/871 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/871 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/871 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 871/871 variables, and 380 constraints, problems are : Problem set: 0 solved, 2 unsolved in 596 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2797 steps, including 39 resets, run visited all 2 properties in 27 ms. (steps per millisecond=103 )
Parikh walk visited 2 properties in 29 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2025-05-29 20:58:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 20:58:16] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2025-05-29 20:58:16] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2025-05-29 20:58:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 20:58:16] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2025-05-29 20:58:17] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2025-05-29 20:58:17] [INFO ] Computed and/alt/rep : 486/890/486 causal constraints (skipped 9 transitions) in 24 ms.
[2025-05-29 20:58:19] [INFO ] Added : 293 causal constraints over 59 iterations in 2443 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-08 finished in 12714 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))'
Support contains 1 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 500/500 transitions.
Graph (trivial) has 397 edges and 381 vertex of which 143 / 381 are part of one of the 16 SCC in 1 ms
Free SCC test removed 127 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 725 edges and 254 vertex of which 247 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 246 transition count 248
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 210 place count 142 transition count 248
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 210 place count 142 transition count 227
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 252 place count 121 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 118 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 118 transition count 224
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 330 place count 82 transition count 188
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 354 place count 70 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 366 place count 70 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 390 place count 70 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 69 transition count 185
Applied a total of 391 rules in 35 ms. Remains 69 /381 variables (removed 312) and now considering 185/500 (removed 315) transitions.
[2025-05-29 20:58:19] [INFO ] Flow matrix only has 148 transitions (discarded 37 similar events)
// Phase 1: matrix 148 rows 69 cols
[2025-05-29 20:58:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-29 20:58:19] [INFO ] Flow matrix only has 148 transitions (discarded 37 similar events)
[2025-05-29 20:58:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-29 20:58:20] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:58:20] [INFO ] Redundant transitions in 148 ms returned []
Running 168 sub problems to find dead transitions.
[2025-05-29 20:58:20] [INFO ] Flow matrix only has 148 transitions (discarded 37 similar events)
[2025-05-29 20:58:20] [INFO ] Invariant cache hit.
[2025-05-29 20:58:20] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 147/214 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 2/216 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/217 variables, and 77 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5077 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 147/214 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 2/216 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 157/245 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/216 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/217 variables, and 245 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9517 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14667ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 14670ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/381 places, 185/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14977 ms. Remains : 69/381 places, 185/500 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-11 finished in 15034 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||G(p1)))))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 500/500 transitions.
Graph (trivial) has 393 edges and 381 vertex of which 132 / 381 are part of one of the 16 SCC in 2 ms
Free SCC test removed 116 places
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Graph (complete) has 739 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 257 transition count 262
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 211 place count 153 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 152 transition count 261
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 212 place count 152 transition count 239
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 256 place count 130 transition count 239
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 260 place count 126 transition count 235
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 126 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 264 place count 126 transition count 234
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 266 place count 125 transition count 234
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 340 place count 88 transition count 197
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 368 place count 74 transition count 236
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 383 place count 74 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 407 place count 74 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 408 place count 73 transition count 196
Applied a total of 408 rules in 37 ms. Remains 73 /381 variables (removed 308) and now considering 196/500 (removed 304) transitions.
[2025-05-29 20:58:34] [INFO ] Flow matrix only has 159 transitions (discarded 37 similar events)
// Phase 1: matrix 159 rows 73 cols
[2025-05-29 20:58:34] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-29 20:58:34] [INFO ] Flow matrix only has 159 transitions (discarded 37 similar events)
[2025-05-29 20:58:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-29 20:58:35] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:58:35] [INFO ] Redundant transitions in 174 ms returned []
Running 179 sub problems to find dead transitions.
[2025-05-29 20:58:35] [INFO ] Flow matrix only has 159 transitions (discarded 37 similar events)
[2025-05-29 20:58:35] [INFO ] Invariant cache hit.
[2025-05-29 20:58:35] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 158/229 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 2/231 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/232 variables, and 81 constraints, problems are : Problem set: 0 solved, 179 unsolved in 6681 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 158/229 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 2/231 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 163/260 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/232 variables, and 260 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10778 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17554ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 17555ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/381 places, 196/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17907 ms. Remains : 73/381 places, 196/500 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-15
Stuttering criterion allowed to conclude after 9860 steps with 950 reset in 25 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-15 finished in 18022 ms.
All properties solved by simple procedures.
Total runtime 64671 ms.

BK_STOP 1748552332953

--------------------
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="CloudDeployment-PT-2b"
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 CloudDeployment-PT-2b, 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 r044-tall-174854027600011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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