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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 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 432K 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-d1m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716296221150

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-d1m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:57:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 12:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:57:02] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-21 12:57:02] [INFO ] Transformed 1440 places.
[2024-05-21 12:57:02] [INFO ] Transformed 672 transitions.
[2024-05-21 12:57:02] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 179 place count 248 transition count 419
Iterating global reduction 1 with 78 rules applied. Total rules applied 257 place count 248 transition count 419
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 272 place count 248 transition count 404
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 329 place count 191 transition count 347
Iterating global reduction 2 with 57 rules applied. Total rules applied 386 place count 191 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 387 place count 191 transition count 346
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 417 place count 161 transition count 302
Iterating global reduction 3 with 30 rules applied. Total rules applied 447 place count 161 transition count 302
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 472 place count 161 transition count 277
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 476 place count 157 transition count 270
Iterating global reduction 4 with 4 rules applied. Total rules applied 480 place count 157 transition count 270
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 483 place count 154 transition count 267
Iterating global reduction 4 with 3 rules applied. Total rules applied 486 place count 154 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 489 place count 151 transition count 264
Iterating global reduction 4 with 3 rules applied. Total rules applied 492 place count 151 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 494 place count 151 transition count 262
Applied a total of 494 rules in 79 ms. Remains 151 /347 variables (removed 196) and now considering 262/672 (removed 410) transitions.
// Phase 1: matrix 262 rows 151 cols
[2024-05-21 12:57:02] [INFO ] Computed 2 invariants in 19 ms
[2024-05-21 12:57:03] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 12:57:03] [INFO ] Invariant cache hit.
[2024-05-21 12:57:03] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-05-21 12:57:03] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-21 12:57:03] [INFO ] Invariant cache hit.
[2024-05-21 12:57:03] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/413 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 128/281 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 281 constraints, problems are : Problem set: 0 solved, 261 unsolved in 9236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/413 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 128/281 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 261/542 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 0/413 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 542 constraints, problems are : Problem set: 0 solved, 261 unsolved in 25932 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
After SMT, in 35783ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 35809ms
Starting structural reductions in LTL mode, iteration 1 : 151/347 places, 262/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36550 ms. Remains : 151/347 places, 262/672 transitions.
Support contains 40 out of 151 places after structural reductions.
[2024-05-21 12:57:39] [INFO ] Flatten gal took : 51 ms
[2024-05-21 12:57:39] [INFO ] Flatten gal took : 20 ms
[2024-05-21 12:57:39] [INFO ] Input system was already deterministic with 262 transitions.
Reduction of identical properties reduced properties to check from 36 to 33
RANDOM walk for 40000 steps (9241 resets) in 2619 ms. (15 steps per ms) remains 30/33 properties
BEST_FIRST walk for 4004 steps (181 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (406 resets) in 72 ms. (54 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (206 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (200 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (170 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (195 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (185 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (195 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (424 resets) in 17 ms. (222 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (201 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (397 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (175 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (182 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (390 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (170 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (412 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (197 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (177 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (183 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (800 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (181 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (366 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (176 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (193 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (194 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (209 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (178 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (399 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (186 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (384 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
[2024-05-21 12:57:40] [INFO ] Invariant cache hit.
[2024-05-21 12:57:40] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 47/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 33/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 225/340 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 29 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 91/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 8 (OVERLAPS) 73/413 variables, 36/244 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 37/281 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 0/413 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 281 constraints, problems are : Problem set: 1 solved, 28 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 47/81 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 33/114 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 223/337 variables, 114/116 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 89/205 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-21 12:57:42] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 1/206 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 76/413 variables, 37/243 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 39/282 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 28/310 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/413 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 310 constraints, problems are : Problem set: 1 solved, 28 unsolved in 3220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 28/29 constraints, Known Traps: 1/1 constraints]
After SMT, in 4996ms problems are : Problem set: 1 solved, 28 unsolved
Fused 28 Parikh solutions to 23 different solutions.
Parikh walk visited 6 properties in 1782 ms.
Support contains 28 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 245
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 245
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 143 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 143 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 142 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 142 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 142 transition count 237
Applied a total of 21 rules in 34 ms. Remains 142 /151 variables (removed 9) and now considering 237/262 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 142/151 places, 237/262 transitions.
RANDOM walk for 40000 steps (9102 resets) in 447 ms. (89 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (192 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (183 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (180 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (178 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (176 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (186 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (376 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (191 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (188 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (376 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (191 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (408 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (178 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (198 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (800 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (186 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (407 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (175 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (190 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (192 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (186 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (388 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
Finished probabilistic random walk after 168538 steps, run visited all 22 properties in 662 ms. (steps per millisecond=254 )
Probabilistic random walk after 168538 steps, saw 66215 distinct states, run finished after 665 ms. (steps per millisecond=253 ) properties seen :22
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 25 stable transitions
Graph (complete) has 561 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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((F(p1)||p0))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 192
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 128 transition count 189
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 114 transition count 172
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 114 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 114 transition count 168
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 104 transition count 150
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 104 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 104 transition count 147
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 111 place count 97 transition count 130
Iterating global reduction 3 with 7 rules applied. Total rules applied 118 place count 97 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 97 transition count 128
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 94 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 94 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 94 transition count 123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 92 transition count 121
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 92 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 91 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 91 transition count 119
Applied a total of 134 rules in 26 ms. Remains 91 /151 variables (removed 60) and now considering 119/262 (removed 143) transitions.
// Phase 1: matrix 119 rows 91 cols
[2024-05-21 12:57:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 12:57:49] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 12:57:49] [INFO ] Invariant cache hit.
[2024-05-21 12:57:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 12:57:49] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-21 12:57:49] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-21 12:57:49] [INFO ] Invariant cache hit.
[2024-05-21 12:57:49] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/210 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-21 12:57:50] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-21 12:57:51] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/210 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 136 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 119/210 variables, 91/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 118/254 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 254 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5173 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 9477ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 9480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/151 places, 119/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9709 ms. Remains : 91/151 places, 119/262 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-00
Product exploration explored 100000 steps with 22845 reset in 244 ms.
Product exploration explored 100000 steps with 23179 reset in 177 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 312 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9168 resets) in 596 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3946 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1909 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1945 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3887 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2617522 steps, run timeout after 3001 ms. (steps per millisecond=872 ) properties seen :3 out of 4
Probabilistic random walk after 2617522 steps, saw 994656 distinct states, run finished after 3004 ms. (steps per millisecond=871 ) properties seen :3
[2024-05-21 12:58:03] [INFO ] Invariant cache hit.
[2024-05-21 12:58:03] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 37/210 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/91 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-00 finished in 14064 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' '!((!p0 U X(X(((X(p2) U p3)&&p1)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 202
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 130 transition count 199
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 117 transition count 183
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 117 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 117 transition count 181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 108 transition count 164
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 108 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 108 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 103 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 103 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 103 transition count 146
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 109 place count 100 transition count 143
Iterating global reduction 4 with 3 rules applied. Total rules applied 112 place count 100 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 100 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 98 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 98 transition count 139
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 97 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 97 transition count 137
Applied a total of 120 rules in 17 ms. Remains 97 /151 variables (removed 54) and now considering 137/262 (removed 125) transitions.
// Phase 1: matrix 137 rows 97 cols
[2024-05-21 12:58:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 12:58:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 12:58:03] [INFO ] Invariant cache hit.
[2024-05-21 12:58:03] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 12:58:03] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 12:58:03] [INFO ] Invariant cache hit.
[2024-05-21 12:58:03] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/234 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 12:58:05] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 12:58:05] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-21 12:58:05] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/234 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 156 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3971 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/234 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 54/156 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 136/292 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 292 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6082 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 3/3 constraints]
After SMT, in 10188ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 10190ms
Starting structural reductions in LTL mode, iteration 1 : 97/151 places, 137/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10407 ms. Remains : 97/151 places, 137/262 transitions.
Stuttering acceptance computed with spot in 503 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p1)), true, (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-01 finished in 10932 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(p1)||X(X(G(p2)))||p0)))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 197
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 129 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 115 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 115 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 81 place count 115 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 105 transition count 153
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 105 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 105 transition count 150
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 111 place count 98 transition count 135
Iterating global reduction 3 with 7 rules applied. Total rules applied 118 place count 98 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 123 place count 98 transition count 130
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 96 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 96 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 95 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 94 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 94 transition count 123
Applied a total of 133 rules in 18 ms. Remains 94 /151 variables (removed 57) and now considering 123/262 (removed 139) transitions.
// Phase 1: matrix 123 rows 94 cols
[2024-05-21 12:58:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 12:58:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 12:58:14] [INFO ] Invariant cache hit.
[2024-05-21 12:58:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 12:58:14] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-21 12:58:14] [INFO ] Invariant cache hit.
[2024-05-21 12:58:14] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/217 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/217 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8459ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8461ms
Starting structural reductions in LTL mode, iteration 1 : 94/151 places, 123/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8691 ms. Remains : 94/151 places, 123/262 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-02 finished in 9341 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(X((X(X(G(p0)))||G(p1))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 193
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 129 transition count 190
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 114 transition count 172
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 114 transition count 172
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 114 transition count 167
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 103 transition count 148
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 103 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 103 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 96 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 126 place count 96 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 93 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 93 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 93 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 91 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 90 transition count 118
Applied a total of 140 rules in 8 ms. Remains 90 /151 variables (removed 61) and now considering 118/262 (removed 144) transitions.
// Phase 1: matrix 118 rows 90 cols
[2024-05-21 12:58:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 12:58:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 12:58:23] [INFO ] Invariant cache hit.
[2024-05-21 12:58:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 12:58:23] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 12:58:23] [INFO ] Invariant cache hit.
[2024-05-21 12:58:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6972ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6974ms
Starting structural reductions in LTL mode, iteration 1 : 90/151 places, 118/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7161 ms. Remains : 90/151 places, 118/262 transitions.
Stuttering acceptance computed with spot in 425 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-04
Product exploration explored 100000 steps with 22841 reset in 126 ms.
Product exploration explored 100000 steps with 22959 reset in 119 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9231 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1914 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1834 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1932 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1946 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1892 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1905 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2613949 steps, run timeout after 3001 ms. (steps per millisecond=871 ) properties seen :5 out of 6
Probabilistic random walk after 2613949 steps, saw 1007436 distinct states, run finished after 3001 ms. (steps per millisecond=871 ) properties seen :5
[2024-05-21 12:58:35] [INFO ] Invariant cache hit.
[2024-05-21 12:58:35] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/149 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 1 solved, 0 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 11/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 12:58:36] [INFO ] Invariant cache hit.
[2024-05-21 12:58:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 12:58:36] [INFO ] Invariant cache hit.
[2024-05-21 12:58:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 12:58:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 12:58:36] [INFO ] Invariant cache hit.
[2024-05-21 12:58:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4425 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6919ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6920ms
Finished structural reductions in LTL mode , in 1 iterations and 7114 ms. Remains : 90/90 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9179 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1893 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21241 steps, run visited all 3 properties in 64 ms. (steps per millisecond=331 )
Probabilistic random walk after 21241 steps, saw 10079 distinct states, run finished after 65 ms. (steps per millisecond=326 ) properties seen :3
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 337 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 380 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22915 reset in 104 ms.
Product exploration explored 100000 steps with 22939 reset in 113 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 401 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 9 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 12:58:45] [INFO ] Redundant transitions in 2 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-21 12:58:45] [INFO ] Invariant cache hit.
[2024-05-21 12:58:45] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6919ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6920ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6937 ms. Remains : 90/90 places, 118/118 transitions.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 12:58:52] [INFO ] Invariant cache hit.
[2024-05-21 12:58:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 12:58:52] [INFO ] Invariant cache hit.
[2024-05-21 12:58:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 12:58:53] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 12:58:53] [INFO ] Invariant cache hit.
[2024-05-21 12:58:53] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7020ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7022ms
Finished structural reductions in LTL mode , in 1 iterations and 7226 ms. Remains : 90/90 places, 118/118 transitions.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-04 finished in 36804 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)||F(G(p1))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 130 transition count 194
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 117 transition count 181
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 117 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 117 transition count 176
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 86 place count 108 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 95 place count 108 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 98 place count 108 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 102 transition count 142
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 102 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 114 place count 102 transition count 138
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 116 place count 100 transition count 136
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 100 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 100 transition count 134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 99 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 99 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 98 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 98 transition count 131
Applied a total of 124 rules in 28 ms. Remains 98 /151 variables (removed 53) and now considering 131/262 (removed 131) transitions.
// Phase 1: matrix 131 rows 98 cols
[2024-05-21 12:59:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 12:59:00] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 12:59:00] [INFO ] Invariant cache hit.
[2024-05-21 12:59:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:59:00] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-21 12:59:00] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-21 12:59:00] [INFO ] Invariant cache hit.
[2024-05-21 12:59:00] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/229 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 43/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 143 constraints, problems are : Problem set: 0 solved, 130 unsolved in 2465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/229 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 43/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 130/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 273 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 8211ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 8213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/151 places, 131/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8457 ms. Remains : 98/151 places, 131/262 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-05
Product exploration explored 100000 steps with 23028 reset in 221 ms.
Product exploration explored 100000 steps with 23022 reset in 196 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 338 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
RANDOM walk for 40000 steps (9216 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1858 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20881 steps, run visited all 1 properties in 29 ms. (steps per millisecond=720 )
Probabilistic random walk after 20881 steps, saw 9429 distinct states, run finished after 29 ms. (steps per millisecond=720 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 131/131 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-21 12:59:09] [INFO ] Invariant cache hit.
[2024-05-21 12:59:09] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 12:59:09] [INFO ] Invariant cache hit.
[2024-05-21 12:59:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:59:09] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-21 12:59:09] [INFO ] Redundant transitions in 8 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-21 12:59:09] [INFO ] Invariant cache hit.
[2024-05-21 12:59:09] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/229 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 43/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 143 constraints, problems are : Problem set: 0 solved, 130 unsolved in 2493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/229 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 43/143 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 130/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 273 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5345 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 7992ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 7994ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8230 ms. Remains : 98/98 places, 131/131 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 338 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
RANDOM walk for 40000 steps (9229 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20881 steps, run visited all 1 properties in 31 ms. (steps per millisecond=673 )
Probabilistic random walk after 20881 steps, saw 9429 distinct states, run finished after 31 ms. (steps per millisecond=673 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 22998 reset in 143 ms.
Product exploration explored 100000 steps with 23020 reset in 149 ms.
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 131/131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 96 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 95 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 94 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 94 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 94 transition count 123
Applied a total of 9 rules in 9 ms. Remains 94 /98 variables (removed 4) and now considering 123/131 (removed 8) transitions.
// Phase 1: matrix 123 rows 94 cols
[2024-05-21 12:59:18] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 12:59:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 12:59:18] [INFO ] Invariant cache hit.
[2024-05-21 12:59:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 12:59:18] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 12:59:18] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-21 12:59:18] [INFO ] Invariant cache hit.
[2024-05-21 12:59:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/217 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/217 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8206ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/98 places, 123/131 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8430 ms. Remains : 94/98 places, 123/131 transitions.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-05 finished in 26897 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) U G(!p1)))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 128 transition count 185
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 113 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 113 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 84 place count 113 transition count 165
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 103 transition count 147
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 103 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 108 place count 103 transition count 143
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 97 transition count 127
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 97 transition count 127
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 97 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 93 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 93 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 93 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 134 place count 90 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 137 place count 90 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 139 place count 89 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 140 place count 89 transition count 114
Applied a total of 140 rules in 23 ms. Remains 89 /151 variables (removed 62) and now considering 114/262 (removed 148) transitions.
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 12:59:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 12:59:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 12:59:27] [INFO ] Invariant cache hit.
[2024-05-21 12:59:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 12:59:27] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-21 12:59:27] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-21 12:59:27] [INFO ] Invariant cache hit.
[2024-05-21 12:59:27] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 126 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 239 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4846 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 6950ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6951ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/151 places, 114/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7180 ms. Remains : 89/151 places, 114/262 transitions.
Stuttering acceptance computed with spot in 83 ms :[p1, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-06
Product exploration explored 100000 steps with 22945 reset in 121 ms.
Product exploration explored 100000 steps with 23006 reset in 125 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[p1, (NOT p0)]
RANDOM walk for 40000 steps (9210 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1837 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1934 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3883 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 19969 steps, run visited all 3 properties in 68 ms. (steps per millisecond=293 )
Probabilistic random walk after 19969 steps, saw 9139 distinct states, run finished after 68 ms. (steps per millisecond=293 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[p1, (NOT p0)]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 114/114 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-21 12:59:35] [INFO ] Invariant cache hit.
[2024-05-21 12:59:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 12:59:35] [INFO ] Invariant cache hit.
[2024-05-21 12:59:35] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 12:59:35] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-21 12:59:35] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-21 12:59:35] [INFO ] Invariant cache hit.
[2024-05-21 12:59:35] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 126 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 239 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 7083ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7085ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7291 ms. Remains : 89/89 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 80 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p1, (NOT p0)]
RANDOM walk for 40000 steps (9101 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1846 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1892 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3909 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 19969 steps, run visited all 3 properties in 46 ms. (steps per millisecond=434 )
Probabilistic random walk after 19969 steps, saw 9139 distinct states, run finished after 46 ms. (steps per millisecond=434 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[p1, (NOT p0)]
Product exploration explored 100000 steps with 23145 reset in 118 ms.
Product exploration explored 100000 steps with 23063 reset in 122 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 114/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-21 12:59:43] [INFO ] Invariant cache hit.
[2024-05-21 12:59:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 12:59:43] [INFO ] Invariant cache hit.
[2024-05-21 12:59:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 12:59:43] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-21 12:59:43] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-21 12:59:43] [INFO ] Invariant cache hit.
[2024-05-21 12:59:43] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 126 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 239 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4936 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 7074ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7075ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7290 ms. Remains : 89/89 places, 114/114 transitions.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-06 finished in 23816 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 U p1) U p2))&&(X(p0)||G(p3))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 130 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 116 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 116 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 116 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 106 transition count 155
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 106 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 106 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 100 transition count 137
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 100 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 100 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 98 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 98 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 122 place count 96 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 96 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 95 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 95 transition count 127
Applied a total of 127 rules in 7 ms. Remains 95 /151 variables (removed 56) and now considering 127/262 (removed 135) transitions.
// Phase 1: matrix 127 rows 95 cols
[2024-05-21 12:59:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 12:59:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 12:59:50] [INFO ] Invariant cache hit.
[2024-05-21 12:59:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:59:51] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-21 12:59:51] [INFO ] Invariant cache hit.
[2024-05-21 12:59:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/222 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 43/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 12:59:53] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 12:59:53] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/222 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 12:59:54] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 12:59:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 144 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/222 variables, 95/101 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 43/144 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 126/270 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 270 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5580 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints]
After SMT, in 10851ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10853ms
Starting structural reductions in LTL mode, iteration 1 : 95/151 places, 127/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11058 ms. Remains : 95/151 places, 127/262 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), true, p1, (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-07 finished in 11376 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 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 192
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 128 transition count 188
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 65 place count 113 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 80 place count 113 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 85 place count 113 transition count 165
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 102 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 102 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 102 transition count 143
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 94 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 94 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 131 place count 94 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 91 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 91 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 141 place count 89 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 88 transition count 110
Applied a total of 145 rules in 18 ms. Remains 88 /151 variables (removed 63) and now considering 110/262 (removed 152) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 13:00:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:00:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 13:00:02] [INFO ] Invariant cache hit.
[2024-05-21 13:00:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 13:00:02] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-21 13:00:02] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 13:00:02] [INFO ] Invariant cache hit.
[2024-05-21 13:00:02] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3855 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 5898ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 5900ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/151 places, 110/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6119 ms. Remains : 88/151 places, 110/262 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-10 finished in 6216 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(F(!p1))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 197
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 129 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 115 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 115 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 115 transition count 172
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 105 transition count 154
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 105 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 105 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 98 transition count 134
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 98 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 98 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 95 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 95 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 95 transition count 126
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 93 transition count 124
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 92 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 92 transition count 122
Applied a total of 134 rules in 13 ms. Remains 92 /151 variables (removed 59) and now considering 122/262 (removed 140) transitions.
// Phase 1: matrix 122 rows 92 cols
[2024-05-21 13:00:08] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:00:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 13:00:08] [INFO ] Invariant cache hit.
[2024-05-21 13:00:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 13:00:08] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-21 13:00:08] [INFO ] Invariant cache hit.
[2024-05-21 13:00:08] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/214 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 138 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/214 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 121/259 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 259 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 6961ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 6962ms
Starting structural reductions in LTL mode, iteration 1 : 92/151 places, 122/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7175 ms. Remains : 92/151 places, 122/262 transitions.
Stuttering acceptance computed with spot in 109 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 317 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-11 finished in 7611 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((X(p1)&&p0))||X(G(p2))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 129 transition count 186
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 115 transition count 169
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 115 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 115 transition count 164
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 105 transition count 145
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 105 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 105 transition count 142
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 98 transition count 129
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 98 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 98 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 124 place count 94 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 94 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 94 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 133 place count 91 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 136 place count 91 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 90 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 90 transition count 114
Applied a total of 139 rules in 10 ms. Remains 90 /151 variables (removed 61) and now considering 114/262 (removed 148) transitions.
// Phase 1: matrix 114 rows 90 cols
[2024-05-21 13:00:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:00:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 13:00:16] [INFO ] Invariant cache hit.
[2024-05-21 13:00:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 13:00:16] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-21 13:00:16] [INFO ] Invariant cache hit.
[2024-05-21 13:00:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/204 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 132 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/204 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 113/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 245 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 6971ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6972ms
Starting structural reductions in LTL mode, iteration 1 : 90/151 places, 114/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7160 ms. Remains : 90/151 places, 114/262 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-12 finished in 7347 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 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 194
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 128 transition count 190
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 112 transition count 171
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 112 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 87 place count 112 transition count 166
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 99 place count 100 transition count 145
Iterating global reduction 2 with 12 rules applied. Total rules applied 111 place count 100 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 100 transition count 141
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 123 place count 92 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 131 place count 92 transition count 122
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 92 transition count 119
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 138 place count 88 transition count 115
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 88 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 88 transition count 113
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 147 place count 85 transition count 110
Iterating global reduction 5 with 3 rules applied. Total rules applied 150 place count 85 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 84 transition count 107
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 84 transition count 107
Applied a total of 153 rules in 14 ms. Remains 84 /151 variables (removed 67) and now considering 107/262 (removed 155) transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 13:00:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:00:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 13:00:23] [INFO ] Invariant cache hit.
[2024-05-21 13:00:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 13:00:23] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-21 13:00:23] [INFO ] Invariant cache hit.
[2024-05-21 13:00:23] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 13:00:24] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 13:00:25] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 11 ms to minimize.
[2024-05-21 13:00:26] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 126 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3717 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/191 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 106/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 232 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4455 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
After SMT, in 8260ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 8261ms
Starting structural reductions in LTL mode, iteration 1 : 84/151 places, 107/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8477 ms. Remains : 84/151 places, 107/262 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-13 finished in 8571 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)&&X(X(((p1 U p2) U p3))))))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 199
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 131 transition count 195
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 118 transition count 179
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 118 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 118 transition count 176
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 110 transition count 163
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 110 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 110 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 105 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 105 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 105 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 103 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 103 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 102 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 102 transition count 140
Applied a total of 111 rules in 18 ms. Remains 102 /151 variables (removed 49) and now considering 140/262 (removed 122) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-21 13:00:32] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 13:00:32] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 13:00:32] [INFO ] Invariant cache hit.
[2024-05-21 13:00:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 13:00:32] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-21 13:00:32] [INFO ] Invariant cache hit.
[2024-05-21 13:00:32] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/242 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 52/156 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 156 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3334 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/242 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 52/156 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 139/295 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 295 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6657 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
After SMT, in 10134ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 10135ms
Starting structural reductions in LTL mode, iteration 1 : 102/151 places, 140/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10415 ms. Remains : 102/151 places, 140/262 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (NOT p3), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-15 finished in 10732 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(X((X(X(G(p0)))||G(p1))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m10-LTLFireability-04
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 193
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 129 transition count 190
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 114 transition count 172
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 114 transition count 172
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 114 transition count 167
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 103 transition count 148
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 103 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 103 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 96 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 126 place count 96 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 93 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 93 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 93 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 91 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 90 transition count 118
Applied a total of 140 rules in 29 ms. Remains 90 /151 variables (removed 61) and now considering 118/262 (removed 144) transitions.
// Phase 1: matrix 118 rows 90 cols
[2024-05-21 13:00:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:00:43] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 13:00:43] [INFO ] Invariant cache hit.
[2024-05-21 13:00:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 13:00:43] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 13:00:43] [INFO ] Invariant cache hit.
[2024-05-21 13:00:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4401 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6873ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6877ms
Starting structural reductions in LI_LTL mode, iteration 1 : 90/151 places, 118/262 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7171 ms. Remains : 90/151 places, 118/262 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-04
Product exploration explored 100000 steps with 22874 reset in 106 ms.
Product exploration explored 100000 steps with 23008 reset in 123 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9199 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1942 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1917 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1928 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1924 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1843 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2820523 steps, run timeout after 3001 ms. (steps per millisecond=939 ) properties seen :5 out of 6
Probabilistic random walk after 2820523 steps, saw 1093515 distinct states, run finished after 3001 ms. (steps per millisecond=939 ) properties seen :5
[2024-05-21 13:00:54] [INFO ] Invariant cache hit.
[2024-05-21 13:00:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/149 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 1 solved, 0 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 11/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 380 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 13:00:55] [INFO ] Invariant cache hit.
[2024-05-21 13:00:55] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 13:00:55] [INFO ] Invariant cache hit.
[2024-05-21 13:00:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 13:00:55] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 13:00:55] [INFO ] Invariant cache hit.
[2024-05-21 13:00:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2335 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4491 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6946ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6948ms
Finished structural reductions in LTL mode , in 1 iterations and 7132 ms. Remains : 90/90 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9195 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1907 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1955 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21241 steps, run visited all 3 properties in 78 ms. (steps per millisecond=272 )
Probabilistic random walk after 21241 steps, saw 10079 distinct states, run finished after 78 ms. (steps per millisecond=272 ) properties seen :3
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 378 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 374 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22882 reset in 110 ms.
Product exploration explored 100000 steps with 23004 reset in 120 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 13:01:05] [INFO ] Redundant transitions in 0 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-21 13:01:05] [INFO ] Invariant cache hit.
[2024-05-21 13:01:05] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7056ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7057ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7068 ms. Remains : 90/90 places, 118/118 transitions.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 0 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 13:01:12] [INFO ] Invariant cache hit.
[2024-05-21 13:01:12] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 13:01:12] [INFO ] Invariant cache hit.
[2024-05-21 13:01:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 13:01:12] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 13:01:12] [INFO ] Invariant cache hit.
[2024-05-21 13:01:12] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7037ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7038ms
Finished structural reductions in LTL mode , in 1 iterations and 7284 ms. Remains : 90/90 places, 118/118 transitions.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-04 finished in 36827 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)||F(G(p1))))'
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) U G(!p1)))'
[2024-05-21 13:01:19] [INFO ] Flatten gal took : 14 ms
[2024-05-21 13:01:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 13:01:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 262 transitions and 1028 arcs took 6 ms.
Total runtime 257534 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 151
TRANSITIONS: 262
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/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: 2131
MODEL NAME: /home/mcc/execution/412/model
151 places, 262 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-d1m10"
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-d1m10, 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-171624187900540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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