Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r069-tall-171620504900612.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is CloudDeployment-PT-6b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504900612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-6b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716471816102

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 13:43:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 13:43:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:43:37] [INFO ] Load time of PNML (sax parser for PT used): 495 ms
[2024-05-23 13:43:37] [INFO ] Transformed 1888 places.
[2024-05-23 13:43:38] [INFO ] Transformed 6804 transitions.
[2024-05-23 13:43:38] [INFO ] Found NUPN structural information;
[2024-05-23 13:43:38] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 734 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudDeployment-PT-6b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 1888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1882 transition count 6804
Discarding 519 places :
Symmetric choice reduction at 1 with 519 rule applications. Total rules 525 place count 1363 transition count 6285
Iterating global reduction 1 with 519 rules applied. Total rules applied 1044 place count 1363 transition count 6285
Discarding 201 places :
Symmetric choice reduction at 1 with 201 rule applications. Total rules 1245 place count 1162 transition count 6084
Iterating global reduction 1 with 201 rules applied. Total rules applied 1446 place count 1162 transition count 6084
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 1474 place count 1162 transition count 6056
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1493 place count 1143 transition count 6037
Iterating global reduction 2 with 19 rules applied. Total rules applied 1512 place count 1143 transition count 6037
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1513 place count 1142 transition count 6036
Iterating global reduction 2 with 1 rules applied. Total rules applied 1514 place count 1142 transition count 6036
Applied a total of 1514 rules in 685 ms. Remains 1142 /1888 variables (removed 746) and now considering 6036/6804 (removed 768) transitions.
// Phase 1: matrix 6036 rows 1142 cols
[2024-05-23 13:43:39] [INFO ] Computed 19 invariants in 122 ms
[2024-05-23 13:43:39] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-23 13:43:39] [INFO ] Invariant cache hit.
[2024-05-23 13:43:43] [INFO ] Implicit Places using invariants and state equation in 3738 ms returned []
Implicit Place search using SMT with State Equation took 4486 ms to find 0 implicit places.
Running 6035 sub problems to find dead transitions.
[2024-05-23 13:43:43] [INFO ] Invariant cache hit.
(s272 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 3.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 5.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1141/7178 variables, and 19 constraints, problems are : Problem set: 0 solved, 6035 unsolved in 30151 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1142 constraints, PredecessorRefiner: 6035/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1141/7178 variables, and 19 constraints, problems are : Problem set: 0 solved, 6035 unsolved in 30070 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1142 constraints, PredecessorRefiner: 4096/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 143858ms problems are : Problem set: 0 solved, 6035 unsolved
Search for dead transitions found 0 dead transitions in 143995ms
Starting structural reductions in LTL mode, iteration 1 : 1142/1888 places, 6036/6804 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149255 ms. Remains : 1142/1888 places, 6036/6804 transitions.
Support contains 57 out of 1142 places after structural reductions.
[2024-05-23 13:46:09] [INFO ] Flatten gal took : 1238 ms
[2024-05-23 13:46:10] [INFO ] Flatten gal took : 842 ms
[2024-05-23 13:46:11] [INFO ] Input system was already deterministic with 6036 transitions.
Support contains 55 out of 1142 places (down from 57) after GAL structural reductions.
RANDOM walk for 40000 steps (202 resets) in 2229 ms. (17 steps per ms) remains 28/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
[2024-05-23 13:46:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 225/276 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 5062/5338 variables, 276/295 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5338 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 6 (OVERLAPS) 583/5921 variables, 245/540 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5921 variables, 0/540 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 541/6462 variables, 237/777 constraints. Problems are: Problem set: 15 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6462/7178 variables, and 777 constraints, problems are : Problem set: 15 solved, 13 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 758/1142 constraints, PredecessorRefiner: 28/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 237/276 variables, 18/19 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5062/5338 variables, 276/295 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5338 variables, 1/296 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5338 variables, 0/296 constraints. Problems are: Problem set: 15 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 7 (OVERLAPS) 583/5921 variables, 245/541 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5921 variables, 11/552 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5921 variables, 0/552 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 541/6462 variables, 237/789 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6462 variables, 0/789 constraints. Problems are: Problem set: 16 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6952/7178 variables, and 1019 constraints, problems are : Problem set: 16 solved, 12 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 988/1142 constraints, PredecessorRefiner: 13/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 10609ms problems are : Problem set: 16 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 1142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1138 edges and 1142 vertex of which 396 / 1142 are part of one of the 44 SCC in 10 ms
Free SCC test removed 352 places
Drop transitions (Empty/Sink Transition effects.) removed 4544 transitions
Reduce isomorphic transitions removed 4544 transitions.
Graph (complete) has 3198 edges and 790 vertex of which 757 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.7 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 305 transitions
Trivial Post-agglo rules discarded 305 transitions
Performed 305 trivial Post agglomeration. Transition count delta: 305
Iterating post reduction 0 with 323 rules applied. Total rules applied 325 place count 757 transition count 1169
Reduce places removed 305 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 314 rules applied. Total rules applied 639 place count 452 transition count 1160
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 646 place count 445 transition count 1160
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 646 place count 445 transition count 1092
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 782 place count 377 transition count 1092
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 790 place count 369 transition count 1084
Iterating global reduction 3 with 8 rules applied. Total rules applied 798 place count 369 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 799 place count 369 transition count 1083
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 799 place count 369 transition count 1076
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 813 place count 362 transition count 1076
Performed 101 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 1015 place count 261 transition count 974
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -238
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1089 place count 224 transition count 1212
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 1131 place count 224 transition count 1170
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1143 place count 218 transition count 1230
Drop transitions (Redundant composition of simpler transitions.) removed 152 transitions
Redundant transition composition rules discarded 152 transitions
Iterating global reduction 5 with 152 rules applied. Total rules applied 1295 place count 218 transition count 1078
Free-agglomeration rule applied 47 times with reduction of 4 identical transitions.
Iterating global reduction 5 with 47 rules applied. Total rules applied 1342 place count 218 transition count 1027
Reduce places removed 47 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 5 with 174 rules applied. Total rules applied 1516 place count 171 transition count 900
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1521 place count 166 transition count 863
Iterating global reduction 6 with 5 rules applied. Total rules applied 1526 place count 166 transition count 863
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 1564 place count 166 transition count 825
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1566 place count 166 transition count 825
Applied a total of 1566 rules in 420 ms. Remains 166 /1142 variables (removed 976) and now considering 825/6036 (removed 5211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 166/1142 places, 825/6036 transitions.
RANDOM walk for 40000 steps (8 resets) in 495 ms. (80 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 372 ms. (107 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/5 properties
[2024-05-23 13:46:24] [INFO ] Flow matrix only has 526 transitions (discarded 299 similar events)
// Phase 1: matrix 526 rows 166 cols
[2024-05-23 13:46:24] [INFO ] Computed 18 invariants in 2 ms
[2024-05-23 13:46:24] [INFO ] State equation strengthened by 254 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 43/94 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/146 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 488/634 variables, 146/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 149/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/634 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 58/692 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/692 variables, 105/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/692 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/692 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 438 constraints, problems are : Problem set: 0 solved, 4 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 166/166 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 43/94 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/146 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 13:46:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 5 ms to minimize.
[2024-05-23 13:46:25] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 488/634 variables, 146/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/634 variables, 149/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/634 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 58/692 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/692 variables, 105/440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/692 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/692 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 692/692 variables, and 444 constraints, problems are : Problem set: 0 solved, 4 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 166/166 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1328ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 359 ms.
Support contains 9 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 825/825 transitions.
Graph (trivial) has 65 edges and 166 vertex of which 8 / 166 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 162 transition count 813
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 161 transition count 813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 161 transition count 812
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 160 transition count 812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 159 transition count 805
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 159 transition count 805
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 157 transition count 803
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 156 transition count 804
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 156 transition count 800
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 50 place count 156 transition count 767
Free-agglomeration rule applied 9 times with reduction of 4 identical transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 59 place count 156 transition count 754
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 119 place count 147 transition count 703
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 145 transition count 683
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 145 transition count 683
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 145 transition count 681
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 155 place count 145 transition count 651
Applied a total of 155 rules in 99 ms. Remains 145 /166 variables (removed 21) and now considering 651/825 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 145/166 places, 651/825 transitions.
RANDOM walk for 40000 steps (603 resets) in 357 ms. (111 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (60 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
[2024-05-23 13:46:26] [INFO ] Flow matrix only has 368 transitions (discarded 283 similar events)
// Phase 1: matrix 368 rows 145 cols
[2024-05-23 13:46:26] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 13:46:26] [INFO ] State equation strengthened by 235 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 53/88 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/139 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 367/506 variables, 139/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 210/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/513 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 25/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/513 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 401 constraints, problems are : Problem set: 0 solved, 3 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 145/145 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 53/88 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/139 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 13:46:27] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 367/506 variables, 139/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 210/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 7/513 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 25/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/513 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 405 constraints, problems are : Problem set: 0 solved, 3 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 145/145 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1055ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 2279 steps, including 57 resets, run visited all 1 properties in 9 ms. (steps per millisecond=253 )
Parikh walk visited 3 properties in 143 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 16 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-6b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 180 stabilizing places and 4754 stable transitions
Graph (complete) has 3775 edges and 1142 vertex of which 1109 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.51 ms
FORMULA CloudDeployment-PT-6b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U (p1||X(p0))))'
Support contains 6 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 1120 transition count 1932
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 1120 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1120 transition count 1931
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1117 transition count 1928
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1117 transition count 1928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 1117 transition count 1927
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 1116 transition count 1926
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 1116 transition count 1926
Applied a total of 53 rules in 447 ms. Remains 1116 /1142 variables (removed 26) and now considering 1926/6036 (removed 4110) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2024-05-23 13:46:28] [INFO ] Computed 18 invariants in 6 ms
[2024-05-23 13:46:29] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-23 13:46:29] [INFO ] Invariant cache hit.
[2024-05-23 13:46:30] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2024-05-23 13:46:30] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1674 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1142 places, 1926/6036 transitions.
Applied a total of 0 rules in 28 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2149 ms. Remains : 1115/1142 places, 1926/6036 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), p0, true]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-01
Product exploration explored 100000 steps with 512 reset in 357 ms.
Product exploration explored 100000 steps with 510 reset in 259 ms.
Computed a total of 161 stabilizing places and 653 stable transitions
Graph (complete) has 3698 edges and 1115 vertex of which 1096 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.11 ms
Computed a total of 161 stabilizing places and 653 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[true, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
RANDOM walk for 40000 steps (209 resets) in 306 ms. (130 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
// Phase 1: matrix 1926 rows 1115 cols
[2024-05-23 13:46:31] [INFO ] Computed 17 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 933/1170 variables, 237/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1170 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 579/1749 variables, 243/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1749 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 526/2275 variables, 232/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2275 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 514/2789 variables, 230/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2789 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 196/2985 variables, 139/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2985 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/3025 variables, 23/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3025 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/3041 variables, 11/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3041 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3041 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 1132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1095 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 1115/1115 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 933/1170 variables, 237/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1170 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 579/1749 variables, 243/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1749 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1749 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 526/2275 variables, 232/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2275 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 514/2789 variables, 230/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2789 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 196/2985 variables, 139/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2985 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 40/3025 variables, 23/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3025 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/3041 variables, 11/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3041 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/3041 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3041/3041 variables, and 1133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1395 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 1115/1115 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2543ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 339 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=169 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLFireability-01 finished in 6234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 1121 transition count 1933
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 1121 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1121 transition count 1932
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 1118 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 1118 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 1118 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1117 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1117 transition count 1927
Applied a total of 51 rules in 241 ms. Remains 1117 /1142 variables (removed 25) and now considering 1927/6036 (removed 4109) transitions.
// Phase 1: matrix 1927 rows 1117 cols
[2024-05-23 13:46:34] [INFO ] Computed 18 invariants in 6 ms
[2024-05-23 13:46:34] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 13:46:34] [INFO ] Invariant cache hit.
[2024-05-23 13:46:35] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned [12, 20, 187, 195, 360, 368, 533, 541, 706, 714, 879, 887]
[2024-05-23 13:46:35] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1484 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1116/1142 places, 1927/6036 transitions.
Applied a total of 0 rules in 33 ms. Remains 1116 /1116 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1758 ms. Remains : 1116/1142 places, 1927/6036 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 677 ms.
Product exploration explored 100000 steps with 50000 reset in 597 ms.
Computed a total of 162 stabilizing places and 654 stable transitions
Graph (complete) has 3699 edges and 1116 vertex of which 1097 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.7 ms
Computed a total of 162 stabilizing places and 654 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLFireability-06 finished in 3146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 1121 transition count 1933
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 1121 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1121 transition count 1932
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 1118 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 1118 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 1118 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1117 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1117 transition count 1927
Applied a total of 51 rules in 321 ms. Remains 1117 /1142 variables (removed 25) and now considering 1927/6036 (removed 4109) transitions.
// Phase 1: matrix 1927 rows 1117 cols
[2024-05-23 13:46:37] [INFO ] Computed 18 invariants in 15 ms
[2024-05-23 13:46:37] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-23 13:46:37] [INFO ] Invariant cache hit.
[2024-05-23 13:46:39] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 887]
[2024-05-23 13:46:39] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1417 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1116/1142 places, 1927/6036 transitions.
Applied a total of 0 rules in 32 ms. Remains 1116 /1116 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1770 ms. Remains : 1116/1142 places, 1927/6036 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-07
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-07 finished in 1930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p1))))'
Support contains 6 out of 1142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1162 edges and 1142 vertex of which 414 / 1142 are part of one of the 46 SCC in 5 ms
Free SCC test removed 368 places
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Graph (complete) has 3285 edges and 774 vertex of which 741 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.14 ms
Discarding 33 places :
Also discarding 4097 output transitions
Drop transitions (Output transitions of discarded places.) removed 4097 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 304 place count 741 transition count 1216
Reduce places removed 302 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 305 rules applied. Total rules applied 609 place count 439 transition count 1213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 611 place count 437 transition count 1213
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 611 place count 437 transition count 1152
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 733 place count 376 transition count 1152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 737 place count 372 transition count 1148
Iterating global reduction 3 with 4 rules applied. Total rules applied 741 place count 372 transition count 1148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 742 place count 372 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 743 place count 371 transition count 1146
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 371 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 745 place count 370 transition count 1145
Iterating global reduction 4 with 1 rules applied. Total rules applied 746 place count 370 transition count 1145
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 982 place count 252 transition count 1027
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1030 place count 228 transition count 1081
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1036 place count 228 transition count 1075
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1048 place count 222 transition count 1135
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 1096 place count 222 transition count 1087
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1098 place count 221 transition count 1093
Applied a total of 1098 rules in 209 ms. Remains 221 /1142 variables (removed 921) and now considering 1093/6036 (removed 4943) transitions.
[2024-05-23 13:46:39] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
// Phase 1: matrix 874 rows 221 cols
[2024-05-23 13:46:39] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 13:46:39] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-23 13:46:39] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-23 13:46:39] [INFO ] Invariant cache hit.
[2024-05-23 13:46:40] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-23 13:46:40] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-05-23 13:46:41] [INFO ] Redundant transitions in 904 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-05-23 13:46:41] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-23 13:46:41] [INFO ] Invariant cache hit.
[2024-05-23 13:46:41] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 873/1093 variables, 220/226 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 287/513 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1095 variables, and 513 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/221 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 873/1093 variables, 220/226 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 287/513 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 1092/1605 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1093/1095 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/221 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
After SMT, in 64480ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 64490ms
Starting structural reductions in SI_LTL mode, iteration 1 : 221/1142 places, 1093/6036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66486 ms. Remains : 221/1142 places, 1093/6036 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), p1, p1]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-13
Product exploration explored 100000 steps with 2196 reset in 519 ms.
Product exploration explored 100000 steps with 2238 reset in 472 ms.
Computed a total of 60 stabilizing places and 661 stable transitions
Computed a total of 60 stabilizing places and 661 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
RANDOM walk for 40000 steps (934 resets) in 913 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (39 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 727217 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 727217 steps, saw 119924 distinct states, run finished after 3004 ms. (steps per millisecond=242 ) properties seen :0
[2024-05-23 13:47:50] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-23 13:47:50] [INFO ] Invariant cache hit.
[2024-05-23 13:47:50] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/556 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 505/1061 variables, 149/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 281/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 33/1094 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1095 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1095 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 221/221 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/556 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 505/1061 variables, 149/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 281/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/1094 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1094 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1095 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1095 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1095 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 221/221 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 816ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 221 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 220 transition count 1024
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 219 transition count 1023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 219 transition count 1022
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -179
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 107 place count 202 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 122 place count 202 transition count 1186
Drop transitions (Redundant composition of simpler transitions.) removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 284 place count 202 transition count 1024
Free-agglomeration rule applied 56 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 340 place count 202 transition count 948
Reduce places removed 56 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 4 with 233 rules applied. Total rules applied 573 place count 146 transition count 771
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 581 place count 138 transition count 708
Iterating global reduction 5 with 8 rules applied. Total rules applied 589 place count 138 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 591 place count 138 transition count 706
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 6 with 92 rules applied. Total rules applied 683 place count 138 transition count 614
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 685 place count 138 transition count 614
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 686 place count 138 transition count 613
Applied a total of 686 rules in 126 ms. Remains 138 /221 variables (removed 83) and now considering 613/1093 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 138/221 places, 613/1093 transitions.
RANDOM walk for 40000 steps (680 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (37 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1027665 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 1
Probabilistic random walk after 1027665 steps, saw 128075 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
[2024-05-23 13:47:54] [INFO ] Flow matrix only has 324 transitions (discarded 289 similar events)
// Phase 1: matrix 324 rows 138 cols
[2024-05-23 13:47:54] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 13:47:54] [INFO ] State equation strengthened by 212 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/269 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 109/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 107/376 variables, 37/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 72/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/452 variables, 36/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 31/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/462 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/462 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/269 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 109/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/376 variables, 37/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 72/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/452 variables, 36/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 31/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/462 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/462 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2476 steps, including 78 resets, run visited all 1 properties in 15 ms. (steps per millisecond=165 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Support contains 5 out of 221 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Applied a total of 0 rules in 23 ms. Remains 221 /221 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
[2024-05-23 13:47:55] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
// Phase 1: matrix 874 rows 221 cols
[2024-05-23 13:47:55] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 13:47:55] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-23 13:47:55] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-23 13:47:55] [INFO ] Invariant cache hit.
[2024-05-23 13:47:55] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-23 13:47:55] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2024-05-23 13:47:56] [INFO ] Redundant transitions in 700 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-05-23 13:47:56] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-23 13:47:56] [INFO ] Invariant cache hit.
[2024-05-23 13:47:56] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 873/1093 variables, 220/226 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 287/513 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1095 variables, and 513 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/221 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (OVERLAPS) 873/1093 variables, 220/226 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 287/513 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 1092/1605 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1093/1095 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/221 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 0/0 constraints]
After SMT, in 64171ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 64181ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65614 ms. Remains : 221/221 places, 1093/1093 transitions.
Computed a total of 60 stabilizing places and 661 stable transitions
Computed a total of 60 stabilizing places and 661 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
RANDOM walk for 40000 steps (935 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (39 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 753998 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 753998 steps, saw 123946 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2024-05-23 13:49:04] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-23 13:49:04] [INFO ] Invariant cache hit.
[2024-05-23 13:49:04] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/556 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 505/1061 variables, 149/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 281/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 33/1094 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1095 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1095 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 221/221 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/556 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 505/1061 variables, 149/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 281/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/1094 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1094 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1094 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1095 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1095 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1095 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 474 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 221/221 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 846ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 221 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 220 transition count 1024
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 219 transition count 1023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 219 transition count 1022
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -179
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 107 place count 202 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 122 place count 202 transition count 1186
Drop transitions (Redundant composition of simpler transitions.) removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 284 place count 202 transition count 1024
Free-agglomeration rule applied 56 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 340 place count 202 transition count 948
Reduce places removed 56 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 4 with 233 rules applied. Total rules applied 573 place count 146 transition count 771
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 581 place count 138 transition count 708
Iterating global reduction 5 with 8 rules applied. Total rules applied 589 place count 138 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 591 place count 138 transition count 706
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 6 with 92 rules applied. Total rules applied 683 place count 138 transition count 614
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 685 place count 138 transition count 614
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 686 place count 138 transition count 613
Applied a total of 686 rules in 96 ms. Remains 138 /221 variables (removed 83) and now considering 613/1093 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 138/221 places, 613/1093 transitions.
RANDOM walk for 40000 steps (672 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (39 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1011542 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1011542 steps, saw 126586 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2024-05-23 13:49:08] [INFO ] Flow matrix only has 324 transitions (discarded 289 similar events)
// Phase 1: matrix 324 rows 138 cols
[2024-05-23 13:49:08] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 13:49:08] [INFO ] State equation strengthened by 212 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/269 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 109/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 107/376 variables, 37/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 72/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/452 variables, 36/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 31/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/462 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/462 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/269 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 109/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/376 variables, 37/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 72/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/452 variables, 36/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 31/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/462 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/462 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 793 steps, including 24 resets, run visited all 1 properties in 7 ms. (steps per millisecond=113 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p1, p1]
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Stuttering acceptance computed with spot in 57 ms :[p1, p1]
Product exploration explored 100000 steps with 2198 reset in 463 ms.
Product exploration explored 100000 steps with 2207 reset in 464 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 1092
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 219 transition count 1090
Applied a total of 5 rules in 33 ms. Remains 219 /221 variables (removed 2) and now considering 1090/1093 (removed 3) transitions.
[2024-05-23 13:49:09] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
// Phase 1: matrix 871 rows 219 cols
[2024-05-23 13:49:09] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 13:49:10] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-23 13:49:10] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
[2024-05-23 13:49:10] [INFO ] Invariant cache hit.
[2024-05-23 13:49:10] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-23 13:49:10] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2024-05-23 13:49:11] [INFO ] Redundant transitions in 692 ms returned []
Running 1089 sub problems to find dead transitions.
[2024-05-23 13:49:11] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
[2024-05-23 13:49:11] [INFO ] Invariant cache hit.
[2024-05-23 13:49:11] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (OVERLAPS) 870/1088 variables, 218/224 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 287/511 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1090 variables, and 511 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 218/219 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1089/1089 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1089 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (OVERLAPS) 870/1088 variables, 218/224 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 287/511 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 1089/1600 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1090 variables, and 1600 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 218/219 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 1089/1089 constraints, Known Traps: 0/0 constraints]
After SMT, in 64263ms problems are : Problem set: 0 solved, 1089 unsolved
Search for dead transitions found 0 dead transitions in 64272ms
Starting structural reductions in SI_LTL mode, iteration 1 : 219/221 places, 1090/1093 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65689 ms. Remains : 219/221 places, 1090/1093 transitions.
Treatment of property CloudDeployment-PT-6b-LTLFireability-13 finished in 217738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p1) U p2)&&p0))))'
Support contains 4 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 1122 transition count 1934
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 1122 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 1122 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 1120 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1120 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 1120 transition count 1930
Applied a total of 45 rules in 441 ms. Remains 1120 /1142 variables (removed 22) and now considering 1930/6036 (removed 4106) transitions.
// Phase 1: matrix 1930 rows 1120 cols
[2024-05-23 13:50:17] [INFO ] Computed 18 invariants in 18 ms
[2024-05-23 13:50:17] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-23 13:50:17] [INFO ] Invariant cache hit.
[2024-05-23 13:50:19] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2024-05-23 13:50:19] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1522 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1119/1142 places, 1930/6036 transitions.
Applied a total of 0 rules in 31 ms. Remains 1119 /1119 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2000 ms. Remains : 1119/1142 places, 1930/6036 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-15 finished in 2232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p1))))'
[2024-05-23 13:50:20] [INFO ] Flatten gal took : 947 ms
[2024-05-23 13:50:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-23 13:50:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1142 places, 6036 transitions and 90224 arcs took 63 ms.
Total runtime 403291 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-6b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1142
TRANSITIONS: 6036
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.386s, Sys 0.028s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.032s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 953
MODEL NAME: /home/mcc/execution/414/model
1142 places, 6036 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-6b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is CloudDeployment-PT-6b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504900612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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