Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624188000556.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DBSingleClientW-PT-d2m05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188000556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716298866159

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:41:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 13:41:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:41:07] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-21 13:41:07] [INFO ] Transformed 4763 places.
[2024-05-21 13:41:07] [INFO ] Transformed 2478 transitions.
[2024-05-21 13:41:07] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 379 places :
Symmetric choice reduction at 1 with 379 rule applications. Total rules 624 place count 758 transition count 1336
Iterating global reduction 1 with 379 rules applied. Total rules applied 1003 place count 758 transition count 1336
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 1057 place count 758 transition count 1282
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 1361 place count 454 transition count 978
Iterating global reduction 2 with 304 rules applied. Total rules applied 1665 place count 454 transition count 978
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1672 place count 454 transition count 971
Discarding 231 places :
Symmetric choice reduction at 3 with 231 rule applications. Total rules 1903 place count 223 transition count 645
Iterating global reduction 3 with 231 rules applied. Total rules applied 2134 place count 223 transition count 645
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 3 with 205 rules applied. Total rules applied 2339 place count 223 transition count 440
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2361 place count 201 transition count 400
Iterating global reduction 4 with 22 rules applied. Total rules applied 2383 place count 201 transition count 400
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 2401 place count 201 transition count 382
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2416 place count 186 transition count 367
Iterating global reduction 5 with 15 rules applied. Total rules applied 2431 place count 186 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2435 place count 186 transition count 363
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2447 place count 174 transition count 351
Iterating global reduction 6 with 12 rules applied. Total rules applied 2459 place count 174 transition count 351
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2469 place count 174 transition count 341
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2474 place count 169 transition count 319
Iterating global reduction 7 with 5 rules applied. Total rules applied 2479 place count 169 transition count 319
Applied a total of 2479 rules in 201 ms. Remains 169 /1183 variables (removed 1014) and now considering 319/2478 (removed 2159) transitions.
// Phase 1: matrix 319 rows 169 cols
[2024-05-21 13:41:08] [INFO ] Computed 2 invariants in 19 ms
[2024-05-21 13:41:08] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-21 13:41:08] [INFO ] Invariant cache hit.
[2024-05-21 13:41:08] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-21 13:41:08] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2024-05-21 13:41:08] [INFO ] Invariant cache hit.
[2024-05-21 13:41:08] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 319/488 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 160/331 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/488 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 331 constraints, problems are : Problem set: 0 solved, 318 unsolved in 14196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 319/488 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 160/331 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 318/649 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 649 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 45029ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 45109ms
Starting structural reductions in LTL mode, iteration 1 : 169/1183 places, 319/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46165 ms. Remains : 169/1183 places, 319/2478 transitions.
Support contains 16 out of 169 places after structural reductions.
[2024-05-21 13:41:54] [INFO ] Flatten gal took : 45 ms
[2024-05-21 13:41:54] [INFO ] Flatten gal took : 23 ms
[2024-05-21 13:41:54] [INFO ] Input system was already deterministic with 319 transitions.
RANDOM walk for 40000 steps (9145 resets) in 2590 ms. (15 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40004 steps (1797 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1830 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1725 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1774 resets) in 344 ms. (115 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1707 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1772 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1783 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1813 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1798 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1807 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1721 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1833 resets) in 57 ms. (689 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1738 resets) in 57 ms. (689 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 22456 steps, run visited all 14 properties in 228 ms. (steps per millisecond=98 )
Probabilistic random walk after 22456 steps, saw 10410 distinct states, run finished after 232 ms. (steps per millisecond=96 ) properties seen :14
Computed a total of 5 stabilizing places and 26 stable transitions
Graph (complete) has 669 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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)&&F(p1)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 158 transition count 259
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 158 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 158 transition count 258
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 34 place count 147 transition count 241
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 147 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 147 transition count 238
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 56 place count 139 transition count 224
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 139 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 139 transition count 218
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 134 transition count 204
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 134 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 134 transition count 202
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 132 transition count 200
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 132 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 89 place count 132 transition count 197
Applied a total of 89 rules in 44 ms. Remains 132 /169 variables (removed 37) and now considering 197/319 (removed 122) transitions.
// Phase 1: matrix 197 rows 132 cols
[2024-05-21 13:41:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:41:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 13:41:56] [INFO ] Invariant cache hit.
[2024-05-21 13:41:56] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 13:41:56] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-21 13:41:56] [INFO ] Redundant transitions in 7 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-21 13:41:56] [INFO ] Invariant cache hit.
[2024-05-21 13:41:56] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/329 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 205 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/329 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 196/401 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 401 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12910 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 19391ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 19395ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/169 places, 197/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19794 ms. Remains : 132/169 places, 197/319 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-01 finished in 20082 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((G(p1)||p0))&&F(G(p2)))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 159 transition count 265
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 159 transition count 265
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 149 transition count 255
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 149 transition count 255
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 149 transition count 252
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 141 transition count 239
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 141 transition count 239
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 141 transition count 233
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 136 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 136 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 136 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 135 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 135 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 135 transition count 206
Applied a total of 83 rules in 49 ms. Remains 135 /169 variables (removed 34) and now considering 206/319 (removed 113) transitions.
// Phase 1: matrix 206 rows 135 cols
[2024-05-21 13:42:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:42:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 13:42:16] [INFO ] Invariant cache hit.
[2024-05-21 13:42:16] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-21 13:42:16] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-21 13:42:16] [INFO ] Redundant transitions in 7 ms returned []
Running 205 sub problems to find dead transitions.
[2024-05-21 13:42:16] [INFO ] Invariant cache hit.
[2024-05-21 13:42:16] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/341 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 76/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 213 constraints, problems are : Problem set: 0 solved, 205 unsolved in 6917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 76/76 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/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/341 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 76/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 205/418 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 418 constraints, problems are : Problem set: 0 solved, 205 unsolved in 13412 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 20651ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 20653ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/169 places, 206/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21084 ms. Remains : 135/169 places, 206/319 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-04 finished in 21220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 157 transition count 258
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 157 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 157 transition count 257
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 37 place count 145 transition count 239
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 145 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 145 transition count 236
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 136 transition count 221
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 136 transition count 221
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 77 place count 136 transition count 214
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 83 place count 130 transition count 193
Iterating global reduction 3 with 6 rules applied. Total rules applied 89 place count 130 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 130 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 128 transition count 189
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 128 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 98 place count 128 transition count 186
Applied a total of 98 rules in 17 ms. Remains 128 /169 variables (removed 41) and now considering 186/319 (removed 133) transitions.
// Phase 1: matrix 186 rows 128 cols
[2024-05-21 13:42:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:42:37] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 13:42:37] [INFO ] Invariant cache hit.
[2024-05-21 13:42:37] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 13:42:37] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-21 13:42:37] [INFO ] Invariant cache hit.
[2024-05-21 13:42:37] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/314 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 13:42:41] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 193 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/314 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 185/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 378 constraints, problems are : Problem set: 0 solved, 185 unsolved in 10844 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 constraints]
After SMT, in 18673ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 18675ms
Starting structural reductions in LTL mode, iteration 1 : 128/169 places, 186/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19040 ms. Remains : 128/169 places, 186/319 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-07 finished in 19152 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)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 157 transition count 252
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 157 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 157 transition count 251
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 37 place count 145 transition count 233
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 145 transition count 233
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 145 transition count 228
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 136 transition count 212
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 136 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 136 transition count 206
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 130 transition count 191
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 130 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 93 place count 130 transition count 188
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 128 transition count 186
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 128 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 128 transition count 183
Applied a total of 100 rules in 10 ms. Remains 128 /169 variables (removed 41) and now considering 183/319 (removed 136) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 13:42:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:42:56] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 13:42:56] [INFO ] Invariant cache hit.
[2024-05-21 13:42:56] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 13:42:56] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-21 13:42:56] [INFO ] Invariant cache hit.
[2024-05-21 13:42:56] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 13:42:59] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 193 constraints, problems are : Problem set: 0 solved, 182 unsolved in 6689 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/311 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 182/375 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 375 constraints, problems are : Problem set: 0 solved, 182 unsolved in 10932 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 1/1 constraints]
After SMT, in 17877ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 17880ms
Starting structural reductions in LTL mode, iteration 1 : 128/169 places, 183/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18238 ms. Remains : 128/169 places, 183/319 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-10
Product exploration explored 100000 steps with 22912 reset in 288 ms.
Product exploration explored 100000 steps with 22932 reset in 201 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 463 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9223 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1751 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16647 steps, run visited all 1 properties in 35 ms. (steps per millisecond=475 )
Probabilistic random walk after 16647 steps, saw 8194 distinct states, run finished after 35 ms. (steps per millisecond=475 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-10 finished in 19226 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 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 157 transition count 257
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 157 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 157 transition count 256
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 37 place count 145 transition count 238
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 145 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 145 transition count 233
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 136 transition count 218
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 136 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 136 transition count 212
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 130 transition count 190
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 130 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 96 place count 130 transition count 184
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 129 transition count 183
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 129 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 129 transition count 182
Applied a total of 99 rules in 27 ms. Remains 129 /169 variables (removed 40) and now considering 182/319 (removed 137) transitions.
// Phase 1: matrix 182 rows 129 cols
[2024-05-21 13:43:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:43:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 13:43:15] [INFO ] Invariant cache hit.
[2024-05-21 13:43:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:43:16] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-21 13:43:16] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 13:43:16] [INFO ] Invariant cache hit.
[2024-05-21 13:43:16] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5843 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10575 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16656ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16658ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/169 places, 182/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17048 ms. Remains : 129/169 places, 182/319 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-11
Product exploration explored 100000 steps with 23045 reset in 149 ms.
Product exploration explored 100000 steps with 23020 reset in 151 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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)]
RANDOM walk for 40000 steps (9231 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1833 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21094 steps, run visited all 1 properties in 39 ms. (steps per millisecond=540 )
Probabilistic random walk after 21094 steps, saw 10364 distinct states, run finished after 39 ms. (steps per millisecond=540 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 13:43:33] [INFO ] Invariant cache hit.
[2024-05-21 13:43:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 13:43:33] [INFO ] Invariant cache hit.
[2024-05-21 13:43:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:43:33] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-21 13:43:33] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 13:43:33] [INFO ] Invariant cache hit.
[2024-05-21 13:43:33] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16632ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16634ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16969 ms. Remains : 129/129 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 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 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9183 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1783 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21094 steps, run visited all 1 properties in 38 ms. (steps per millisecond=555 )
Probabilistic random walk after 21094 steps, saw 10364 distinct states, run finished after 39 ms. (steps per millisecond=540 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23017 reset in 145 ms.
Product exploration explored 100000 steps with 23032 reset in 149 ms.
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 13:43:51] [INFO ] Invariant cache hit.
[2024-05-21 13:43:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 13:43:51] [INFO ] Invariant cache hit.
[2024-05-21 13:43:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:43:51] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-21 13:43:51] [INFO ] Redundant transitions in 1 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 13:43:51] [INFO ] Invariant cache hit.
[2024-05-21 13:43:51] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5876 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16430ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16772 ms. Remains : 129/129 places, 182/182 transitions.
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-11 finished in 52239 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 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 157 transition count 257
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 157 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 157 transition count 256
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 37 place count 145 transition count 238
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 145 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 145 transition count 233
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 136 transition count 218
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 136 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 136 transition count 212
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 130 transition count 190
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 130 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 96 place count 130 transition count 184
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 129 transition count 183
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 129 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 129 transition count 182
Applied a total of 99 rules in 15 ms. Remains 129 /169 variables (removed 40) and now considering 182/319 (removed 137) transitions.
[2024-05-21 13:44:08] [INFO ] Invariant cache hit.
[2024-05-21 13:44:08] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-21 13:44:08] [INFO ] Invariant cache hit.
[2024-05-21 13:44:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:44:08] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-21 13:44:08] [INFO ] Redundant transitions in 1 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 13:44:08] [INFO ] Invariant cache hit.
[2024-05-21 13:44:08] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16515ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16520ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/169 places, 182/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17071 ms. Remains : 129/169 places, 182/319 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-12
Product exploration explored 100000 steps with 23074 reset in 142 ms.
Product exploration explored 100000 steps with 23047 reset in 144 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9154 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1767 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21094 steps, run visited all 1 properties in 40 ms. (steps per millisecond=527 )
Probabilistic random walk after 21094 steps, saw 10364 distinct states, run finished after 40 ms. (steps per millisecond=527 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 13:44:26] [INFO ] Invariant cache hit.
[2024-05-21 13:44:26] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 13:44:26] [INFO ] Invariant cache hit.
[2024-05-21 13:44:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:44:26] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-21 13:44:26] [INFO ] Redundant transitions in 1 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 13:44:26] [INFO ] Invariant cache hit.
[2024-05-21 13:44:26] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5837 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16414ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16418ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16743 ms. Remains : 129/129 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9156 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1805 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21094 steps, run visited all 1 properties in 36 ms. (steps per millisecond=585 )
Probabilistic random walk after 21094 steps, saw 10364 distinct states, run finished after 36 ms. (steps per millisecond=585 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22964 reset in 138 ms.
Product exploration explored 100000 steps with 23109 reset in 143 ms.
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 13:44:43] [INFO ] Invariant cache hit.
[2024-05-21 13:44:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 13:44:43] [INFO ] Invariant cache hit.
[2024-05-21 13:44:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:44:43] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-21 13:44:43] [INFO ] Redundant transitions in 0 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 13:44:43] [INFO ] Invariant cache hit.
[2024-05-21 13:44:43] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5812 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16157ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16491 ms. Remains : 129/129 places, 182/182 transitions.
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-12 finished in 51996 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 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 158 transition count 264
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 158 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 158 transition count 263
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 34 place count 147 transition count 246
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 147 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 147 transition count 242
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 57 place count 139 transition count 228
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 139 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 139 transition count 222
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 76 place count 134 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 81 place count 134 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 85 place count 134 transition count 198
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 133 transition count 197
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 133 transition count 197
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 133 transition count 195
Applied a total of 89 rules in 6 ms. Remains 133 /169 variables (removed 36) and now considering 195/319 (removed 124) transitions.
// Phase 1: matrix 195 rows 133 cols
[2024-05-21 13:45:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:45:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 13:45:00] [INFO ] Invariant cache hit.
[2024-05-21 13:45:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 13:45:00] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-21 13:45:00] [INFO ] Invariant cache hit.
[2024-05-21 13:45:00] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/328 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 203 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5927 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/328 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 194/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 397 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 19354ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 19356ms
Starting structural reductions in LTL mode, iteration 1 : 133/169 places, 195/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19672 ms. Remains : 133/169 places, 195/319 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-13 finished in 19801 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(G(p1)) U G(p2))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 158 transition count 264
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 158 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 158 transition count 263
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 34 place count 147 transition count 246
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 147 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 147 transition count 242
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 140 transition count 230
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 140 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 140 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 136 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 136 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 80 place count 136 transition count 202
Applied a total of 80 rules in 11 ms. Remains 136 /169 variables (removed 33) and now considering 202/319 (removed 117) transitions.
// Phase 1: matrix 202 rows 136 cols
[2024-05-21 13:45:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:45:19] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 13:45:19] [INFO ] Invariant cache hit.
[2024-05-21 13:45:20] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 13:45:20] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 13:45:20] [INFO ] Invariant cache hit.
[2024-05-21 13:45:20] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/338 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 13:45:26] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/338 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/338 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 209 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11639 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/338 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 70/209 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 201/410 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/338 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 410 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
After SMT, in 25418ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 25420ms
Starting structural reductions in LTL mode, iteration 1 : 136/169 places, 202/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25787 ms. Remains : 136/169 places, 202/319 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-14
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-14 finished in 26000 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 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 319/319 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 156 transition count 251
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 156 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 156 transition count 250
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 144 transition count 238
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 144 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 144 transition count 233
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 66 place count 134 transition count 216
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 134 transition count 216
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 83 place count 134 transition count 209
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 90 place count 127 transition count 186
Iterating global reduction 3 with 7 rules applied. Total rules applied 97 place count 127 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 127 transition count 183
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 125 transition count 181
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 125 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 107 place count 125 transition count 178
Applied a total of 107 rules in 30 ms. Remains 125 /169 variables (removed 44) and now considering 178/319 (removed 141) transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 13:45:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:45:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 13:45:45] [INFO ] Invariant cache hit.
[2024-05-21 13:45:46] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 13:45:46] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-21 13:45:46] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 13:45:46] [INFO ] Invariant cache hit.
[2024-05-21 13:45:46] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 59/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 13:45:48] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 5 ms to minimize.
[2024-05-21 13:45:49] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-21 13:45:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 13:45:49] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 13:45:49] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 191 constraints, problems are : Problem set: 0 solved, 177 unsolved in 6221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 178/303 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 59/191 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 177/368 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 368 constraints, problems are : Problem set: 0 solved, 177 unsolved in 12197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 5/5 constraints]
After SMT, in 18616ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 18618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/169 places, 178/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18938 ms. Remains : 125/169 places, 178/319 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-15
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-15 finished in 19036 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)))'
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)))'
[2024-05-21 13:46:05] [INFO ] Flatten gal took : 20 ms
[2024-05-21 13:46:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-21 13:46:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 169 places, 319 transitions and 1255 arcs took 14 ms.
Total runtime 297984 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d2m05

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1090
MODEL NAME: /home/mcc/execution/410/model
169 places, 319 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716299179061

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d2m05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188000556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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