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.r091-tall-171624187900548.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 DBSingleClientW-PT-d2m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716297711182

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:21:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 13:21:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:21:52] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-21 13:21:52] [INFO ] Transformed 4763 places.
[2024-05-21 13:21:52] [INFO ] Transformed 2478 transitions.
[2024-05-21 13:21:52] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 27 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 379 places :
Symmetric choice reduction at 1 with 379 rule applications. Total rules 624 place count 758 transition count 1346
Iterating global reduction 1 with 379 rules applied. Total rules applied 1003 place count 758 transition count 1346
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 1043 place count 758 transition count 1306
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 1347 place count 454 transition count 1002
Iterating global reduction 2 with 304 rules applied. Total rules applied 1651 place count 454 transition count 1002
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1663 place count 454 transition count 990
Discarding 225 places :
Symmetric choice reduction at 3 with 225 rule applications. Total rules 1888 place count 229 transition count 672
Iterating global reduction 3 with 225 rules applied. Total rules applied 2113 place count 229 transition count 672
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Iterating post reduction 3 with 229 rules applied. Total rules applied 2342 place count 229 transition count 443
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2363 place count 208 transition count 410
Iterating global reduction 4 with 21 rules applied. Total rules applied 2384 place count 208 transition count 410
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 2409 place count 208 transition count 385
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2419 place count 198 transition count 375
Iterating global reduction 5 with 10 rules applied. Total rules applied 2429 place count 198 transition count 375
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2433 place count 198 transition count 371
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2440 place count 191 transition count 364
Iterating global reduction 6 with 7 rules applied. Total rules applied 2447 place count 191 transition count 364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2453 place count 191 transition count 358
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2454 place count 190 transition count 356
Iterating global reduction 7 with 1 rules applied. Total rules applied 2455 place count 190 transition count 356
Applied a total of 2455 rules in 189 ms. Remains 190 /1183 variables (removed 993) and now considering 356/2478 (removed 2122) transitions.
// Phase 1: matrix 356 rows 190 cols
[2024-05-21 13:21:53] [INFO ] Computed 2 invariants in 23 ms
[2024-05-21 13:21:53] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 13:21:53] [INFO ] Invariant cache hit.
[2024-05-21 13:21:53] [INFO ] State equation strengthened by 178 read => feed constraints.
[2024-05-21 13:21:54] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-05-21 13:21:54] [INFO ] Invariant cache hit.
[2024-05-21 13:21:54] [INFO ] State equation strengthened by 178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 356/546 variables, 190/192 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 178/370 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-21 13:22:04] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 16 ms to minimize.
[2024-05-21 13:22:05] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-21 13:22:05] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (OVERLAPS) 0/546 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 373 constraints, problems are : Problem set: 0 solved, 355 unsolved in 23671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (OVERLAPS) 356/546 variables, 190/195 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 178/373 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 355/728 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 728 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 3/3 constraints]
After SMT, in 54826ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 54842ms
Starting structural reductions in LTL mode, iteration 1 : 190/1183 places, 356/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56027 ms. Remains : 190/1183 places, 356/2478 transitions.
Support contains 30 out of 190 places after structural reductions.
[2024-05-21 13:22:49] [INFO ] Flatten gal took : 61 ms
[2024-05-21 13:22:49] [INFO ] Flatten gal took : 25 ms
[2024-05-21 13:22:49] [INFO ] Input system was already deterministic with 356 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (9191 resets) in 3187 ms. (12 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (183 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (367 resets) in 88 ms. (44 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (182 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (393 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (800 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (176 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (185 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (185 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (154 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (182 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (181 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (374 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (161 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (175 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (199 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (382 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (186 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (394 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (175 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (177 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (166 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (391 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
Probably explored full state space saw : 69653 states, properties seen :21
Probabilistic random walk after 178501 steps, saw 69653 distinct states, run finished after 1225 ms. (steps per millisecond=145 ) properties seen :21
Explored full state space saw : 69797 states, properties seen :0
Exhaustive walk after 178694 steps, saw 69797 distinct states, run finished after 322 ms. (steps per millisecond=554 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 28 stable transitions
Graph (complete) has 744 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-08 TRUE 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' '!((G((p0&&X(p1)))||F(G(p2))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 297
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 297
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 170 transition count 290
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 156 transition count 269
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 156 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 156 transition count 266
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 146 transition count 251
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 146 transition count 251
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 106 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 139 transition count 208
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 139 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 139 transition count 207
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 137 transition count 205
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 137 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 137 transition count 204
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 136 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 136 transition count 203
Applied a total of 128 rules in 22 ms. Remains 136 /190 variables (removed 54) and now considering 203/356 (removed 153) transitions.
// Phase 1: matrix 203 rows 136 cols
[2024-05-21 13:22:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:22:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 13:22:52] [INFO ] Invariant cache hit.
[2024-05-21 13:22:52] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 13:22:52] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-21 13:22:52] [INFO ] Invariant cache hit.
[2024-05-21 13:22:52] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:22:56] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-21 13:22:56] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:22:59] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/339 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 10758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/339 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 70/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 14868 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
After SMT, in 25965ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 25968ms
Starting structural reductions in LTL mode, iteration 1 : 136/190 places, 203/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26369 ms. Remains : 136/190 places, 203/356 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-01
Product exploration explored 100000 steps with 22923 reset in 310 ms.
Product exploration explored 100000 steps with 22943 reset in 204 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 498 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9166 resets) in 286 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1768 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1782 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1769 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3895 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 39981 steps, run visited all 4 properties in 179 ms. (steps per millisecond=223 )
Probabilistic random walk after 39981 steps, saw 17162 distinct states, run finished after 182 ms. (steps per millisecond=219 ) properties seen :4
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 229 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 203/203 transitions.
Applied a total of 0 rules in 30 ms. Remains 136 /136 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-21 13:23:20] [INFO ] Invariant cache hit.
[2024-05-21 13:23:20] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 13:23:20] [INFO ] Invariant cache hit.
[2024-05-21 13:23:20] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 13:23:21] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-21 13:23:21] [INFO ] Redundant transitions in 10 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-21 13:23:21] [INFO ] Invariant cache hit.
[2024-05-21 13:23:21] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:23:24] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 13:23:25] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:23:28] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/339 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 10933 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/339 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 70/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 15556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
After SMT, in 26831ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 26833ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27264 ms. Remains : 136/136 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 498 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9261 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1814 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1837 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1811 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3918 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 39981 steps, run visited all 4 properties in 162 ms. (steps per millisecond=246 )
Probabilistic random walk after 39981 steps, saw 17162 distinct states, run finished after 163 ms. (steps per millisecond=245 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 22948 reset in 163 ms.
Product exploration explored 100000 steps with 23052 reset in 158 ms.
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 203/203 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-21 13:23:49] [INFO ] Invariant cache hit.
[2024-05-21 13:23:49] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 13:23:49] [INFO ] Invariant cache hit.
[2024-05-21 13:23:49] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 13:23:49] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-21 13:23:49] [INFO ] Redundant transitions in 9 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-21 13:23:49] [INFO ] Invariant cache hit.
[2024-05-21 13:23:49] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:23:53] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 13:23:53] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:23:56] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/339 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 10600 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/339 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 70/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 15113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
After SMT, in 26039ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 26044ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26439 ms. Remains : 136/136 places, 203/203 transitions.
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-01 finished in 83491 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' '!(F((p0||X((F(p0) U X(G(p1)))))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 292
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 170 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 156 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 156 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 156 transition count 264
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 143 transition count 245
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 143 transition count 245
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 143 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 120 place count 134 transition count 196
Iterating global reduction 3 with 9 rules applied. Total rules applied 129 place count 134 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 134 transition count 195
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 130 transition count 191
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 130 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 130 transition count 188
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 128 transition count 186
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 128 transition count 186
Applied a total of 145 rules in 32 ms. Remains 128 /190 variables (removed 62) and now considering 186/356 (removed 170) transitions.
// Phase 1: matrix 186 rows 128 cols
[2024-05-21 13:24:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:24:15] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 13:24:15] [INFO ] Invariant cache hit.
[2024-05-21 13:24:15] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 13:24:16] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-21 13:24:16] [INFO ] Redundant transitions in 3 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 13:24:16] [INFO ] Invariant cache hit.
[2024-05-21 13:24:16] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/314 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 64/194 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 13:24:19] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 195 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/314 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 64/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 380 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 constraints]
After SMT, in 19560ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19565ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/190 places, 186/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19946 ms. Remains : 128/190 places, 186/356 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-02 finished in 20011 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(F(p0)))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 294
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 50 place count 169 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 155 transition count 265
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 155 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 155 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 143 transition count 244
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 143 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 143 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 123 place count 134 transition count 189
Iterating global reduction 3 with 9 rules applied. Total rules applied 132 place count 134 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 134 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 136 place count 131 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 131 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 131 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 142 place count 129 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 129 transition count 182
Applied a total of 144 rules in 31 ms. Remains 129 /190 variables (removed 61) and now considering 182/356 (removed 174) transitions.
// Phase 1: matrix 182 rows 129 cols
[2024-05-21 13:24:35] [INFO ] Computed 2 invariants in 18 ms
[2024-05-21 13:24:35] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 13:24:35] [INFO ] Invariant cache hit.
[2024-05-21 13:24:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:24:36] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-21 13:24:36] [INFO ] Redundant transitions in 3 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 13:24:36] [INFO ] Invariant cache hit.
[2024-05-21 13:24:36] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 4968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 12112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 17336ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 17339ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/190 places, 182/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17734 ms. Remains : 129/190 places, 182/356 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-04 finished in 17830 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(p0)||G((p1&&X(X(p2))))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 172 transition count 301
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 172 transition count 301
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 172 transition count 293
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 160 transition count 274
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 160 transition count 274
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 160 transition count 269
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 150 transition count 255
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 150 transition count 255
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 99 place count 150 transition count 249
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 144 transition count 218
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 144 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 144 transition count 217
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 142 transition count 215
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 142 transition count 215
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 140 transition count 213
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 140 transition count 213
Applied a total of 120 rules in 10 ms. Remains 140 /190 variables (removed 50) and now considering 213/356 (removed 143) transitions.
// Phase 1: matrix 213 rows 140 cols
[2024-05-21 13:24:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:24:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 13:24:53] [INFO ] Invariant cache hit.
[2024-05-21 13:24:53] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 13:24:54] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-21 13:24:54] [INFO ] Invariant cache hit.
[2024-05-21 13:24:54] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/353 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 80/222 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 13:24:58] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-21 13:24:58] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-21 13:24:58] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 225 constraints, problems are : Problem set: 0 solved, 212 unsolved in 9185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/353 variables, 140/145 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 80/225 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 212/437 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 437 constraints, problems are : Problem set: 0 solved, 212 unsolved in 14913 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 3/3 constraints]
After SMT, in 24387ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 24389ms
Starting structural reductions in LTL mode, iteration 1 : 140/190 places, 213/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24829 ms. Remains : 140/190 places, 213/356 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-06
Product exploration explored 100000 steps with 22985 reset in 167 ms.
Product exploration explored 100000 steps with 22954 reset in 177 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 514 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (9263 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1804 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1821 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 22335 steps, run visited all 3 properties in 59 ms. (steps per millisecond=378 )
Probabilistic random walk after 22335 steps, saw 10276 distinct states, run finished after 59 ms. (steps per millisecond=378 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-06 finished in 25938 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' '!(F(G(p0)))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 290
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 169 transition count 284
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 154 transition count 262
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 154 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 81 place count 154 transition count 259
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 141 transition count 240
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 141 transition count 240
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 116 place count 141 transition count 231
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 124 place count 133 transition count 191
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 133 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 133 transition count 190
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 136 place count 130 transition count 187
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 130 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 130 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 128 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 128 transition count 183
Applied a total of 145 rules in 23 ms. Remains 128 /190 variables (removed 62) and now considering 183/356 (removed 173) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 13:25:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:25:19] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 13:25:19] [INFO ] Invariant cache hit.
[2024-05-21 13:25:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 13:25:20] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-21 13:25:20] [INFO ] Redundant transitions in 13 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 13:25:20] [INFO ] Invariant cache hit.
[2024-05-21 13:25:20] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 191 constraints, problems are : Problem set: 0 solved, 182 unsolved in 5641 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 373 constraints, problems are : Problem set: 0 solved, 182 unsolved in 11913 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 17808ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 17811ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/190 places, 183/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18343 ms. Remains : 128/190 places, 183/356 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-07 finished in 18393 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(p0))&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 292
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 170 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 157 transition count 267
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 157 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 157 transition count 266
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 145 transition count 248
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 145 transition count 248
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 145 transition count 239
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 115 place count 137 transition count 199
Iterating global reduction 3 with 8 rules applied. Total rules applied 123 place count 137 transition count 199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 133 transition count 195
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 133 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 134 place count 133 transition count 192
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 131 transition count 190
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 131 transition count 190
Applied a total of 138 rules in 13 ms. Remains 131 /190 variables (removed 59) and now considering 190/356 (removed 166) transitions.
// Phase 1: matrix 190 rows 131 cols
[2024-05-21 13:25:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:25:38] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 13:25:38] [INFO ] Invariant cache hit.
[2024-05-21 13:25:38] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 13:25:38] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-21 13:25:38] [INFO ] Invariant cache hit.
[2024-05-21 13:25:38] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/321 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 64/197 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-21 13:25:41] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-21 13:25:42] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 199 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/321 variables, 131/135 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 189/388 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 0/321 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 388 constraints, problems are : Problem set: 0 solved, 189 unsolved in 13336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 2/2 constraints]
After SMT, in 20876ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 20877ms
Starting structural reductions in LTL mode, iteration 1 : 131/190 places, 190/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21399 ms. Remains : 131/190 places, 190/356 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Product exploration explored 100000 steps with 33333 reset in 189 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 476 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-09 finished in 21987 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' '!(F(((p1||X(p2))&&p0)))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 171 transition count 302
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 171 transition count 302
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 171 transition count 294
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 159 transition count 275
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 159 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 159 transition count 271
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 149 transition count 256
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 149 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 149 transition count 251
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 104 place count 144 transition count 229
Iterating global reduction 3 with 5 rules applied. Total rules applied 109 place count 144 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 144 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 142 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 142 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 142 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 141 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 141 transition count 223
Applied a total of 118 rules in 10 ms. Remains 141 /190 variables (removed 49) and now considering 223/356 (removed 133) transitions.
// Phase 1: matrix 223 rows 141 cols
[2024-05-21 13:25:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:26:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 13:26:00] [INFO ] Invariant cache hit.
[2024-05-21 13:26:00] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 13:26:00] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-21 13:26:00] [INFO ] Invariant cache hit.
[2024-05-21 13:26:00] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/364 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 90/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 13:26:05] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-21 13:26:05] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 13:26:05] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 13:26:08] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 13:26:08] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 238 constraints, problems are : Problem set: 0 solved, 222 unsolved in 13408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/364 variables, 141/148 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 90/238 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 222/460 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 460 constraints, problems are : Problem set: 0 solved, 222 unsolved in 17955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 5/5 constraints]
After SMT, in 31919ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 31923ms
Starting structural reductions in LTL mode, iteration 1 : 141/190 places, 223/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32760 ms. Remains : 141/190 places, 223/356 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-10 finished in 32859 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(F(p0))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 299
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 299
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 170 transition count 292
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 156 transition count 271
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 156 transition count 271
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 156 transition count 268
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 90 place count 144 transition count 251
Iterating global reduction 2 with 12 rules applied. Total rules applied 102 place count 144 transition count 251
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 112 place count 144 transition count 241
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 122 place count 134 transition count 193
Iterating global reduction 3 with 10 rules applied. Total rules applied 132 place count 134 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 134 transition count 192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 137 place count 130 transition count 188
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 130 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 144 place count 130 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 146 place count 128 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 128 transition count 183
Applied a total of 148 rules in 9 ms. Remains 128 /190 variables (removed 62) and now considering 183/356 (removed 173) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 13:26:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:26:33] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-21 13:26:33] [INFO ] Invariant cache hit.
[2024-05-21 13:26:33] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 13:26:33] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-21 13:26:33] [INFO ] Invariant cache hit.
[2024-05-21 13:26:33] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 13:26:36] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-21 13:26:36] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-05-21 13:26:36] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 195 constraints, problems are : Problem set: 0 solved, 182 unsolved in 7099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/311 variables, 128/133 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 182/377 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 377 constraints, problems are : Problem set: 0 solved, 182 unsolved in 10927 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 3/3 constraints]
After SMT, in 18309ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 18311ms
Starting structural reductions in LTL mode, iteration 1 : 128/190 places, 183/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18833 ms. Remains : 128/190 places, 183/356 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-11 finished in 18970 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 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 294
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 50 place count 169 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 155 transition count 265
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 155 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 155 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 143 transition count 244
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 143 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 143 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 123 place count 134 transition count 189
Iterating global reduction 3 with 9 rules applied. Total rules applied 132 place count 134 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 134 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 136 place count 131 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 131 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 131 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 142 place count 129 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 129 transition count 182
Applied a total of 144 rules in 16 ms. Remains 129 /190 variables (removed 61) and now considering 182/356 (removed 174) transitions.
// Phase 1: matrix 182 rows 129 cols
[2024-05-21 13:26:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:26:51] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 13:26:51] [INFO ] Invariant cache hit.
[2024-05-21 13:26:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:26:52] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-21 13:26:52] [INFO ] Invariant cache hit.
[2024-05-21 13:26:52] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 4808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 12168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 17224ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 17226ms
Starting structural reductions in LTL mode, iteration 1 : 129/190 places, 182/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17545 ms. Remains : 129/190 places, 182/356 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-12 finished in 17640 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((F(p0)&&F(G(p1)))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 290
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 290
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 169 transition count 283
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 155 transition count 262
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 155 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 155 transition count 259
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 92 place count 143 transition count 242
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 143 transition count 242
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 143 transition count 234
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 121 place count 134 transition count 193
Iterating global reduction 3 with 9 rules applied. Total rules applied 130 place count 134 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 134 transition count 192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 135 place count 130 transition count 188
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 130 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 142 place count 130 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 144 place count 128 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 128 transition count 183
Applied a total of 146 rules in 29 ms. Remains 128 /190 variables (removed 62) and now considering 183/356 (removed 173) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 13:27:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:27:09] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 13:27:09] [INFO ] Invariant cache hit.
[2024-05-21 13:27:09] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 13:27:09] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-21 13:27:09] [INFO ] Redundant transitions in 0 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 13:27:09] [INFO ] Invariant cache hit.
[2024-05-21 13:27:09] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 13:27:13] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 192 constraints, problems are : Problem set: 0 solved, 182 unsolved in 6447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/311 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 182/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 374 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 1/1 constraints]
After SMT, in 18746ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 18749ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/190 places, 183/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19207 ms. Remains : 128/190 places, 183/356 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-14 finished in 19360 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(F((!p0&&X((X(F(p1))||G(!p0)))))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 292
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 170 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 156 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 156 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 156 transition count 264
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 88 place count 144 transition count 246
Iterating global reduction 2 with 12 rules applied. Total rules applied 100 place count 144 transition count 246
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 144 transition count 237
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 117 place count 136 transition count 198
Iterating global reduction 3 with 8 rules applied. Total rules applied 125 place count 136 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 132 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 132 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 132 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 130 transition count 189
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 130 transition count 189
Applied a total of 140 rules in 25 ms. Remains 130 /190 variables (removed 60) and now considering 189/356 (removed 167) transitions.
// Phase 1: matrix 189 rows 130 cols
[2024-05-21 13:27:28] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 13:27:28] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 13:27:28] [INFO ] Invariant cache hit.
[2024-05-21 13:27:28] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 13:27:29] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-21 13:27:29] [INFO ] Redundant transitions in 0 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-21 13:27:29] [INFO ] Invariant cache hit.
[2024-05-21 13:27:29] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 195 constraints, problems are : Problem set: 0 solved, 188 unsolved in 6176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 188/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 383 constraints, problems are : Problem set: 0 solved, 188 unsolved in 12211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 18672ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 18675ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/190 places, 189/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19033 ms. Remains : 130/190 places, 189/356 transitions.
Stuttering acceptance computed with spot in 210 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-15
Product exploration explored 100000 steps with 23001 reset in 151 ms.
Product exploration explored 100000 steps with 22949 reset in 157 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 9 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 374 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (9130 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1811 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1822 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1770 resets) in 268 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3816 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1742 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3794 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
Probably explored full state space saw : 28484 states, properties seen :5
Probabilistic random walk after 69033 steps, saw 28484 distinct states, run finished after 318 ms. (steps per millisecond=217 ) properties seen :5
Explored full state space saw : 28567 states, properties seen :0
Exhaustive walk after 69167 steps, saw 28567 distinct states, run finished after 98 ms. (steps per millisecond=705 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 9 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 269 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 189/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-21 13:27:50] [INFO ] Invariant cache hit.
[2024-05-21 13:27:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 13:27:50] [INFO ] Invariant cache hit.
[2024-05-21 13:27:50] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 13:27:50] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-21 13:27:50] [INFO ] Redundant transitions in 0 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-21 13:27:50] [INFO ] Invariant cache hit.
[2024-05-21 13:27:50] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 195 constraints, problems are : Problem set: 0 solved, 188 unsolved in 6106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 188/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 383 constraints, problems are : Problem set: 0 solved, 188 unsolved in 12448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 18823ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 18825ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19140 ms. Remains : 130/130 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (OR p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 141 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 345 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9249 resets) in 196 ms. (203 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1762 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1787 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1818 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
[2024-05-21 13:28:10] [INFO ] Invariant cache hit.
[2024-05-21 13:28:10] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/225 variables, 88/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 11/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 88/313 variables, 39/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 49/189 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/319 variables, 3/192 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 3/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/319 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 195 constraints, problems are : Problem set: 1 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/225 variables, 88/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 11/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 88/313 variables, 39/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 49/189 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 2/191 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/319 variables, 3/194 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 3/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/319 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 197 constraints, problems are : Problem set: 1 solved, 2 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 521ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 111 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 189/189 transitions.
Graph (complete) has 444 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 129 transition count 186
Applied a total of 4 rules in 13 ms. Remains 129 /130 variables (removed 1) and now considering 186/189 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 129/130 places, 186/189 transitions.
RANDOM walk for 40000 steps (9229 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1833 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 26001 steps, run visited all 2 properties in 151 ms. (steps per millisecond=172 )
Probabilistic random walk after 26001 steps, saw 11750 distinct states, run finished after 152 ms. (steps per millisecond=171 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (OR p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 342 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 338 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 396 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 329 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22944 reset in 159 ms.
Product exploration explored 100000 steps with 23044 reset in 158 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 189/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-21 13:28:12] [INFO ] Invariant cache hit.
[2024-05-21 13:28:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 13:28:13] [INFO ] Invariant cache hit.
[2024-05-21 13:28:13] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 13:28:13] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-21 13:28:13] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-21 13:28:13] [INFO ] Invariant cache hit.
[2024-05-21 13:28:13] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 195 constraints, problems are : Problem set: 0 solved, 188 unsolved in 6343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 188/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 383 constraints, problems are : Problem set: 0 solved, 188 unsolved in 12047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 18654ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 18656ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18977 ms. Remains : 130/130 places, 189/189 transitions.
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-15 finished in 63163 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&&X(p1)))||F(G(p2))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m04-LTLFireability-01
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 297
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 297
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 170 transition count 290
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 156 transition count 269
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 156 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 156 transition count 266
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 146 transition count 251
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 146 transition count 251
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 106 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 139 transition count 208
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 139 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 139 transition count 207
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 137 transition count 205
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 137 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 137 transition count 204
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 136 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 136 transition count 203
Applied a total of 128 rules in 23 ms. Remains 136 /190 variables (removed 54) and now considering 203/356 (removed 153) transitions.
// Phase 1: matrix 203 rows 136 cols
[2024-05-21 13:28:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:28:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 13:28:32] [INFO ] Invariant cache hit.
[2024-05-21 13:28:32] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 13:28:32] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-21 13:28:32] [INFO ] Invariant cache hit.
[2024-05-21 13:28:32] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:28:36] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 13:28:36] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:28:39] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/339 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 10624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/339 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 70/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 14617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
After SMT, in 25534ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 25536ms
Starting structural reductions in LI_LTL mode, iteration 1 : 136/190 places, 203/356 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 25914 ms. Remains : 136/190 places, 203/356 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-01
Product exploration explored 100000 steps with 23074 reset in 152 ms.
Product exploration explored 100000 steps with 23011 reset in 185 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 498 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 140 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9153 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1767 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1821 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1832 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3788 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 39981 steps, run visited all 4 properties in 235 ms. (steps per millisecond=170 )
Probabilistic random walk after 39981 steps, saw 17162 distinct states, run finished after 235 ms. (steps per millisecond=170 ) properties seen :4
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 291 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 203/203 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-21 13:28:59] [INFO ] Invariant cache hit.
[2024-05-21 13:28:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 13:28:59] [INFO ] Invariant cache hit.
[2024-05-21 13:28:59] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 13:29:00] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-21 13:29:00] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-21 13:29:00] [INFO ] Invariant cache hit.
[2024-05-21 13:29:00] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:29:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 13:29:04] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:29:07] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/339 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 10610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/339 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 70/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 15211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
After SMT, in 26147ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 26150ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26530 ms. Remains : 136/136 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 498 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9198 resets) in 454 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1779 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1857 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1741 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3866 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 39981 steps, run visited all 4 properties in 188 ms. (steps per millisecond=212 )
Probabilistic random walk after 39981 steps, saw 17162 distinct states, run finished after 188 ms. (steps per millisecond=212 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 23034 reset in 165 ms.
Product exploration explored 100000 steps with 22990 reset in 175 ms.
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 136 /136 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-21 13:29:28] [INFO ] Invariant cache hit.
[2024-05-21 13:29:28] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 13:29:28] [INFO ] Invariant cache hit.
[2024-05-21 13:29:28] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 13:29:28] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-21 13:29:28] [INFO ] Redundant transitions in 0 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-21 13:29:28] [INFO ] Invariant cache hit.
[2024-05-21 13:29:28] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/339 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:29:31] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 13:29:32] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 13:29:35] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/339 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 211 constraints, problems are : Problem set: 0 solved, 202 unsolved in 10632 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/339 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 70/211 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 202/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 14524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints]
After SMT, in 25448ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 25451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25831 ms. Remains : 136/136 places, 203/203 transitions.
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-01 finished in 81960 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(F((!p0&&X((X(F(p1))||G(!p0)))))))'
[2024-05-21 13:29:54] [INFO ] Flatten gal took : 29 ms
[2024-05-21 13:29:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 13:29:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 190 places, 356 transitions and 1401 arcs took 8 ms.
Total runtime 481711 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d2m04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 190
TRANSITIONS: 356
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.003s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
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: 1663
MODEL NAME: /home/mcc/execution/411/model
190 places, 356 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.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716298207245

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DBSingleClientW-PT-d2m04"
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 DBSingleClientW-PT-d2m04, 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 r091-tall-171624187900548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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