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.r480-tall-171624189400500.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 ltsminxred
Input is DBSingleClientW-PT-d1m05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189400500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-d1m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717189304699

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:01:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:01:46] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-31 21:01:46] [INFO ] Transformed 1440 places.
[2024-05-31 21:01:46] [INFO ] Transformed 672 transitions.
[2024-05-31 21:01:46] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 188 place count 239 transition count 400
Iterating global reduction 1 with 87 rules applied. Total rules applied 275 place count 239 transition count 400
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 287 place count 239 transition count 388
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 353 place count 173 transition count 322
Iterating global reduction 2 with 66 rules applied. Total rules applied 419 place count 173 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 423 place count 173 transition count 318
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 457 place count 139 transition count 267
Iterating global reduction 3 with 34 rules applied. Total rules applied 491 place count 139 transition count 267
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 524 place count 139 transition count 234
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 532 place count 131 transition count 222
Iterating global reduction 4 with 8 rules applied. Total rules applied 540 place count 131 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 544 place count 131 transition count 218
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 549 place count 126 transition count 213
Iterating global reduction 5 with 5 rules applied. Total rules applied 554 place count 126 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 556 place count 126 transition count 211
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 559 place count 123 transition count 208
Iterating global reduction 6 with 3 rules applied. Total rules applied 562 place count 123 transition count 208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 563 place count 122 transition count 206
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 122 transition count 206
Applied a total of 564 rules in 102 ms. Remains 122 /347 variables (removed 225) and now considering 206/672 (removed 466) transitions.
// Phase 1: matrix 206 rows 122 cols
[2024-05-31 21:01:46] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 21:01:46] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-31 21:01:46] [INFO ] Invariant cache hit.
[2024-05-31 21:01:47] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-31 21:01:47] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-31 21:01:47] [INFO ] Invariant cache hit.
[2024-05-31 21:01:47] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/328 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 94/218 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 218 constraints, problems are : Problem set: 0 solved, 205 unsolved in 6651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/328 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 94/218 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 205/423 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 423 constraints, problems are : Problem set: 0 solved, 205 unsolved in 13941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 21095ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 21115ms
Starting structural reductions in LTL mode, iteration 1 : 122/347 places, 206/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21848 ms. Remains : 122/347 places, 206/672 transitions.
Support contains 22 out of 122 places after structural reductions.
[2024-05-31 21:02:08] [INFO ] Flatten gal took : 47 ms
[2024-05-31 21:02:08] [INFO ] Flatten gal took : 29 ms
[2024-05-31 21:02:08] [INFO ] Input system was already deterministic with 206 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (9276 resets) in 1958 ms. (20 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4003 steps (174 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (179 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (174 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (184 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (182 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (192 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (197 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (180 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (171 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (384 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (179 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (360 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (186 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (284 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (194 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
[2024-05-31 21:02:09] [INFO ] Invariant cache hit.
[2024-05-31 21:02:09] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/58 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 32/90 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 168/258 variables, 90/92 constraints. Problems are: Problem set: 1 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 56/148 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 70/328 variables, 32/180 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 38/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/328 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 218 constraints, problems are : Problem set: 1 solved, 14 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 41/57 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 168/258 variables, 90/92 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 56/148 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 70/328 variables, 32/180 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 38/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 14/232 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 232 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 2253ms problems are : Problem set: 1 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 3545 ms.
Support contains 16 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 192
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 116 transition count 190
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 116 transition count 190
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 114 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 114 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 114 transition count 187
Applied a total of 17 rules in 24 ms. Remains 114 /122 variables (removed 8) and now considering 187/206 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 114/122 places, 187/206 transitions.
RANDOM walk for 40000 steps (9225 resets) in 332 ms. (120 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1918 resets) in 314 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 277 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1913 resets) in 245 ms. (162 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1934 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1915 resets) in 151 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1917 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1891 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3898 resets) in 183 ms. (217 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1969 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3988 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1907 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 23480 steps, run visited all 14 properties in 233 ms. (steps per millisecond=100 )
Probabilistic random walk after 23480 steps, saw 11027 distinct states, run finished after 239 ms. (steps per millisecond=98 ) properties seen :14
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 451 edges and 122 vertex of which 121 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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((X(p1)&&p0))||G(p2)))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 108 transition count 158
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 99 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 99 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 53 place count 99 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 93 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 90 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 89 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 89 transition count 116
Applied a total of 80 rules in 10 ms. Remains 89 /122 variables (removed 33) and now considering 116/206 (removed 90) transitions.
// Phase 1: matrix 116 rows 89 cols
[2024-05-31 21:02:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:02:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 21:02:17] [INFO ] Invariant cache hit.
[2024-05-31 21:02:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:02:17] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-31 21:02:17] [INFO ] Invariant cache hit.
[2024-05-31 21:02:17] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-31 21:02:18] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 14 ms to minimize.
[2024-05-31 21:02:18] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 134 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/205 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 115/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 249 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4289 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints]
After SMT, in 7609ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 7611ms
Starting structural reductions in LTL mode, iteration 1 : 89/122 places, 116/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7853 ms. Remains : 89/122 places, 116/206 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-02 finished in 8261 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 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 158
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 107 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 97 transition count 138
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 97 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 97 transition count 134
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 90 transition count 123
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 90 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 78 place count 87 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 87 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 89 place count 84 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 84 transition count 107
Applied a total of 91 rules in 27 ms. Remains 84 /122 variables (removed 38) and now considering 107/206 (removed 99) transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-31 21:02:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:02:25] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 21:02:25] [INFO ] Invariant cache hit.
[2024-05-31 21:02:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:02:25] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-31 21:02:25] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-31 21:02:25] [INFO ] Invariant cache hit.
[2024-05-31 21:02:25] [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
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2088 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
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
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3879 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: 0/0 constraints]
After SMT, in 6067ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/122 places, 107/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6303 ms. Remains : 84/122 places, 107/206 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-04 finished in 6426 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(G((G(p0)||F(((X(!p0)&&F(p1))||G(!p0)))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 108 transition count 158
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 99 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 99 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 99 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 93 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 90 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 89 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 89 transition count 116
Applied a total of 81 rules in 13 ms. Remains 89 /122 variables (removed 33) and now considering 116/206 (removed 90) transitions.
// Phase 1: matrix 116 rows 89 cols
[2024-05-31 21:02:31] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:02:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:02:31] [INFO ] Invariant cache hit.
[2024-05-31 21:02:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:02:31] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-31 21:02:31] [INFO ] Invariant cache hit.
[2024-05-31 21:02:31] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6670ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6672ms
Starting structural reductions in LTL mode, iteration 1 : 89/122 places, 116/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6902 ms. Remains : 89/122 places, 116/206 transitions.
Stuttering acceptance computed with spot in 168 ms :[false, false, p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-05
Product exploration explored 100000 steps with 26568 reset in 291 ms.
Product exploration explored 100000 steps with 26541 reset in 203 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9124 resets) in 490 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1804 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1934 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1874 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 18487 steps, run visited all 4 properties in 102 ms. (steps per millisecond=181 )
Probabilistic random walk after 18487 steps, saw 8773 distinct states, run finished after 102 ms. (steps per millisecond=181 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[false, p0, (AND p0 (NOT p1))]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 116/116 transitions.
Applied a total of 0 rules in 14 ms. Remains 89 /89 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-31 21:02:40] [INFO ] Invariant cache hit.
[2024-05-31 21:02:40] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 21:02:40] [INFO ] Invariant cache hit.
[2024-05-31 21:02:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:02:40] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-31 21:02:40] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-31 21:02:40] [INFO ] Invariant cache hit.
[2024-05-31 21:02:40] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4424 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6771ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6773ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7001 ms. Remains : 89/89 places, 116/116 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.4 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9243 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1916 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1941 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 18487 steps, run visited all 4 properties in 75 ms. (steps per millisecond=246 )
Probabilistic random walk after 18487 steps, saw 8773 distinct states, run finished after 75 ms. (steps per millisecond=246 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 163 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[false, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 29672 reset in 144 ms.
Product exploration explored 100000 steps with 29504 reset in 147 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-31 21:02:48] [INFO ] Invariant cache hit.
[2024-05-31 21:02:48] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 21:02:48] [INFO ] Invariant cache hit.
[2024-05-31 21:02:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:02:48] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 21:02:48] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-31 21:02:48] [INFO ] Invariant cache hit.
[2024-05-31 21:02:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6714ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6716ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6962 ms. Remains : 89/89 places, 116/116 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-05 finished in 24009 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((G(!p0)||F(p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 108 transition count 160
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 99 transition count 144
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 99 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 99 transition count 140
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 93 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 93 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 93 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 91 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 91 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 91 transition count 122
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 90 transition count 121
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 90 transition count 119
Applied a total of 77 rules in 5 ms. Remains 90 /122 variables (removed 32) and now considering 119/206 (removed 87) transitions.
// Phase 1: matrix 119 rows 90 cols
[2024-05-31 21:02:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:02:55] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-31 21:02:55] [INFO ] Invariant cache hit.
[2024-05-31 21:02:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:02:56] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-31 21:02:56] [INFO ] Invariant cache hit.
[2024-05-31 21:02:56] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-31 21:02:57] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-31 21:02:57] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 138 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3319 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 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/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 118/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 256 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4842 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 8266ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 8267ms
Starting structural reductions in LTL mode, iteration 1 : 90/122 places, 119/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8585 ms. Remains : 90/122 places, 119/206 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-07
Product exploration explored 100000 steps with 22986 reset in 142 ms.
Product exploration explored 100000 steps with 23090 reset in 141 ms.
Computed a total of 5 stabilizing places and 14 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 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
RANDOM walk for 40000 steps (9257 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1902 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1935 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1854 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1874 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1883 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1856 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 24728 steps, run visited all 6 properties in 110 ms. (steps per millisecond=224 )
Probabilistic random walk after 24728 steps, saw 11555 distinct states, run finished after 110 ms. (steps per millisecond=224 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 282 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) 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, 119/119 transitions.
Applied a total of 0 rules in 11 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-31 21:03:06] [INFO ] Invariant cache hit.
[2024-05-31 21:03:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 21:03:06] [INFO ] Invariant cache hit.
[2024-05-31 21:03:06] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:03:06] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-31 21:03:06] [INFO ] Redundant transitions in 2 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-31 21:03:06] [INFO ] Invariant cache hit.
[2024-05-31 21:03:06] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-31 21:03:08] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:03:08] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 138 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 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/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 118/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 256 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 8259ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 8261ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8485 ms. Remains : 90/90 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 14 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.4 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 141 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
RANDOM walk for 40000 steps (9235 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1882 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1858 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1929 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1904 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1983 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 24728 steps, run visited all 6 properties in 140 ms. (steps per millisecond=176 )
Probabilistic random walk after 24728 steps, saw 11555 distinct states, run finished after 140 ms. (steps per millisecond=176 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 338 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 22883 reset in 148 ms.
Product exploration explored 100000 steps with 22910 reset in 153 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-31 21:03:16] [INFO ] Invariant cache hit.
[2024-05-31 21:03:16] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:03:16] [INFO ] Invariant cache hit.
[2024-05-31 21:03:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:03:16] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-31 21:03:16] [INFO ] Redundant transitions in 2 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-31 21:03:16] [INFO ] Invariant cache hit.
[2024-05-31 21:03:16] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-31 21:03:18] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:03:18] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 138 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3394 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 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/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 118/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 256 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4731 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 8235ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 8237ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8468 ms. Remains : 90/90 places, 119/119 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-07 finished in 29434 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 p1) U X(X(p0))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 156
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 107 transition count 154
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 97 transition count 137
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 97 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 97 transition count 133
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 90 transition count 122
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 90 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 90 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 87 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 87 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 87 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 85 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 85 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 84 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 84 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 90 place count 84 transition count 106
Applied a total of 90 rules in 11 ms. Remains 84 /122 variables (removed 38) and now considering 106/206 (removed 100) transitions.
// Phase 1: matrix 106 rows 84 cols
[2024-05-31 21:03:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:03:25] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 21:03:25] [INFO ] Invariant cache hit.
[2024-05-31 21:03:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:03:25] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-31 21:03:25] [INFO ] Invariant cache hit.
[2024-05-31 21:03:25] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/190 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 122 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/190 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 105/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 227 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3810 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 5754ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5756ms
Starting structural reductions in LTL mode, iteration 1 : 84/122 places, 106/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5997 ms. Remains : 84/122 places, 106/206 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-09 finished in 6403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 155
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 107 transition count 152
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 98 transition count 136
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 98 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 98 transition count 132
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 92 transition count 123
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 92 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 92 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 90 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 90 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 89 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 88 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 88 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 88 transition count 111
Applied a total of 81 rules in 24 ms. Remains 88 /122 variables (removed 34) and now considering 111/206 (removed 95) transitions.
// Phase 1: matrix 111 rows 88 cols
[2024-05-31 21:03:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:03:31] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 21:03:31] [INFO ] Invariant cache hit.
[2024-05-31 21:03:31] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:03:31] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-31 21:03:31] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-31 21:03:31] [INFO ] Invariant cache hit.
[2024-05-31 21:03:31] [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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2154 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: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4593 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: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6844ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/122 places, 111/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7095 ms. Remains : 88/122 places, 111/206 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-10
Product exploration explored 100000 steps with 22856 reset in 234 ms.
Product exploration explored 100000 steps with 23000 reset in 152 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9060 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16730 steps, run visited all 1 properties in 36 ms. (steps per millisecond=464 )
Probabilistic random walk after 16730 steps, saw 7970 distinct states, run finished after 36 ms. (steps per millisecond=464 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 9 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-31 21:03:39] [INFO ] Invariant cache hit.
[2024-05-31 21:03:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 21:03:39] [INFO ] Invariant cache hit.
[2024-05-31 21:03:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:03:39] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-31 21:03:39] [INFO ] Redundant transitions in 0 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-31 21:03:39] [INFO ] Invariant cache hit.
[2024-05-31 21:03:39] [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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2237 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: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4569 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: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6903ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6905ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7141 ms. Remains : 88/88 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 48 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9184 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16730 steps, run visited all 1 properties in 32 ms. (steps per millisecond=522 )
Probabilistic random walk after 16730 steps, saw 7970 distinct states, run finished after 32 ms. (steps per millisecond=522 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22908 reset in 120 ms.
Product exploration explored 100000 steps with 22860 reset in 124 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-31 21:03:47] [INFO ] Invariant cache hit.
[2024-05-31 21:03:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:03:47] [INFO ] Invariant cache hit.
[2024-05-31 21:03:47] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:03:47] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-31 21:03:47] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-31 21:03:47] [INFO ] Invariant cache hit.
[2024-05-31 21:03:47] [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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2169 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: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4528 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: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6800ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6802ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7031 ms. Remains : 88/88 places, 111/111 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-10 finished in 22875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 156
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 108 transition count 154
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 100 transition count 144
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 100 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 100 transition count 140
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 94 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 94 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 94 transition count 127
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 91 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 91 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 91 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 89 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 88 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 88 transition count 115
Applied a total of 81 rules in 7 ms. Remains 88 /122 variables (removed 34) and now considering 115/206 (removed 91) transitions.
// Phase 1: matrix 115 rows 88 cols
[2024-05-31 21:03:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:03:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 21:03:54] [INFO ] Invariant cache hit.
[2024-05-31 21:03:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 21:03:54] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-31 21:03:54] [INFO ] Invariant cache hit.
[2024-05-31 21:03:54] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/203 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-31 21:03:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:03:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-31 21:03:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-31 21:03:57] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/203 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 132 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4330 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/203 variables, 88/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 38/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 114/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 246 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints]
After SMT, in 8986ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 8988ms
Starting structural reductions in LTL mode, iteration 1 : 88/122 places, 115/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9190 ms. Remains : 88/122 places, 115/206 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-11 finished in 9278 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((X(X(X(G(p0))))&&(G(p1)||G(p2)))))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 161
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 109 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 102 transition count 146
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 102 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 102 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 97 transition count 137
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 97 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 97 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 95 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 95 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 94 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 94 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 64 place count 94 transition count 128
Applied a total of 64 rules in 13 ms. Remains 94 /122 variables (removed 28) and now considering 128/206 (removed 78) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-31 21:04:03] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:04:03] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 21:04:03] [INFO ] Invariant cache hit.
[2024-05-31 21:04:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:04:03] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-31 21:04:03] [INFO ] Redundant transitions in 1 ms returned []
Running 127 sub problems to find dead transitions.
[2024-05-31 21:04:03] [INFO ] Invariant cache hit.
[2024-05-31 21:04:03] [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, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 138 constraints, problems are : Problem set: 0 solved, 127 unsolved in 2787 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: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 127/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 265 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5112 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: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 8021ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 8024ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/122 places, 128/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8286 ms. Remains : 94/122 places, 128/206 transitions.
Stuttering acceptance computed with spot in 1515 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-12 finished in 9849 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 (F((!p2&&F(!p3)))&&p1))))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 157
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 109 transition count 155
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 102 transition count 147
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 102 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 102 transition count 144
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 96 transition count 135
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 96 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 96 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 94 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 94 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 94 transition count 126
Applied a total of 66 rules in 8 ms. Remains 94 /122 variables (removed 28) and now considering 126/206 (removed 80) transitions.
// Phase 1: matrix 126 rows 94 cols
[2024-05-31 21:04:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:04:13] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 21:04:13] [INFO ] Invariant cache hit.
[2024-05-31 21:04:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 21:04:13] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-31 21:04:13] [INFO ] Invariant cache hit.
[2024-05-31 21:04:13] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/220 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-31 21:04:15] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:04:15] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 142 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3416 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/220 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 44/142 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 125/267 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 267 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 2/2 constraints]
After SMT, in 8771ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 8776ms
Starting structural reductions in LTL mode, iteration 1 : 94/122 places, 126/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9005 ms. Remains : 94/122 places, 126/206 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) p2 p3), (OR (NOT p1) p2 p3), true, p3, (OR p2 p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-13 finished in 9229 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))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 106 transition count 151
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 106 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 106 transition count 149
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 96 transition count 132
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 96 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 96 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 89 transition count 117
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 89 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 89 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 86 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 86 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 86 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 84 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 84 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 89 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 83 transition count 102
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 83 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 83 transition count 101
Applied a total of 92 rules in 17 ms. Remains 83 /122 variables (removed 39) and now considering 101/206 (removed 105) transitions.
// Phase 1: matrix 101 rows 83 cols
[2024-05-31 21:04:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:04:22] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 21:04:22] [INFO ] Invariant cache hit.
[2024-05-31 21:04:22] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 21:04:23] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-31 21:04:23] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-31 21:04:23] [INFO ] Invariant cache hit.
[2024-05-31 21:04:23] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3348 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 5448ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5450ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/122 places, 101/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5686 ms. Remains : 83/122 places, 101/206 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 279 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-14 finished in 6134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F((p1||G(p0)))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 153
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 107 transition count 152
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 41 place count 97 transition count 135
Iterating global reduction 1 with 10 rules applied. Total rules applied 51 place count 97 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 97 transition count 131
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 90 transition count 120
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 90 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 87 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 87 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 87 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 85 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 85 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 87 place count 84 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 84 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 84 transition count 104
Applied a total of 89 rules in 9 ms. Remains 84 /122 variables (removed 38) and now considering 104/206 (removed 102) transitions.
// Phase 1: matrix 104 rows 84 cols
[2024-05-31 21:04:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:04:28] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 21:04:28] [INFO ] Invariant cache hit.
[2024-05-31 21:04:29] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 21:04:29] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-31 21:04:29] [INFO ] Invariant cache hit.
[2024-05-31 21:04:29] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/188 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 120 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/188 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 103/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 223 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5923ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5924ms
Starting structural reductions in LTL mode, iteration 1 : 84/122 places, 104/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6141 ms. Remains : 84/122 places, 104/206 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-15 finished in 6321 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(G((G(p0)||F(((X(!p0)&&F(p1))||G(!p0)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m05-LTLFireability-05
Stuttering acceptance computed with spot in 176 ms :[false, false, p0, (AND p0 (NOT p1))]
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 108 transition count 158
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 99 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 99 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 99 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 93 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 90 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 89 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 89 transition count 116
Applied a total of 81 rules in 13 ms. Remains 89 /122 variables (removed 33) and now considering 116/206 (removed 90) transitions.
// Phase 1: matrix 116 rows 89 cols
[2024-05-31 21:04:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:04:35] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:04:35] [INFO ] Invariant cache hit.
[2024-05-31 21:04:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:04:35] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-31 21:04:35] [INFO ] Invariant cache hit.
[2024-05-31 21:04:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6583ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6584ms
Starting structural reductions in LI_LTL mode, iteration 1 : 89/122 places, 116/206 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6812 ms. Remains : 89/122 places, 116/206 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-05
Product exploration explored 100000 steps with 26426 reset in 134 ms.
Product exploration explored 100000 steps with 26508 reset in 143 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 97 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9189 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2001 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1934 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1906 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 18487 steps, run visited all 4 properties in 57 ms. (steps per millisecond=324 )
Probabilistic random walk after 18487 steps, saw 8773 distinct states, run finished after 57 ms. (steps per millisecond=324 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 211 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[false, p0, (AND p0 (NOT p1))]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-31 21:04:43] [INFO ] Invariant cache hit.
[2024-05-31 21:04:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:04:43] [INFO ] Invariant cache hit.
[2024-05-31 21:04:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:04:43] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-31 21:04:43] [INFO ] Redundant transitions in 0 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-31 21:04:43] [INFO ] Invariant cache hit.
[2024-05-31 21:04:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6613ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6614ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6846 ms. Remains : 89/89 places, 116/116 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.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9151 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1970 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1844 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 18487 steps, run visited all 4 properties in 56 ms. (steps per millisecond=330 )
Probabilistic random walk after 18487 steps, saw 8773 distinct states, run finished after 56 ms. (steps per millisecond=330 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[false, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 29759 reset in 146 ms.
Product exploration explored 100000 steps with 29742 reset in 147 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-31 21:04:51] [INFO ] Invariant cache hit.
[2024-05-31 21:04:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:04:51] [INFO ] Invariant cache hit.
[2024-05-31 21:04:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:04:52] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-31 21:04:52] [INFO ] Redundant transitions in 0 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-31 21:04:52] [INFO ] Invariant cache hit.
[2024-05-31 21:04:52] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6561ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6562ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6788 ms. Remains : 89/89 places, 116/116 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-05 finished in 23373 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((G(!p0)||F(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(G(p0)))'
[2024-05-31 21:04:58] [INFO ] Flatten gal took : 15 ms
[2024-05-31 21:04:58] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 21:04:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 206 transitions and 809 arcs took 5 ms.
Total runtime 192813 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717189499290

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DBSingleClientW-PT-d1m05-LTLFireability-05
ltl formula formula --ltl=/tmp/1720/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 122 places, 206 transitions and 809 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1720/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1720/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1720/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1720/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 123 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 123, there are 220 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~64!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2172
pnml2lts-mc( 0/ 4): unique states count: 2556
pnml2lts-mc( 0/ 4): unique transitions count: 7533
pnml2lts-mc( 0/ 4): - self-loop count: 3793
pnml2lts-mc( 0/ 4): - claim dead count: 390
pnml2lts-mc( 0/ 4): - claim found count: 195
pnml2lts-mc( 0/ 4): - claim success count: 2582
pnml2lts-mc( 0/ 4): - cum. max stack depth: 248
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2582 states 7649 transitions, fanout: 2.962
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 129100, Transitions per second: 382450
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.2 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 206 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d1m05-LTLFireability-07
ltl formula formula --ltl=/tmp/1720/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 122 places, 206 transitions and 809 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1720/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1720/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1720/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1720/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 124 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 123, there are 212 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~37!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 269
pnml2lts-mc( 0/ 4): unique states count: 364
pnml2lts-mc( 0/ 4): unique transitions count: 1164
pnml2lts-mc( 0/ 4): - self-loop count: 494
pnml2lts-mc( 0/ 4): - claim dead count: 17
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 389
pnml2lts-mc( 0/ 4): - cum. max stack depth: 123
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 389 states 1261 transitions, fanout: 3.242
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 38900, Transitions per second: 126100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.5 B/state, compr.: 4.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 206 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d1m05-LTLFireability-10
ltl formula formula --ltl=/tmp/1720/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 122 places, 206 transitions and 809 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1720/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1720/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1720/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1720/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 123 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 123, there are 212 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~48!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 323
pnml2lts-mc( 0/ 4): unique states count: 432
pnml2lts-mc( 0/ 4): unique transitions count: 1392
pnml2lts-mc( 0/ 4): - self-loop count: 586
pnml2lts-mc( 0/ 4): - claim dead count: 26
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 455
pnml2lts-mc( 0/ 4): - cum. max stack depth: 133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 455 states 1472 transitions, fanout: 3.235
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 45500, Transitions per second: 147200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.9 B/state, compr.: 3.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 206 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-d1m05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d1m05, 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 r480-tall-171624189400500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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