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.r488-tall-171631132700468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DiscoveryGPU-PT-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132700468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 01:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 89K 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 DiscoveryGPU-PT-12b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717193036031

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:03:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:03:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:03:57] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-31 22:03:57] [INFO ] Transformed 352 places.
[2024-05-31 22:03:57] [INFO ] Transformed 374 transitions.
[2024-05-31 22:03:57] [INFO ] Found NUPN structural information;
[2024-05-31 22:03:57] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 185 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 3 formulas.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 328 transition count 374
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 81 place count 271 transition count 317
Iterating global reduction 1 with 57 rules applied. Total rules applied 138 place count 271 transition count 317
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 149 place count 260 transition count 306
Iterating global reduction 1 with 11 rules applied. Total rules applied 160 place count 260 transition count 306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 168 place count 252 transition count 298
Iterating global reduction 1 with 8 rules applied. Total rules applied 176 place count 252 transition count 298
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 183 place count 245 transition count 291
Iterating global reduction 1 with 7 rules applied. Total rules applied 190 place count 245 transition count 291
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 196 place count 239 transition count 279
Iterating global reduction 1 with 6 rules applied. Total rules applied 202 place count 239 transition count 279
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 207 place count 234 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 212 place count 234 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 216 place count 230 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 220 place count 230 transition count 270
Applied a total of 220 rules in 176 ms. Remains 230 /352 variables (removed 122) and now considering 270/374 (removed 104) transitions.
// Phase 1: matrix 270 rows 230 cols
[2024-05-31 22:03:57] [INFO ] Computed 2 invariants in 20 ms
[2024-05-31 22:03:58] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-31 22:03:58] [INFO ] Invariant cache hit.
[2024-05-31 22:03:58] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-31 22:03:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 270/500 variables, 230/232 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:04:03] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 18 ms to minimize.
[2024-05-31 22:04:03] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 3 ms to minimize.
[2024-05-31 22:04:03] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:04:04] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:04:05] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:04:05] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 19/251 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 251 constraints, problems are : Problem set: 0 solved, 269 unsolved in 13395 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/500 variables, 230/251 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 269/520 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 520 constraints, problems are : Problem set: 0 solved, 269 unsolved in 13333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 19/19 constraints]
After SMT, in 26918ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 26937ms
Starting structural reductions in LTL mode, iteration 1 : 230/352 places, 270/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27742 ms. Remains : 230/352 places, 270/374 transitions.
Support contains 33 out of 230 places after structural reductions.
[2024-05-31 22:04:25] [INFO ] Flatten gal took : 42 ms
[2024-05-31 22:04:25] [INFO ] Flatten gal took : 18 ms
[2024-05-31 22:04:25] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 32 out of 230 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (99 resets) in 1297 ms. (30 steps per ms) remains 1/29 properties
BEST_FIRST walk for 40002 steps (13 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
[2024-05-31 22:04:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/109 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 331/440 variables, 165/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/495 variables, 49/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/500 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/500 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/109 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 331/440 variables, 165/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/495 variables, 49/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/500 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/500 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 6 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 458 edges and 230 vertex of which 228 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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)||(G(p1)&&F(G(p2)))))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Graph (complete) has 458 edges and 230 vertex of which 228 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 227 transition count 233
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 193 transition count 233
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 69 place count 193 transition count 199
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 137 place count 159 transition count 199
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 141 place count 155 transition count 195
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 155 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 152 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 152 transition count 192
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 154 place count 149 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 157 place count 149 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 146 transition count 183
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 146 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 145 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 145 transition count 182
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 277 place count 89 transition count 126
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 285 place count 81 transition count 111
Iterating global reduction 2 with 8 rules applied. Total rules applied 293 place count 81 transition count 111
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 301 place count 73 transition count 102
Iterating global reduction 2 with 8 rules applied. Total rules applied 309 place count 73 transition count 102
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 65 transition count 86
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 65 transition count 86
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 333 place count 57 transition count 78
Iterating global reduction 2 with 8 rules applied. Total rules applied 341 place count 57 transition count 78
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 349 place count 49 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 357 place count 49 transition count 62
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 365 place count 41 transition count 54
Iterating global reduction 2 with 8 rules applied. Total rules applied 373 place count 41 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 374 place count 40 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 375 place count 40 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 376 place count 39 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 39 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 379 place count 38 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 380 place count 37 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 381 place count 37 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 382 place count 36 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 36 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 384 place count 35 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 385 place count 35 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 386 place count 34 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 34 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 388 place count 33 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 33 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 32 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 31 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 31 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 395 place count 29 transition count 38
Applied a total of 395 rules in 92 ms. Remains 29 /230 variables (removed 201) and now considering 38/270 (removed 232) transitions.
[2024-05-31 22:04:27] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
// Phase 1: matrix 34 rows 29 cols
[2024-05-31 22:04:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:04:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 22:04:27] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2024-05-31 22:04:27] [INFO ] Invariant cache hit.
[2024-05-31 22:04:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:04:27] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-31 22:04:27] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-31 22:04:27] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2024-05-31 22:04:27] [INFO ] Invariant cache hit.
[2024-05-31 22:04:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 34/63 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 32 constraints, problems are : Problem set: 0 solved, 36 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 34/63 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 36/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 68 constraints, problems are : Problem set: 0 solved, 36 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 703ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 704ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/230 places, 38/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 875 ms. Remains : 29/230 places, 38/270 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-01
Stuttering criterion allowed to conclude after 917 steps with 5 reset in 11 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-01 finished in 1210 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 X(X(X(p2)))))))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 220 transition count 260
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 220 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 215 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 215 transition count 254
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 211 transition count 249
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 211 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 207 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 207 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 204 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 204 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 202 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 202 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 201 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 201 transition count 237
Applied a total of 58 rules in 25 ms. Remains 201 /230 variables (removed 29) and now considering 237/270 (removed 33) transitions.
// Phase 1: matrix 237 rows 201 cols
[2024-05-31 22:04:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:04:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 22:04:28] [INFO ] Invariant cache hit.
[2024-05-31 22:04:28] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-31 22:04:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 237/438 variables, 201/203 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:04:32] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:04:33] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:04:33] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:04:33] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 5 ms to minimize.
[2024-05-31 22:04:33] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 17/220 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 220 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/438 variables, 201/220 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 236/456 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 456 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 17/17 constraints]
After SMT, in 20805ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 20809ms
Starting structural reductions in LTL mode, iteration 1 : 201/230 places, 237/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21024 ms. Remains : 201/230 places, 237/270 transitions.
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-02
Product exploration explored 100000 steps with 1861 reset in 237 ms.
Stack based approach found an accepted trace after 460 steps with 7 reset with depth 67 and stack size 67 in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-02 finished in 21717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1) U p2)))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 261
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 216 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 216 transition count 255
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 212 transition count 250
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 212 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 208 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 208 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 205 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 205 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 204 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 204 transition count 240
Applied a total of 52 rules in 23 ms. Remains 204 /230 variables (removed 26) and now considering 240/270 (removed 30) transitions.
// Phase 1: matrix 240 rows 204 cols
[2024-05-31 22:04:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:04:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 22:04:50] [INFO ] Invariant cache hit.
[2024-05-31 22:04:50] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-31 22:04:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 240/444 variables, 204/206 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:04:54] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:04:55] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:04:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:04:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:04:55] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 19/225 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 0/444 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 225 constraints, problems are : Problem set: 0 solved, 239 unsolved in 10520 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 240/444 variables, 204/225 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 239/464 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 464 constraints, problems are : Problem set: 0 solved, 239 unsolved in 11415 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 19/19 constraints]
After SMT, in 22021ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 22024ms
Starting structural reductions in LTL mode, iteration 1 : 204/230 places, 240/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22304 ms. Remains : 204/230 places, 240/270 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 411 edges and 204 vertex of which 202 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-03 finished in 22765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U p1)))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Graph (complete) has 458 edges and 230 vertex of which 228 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 227 transition count 233
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 193 transition count 231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 191 transition count 231
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 73 place count 191 transition count 194
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 147 place count 154 transition count 194
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 152 place count 149 transition count 189
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 149 transition count 189
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 146 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 146 transition count 186
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 143 transition count 181
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 143 transition count 181
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 140 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 140 transition count 177
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 176 place count 139 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 177 place count 139 transition count 176
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 285 place count 85 transition count 122
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 295 place count 75 transition count 103
Iterating global reduction 3 with 10 rules applied. Total rules applied 305 place count 75 transition count 103
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 315 place count 65 transition count 91
Iterating global reduction 3 with 10 rules applied. Total rules applied 325 place count 65 transition count 91
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 335 place count 55 transition count 72
Iterating global reduction 3 with 10 rules applied. Total rules applied 345 place count 55 transition count 72
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 355 place count 45 transition count 61
Iterating global reduction 3 with 10 rules applied. Total rules applied 365 place count 45 transition count 61
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 374 place count 36 transition count 44
Iterating global reduction 3 with 9 rules applied. Total rules applied 383 place count 36 transition count 44
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 391 place count 28 transition count 35
Iterating global reduction 3 with 8 rules applied. Total rules applied 399 place count 28 transition count 35
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 401 place count 26 transition count 32
Iterating global reduction 3 with 2 rules applied. Total rules applied 403 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 404 place count 25 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 405 place count 25 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 406 place count 25 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 408 place count 23 transition count 28
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 25 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 414 place count 18 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 417 place count 15 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 417 place count 15 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 419 place count 14 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 421 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 423 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 425 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 428 place count 9 transition count 15
Applied a total of 428 rules in 45 ms. Remains 9 /230 variables (removed 221) and now considering 15/270 (removed 255) transitions.
[2024-05-31 22:05:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 9 cols
[2024-05-31 22:05:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:05:12] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-31 22:05:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-31 22:05:12] [INFO ] Invariant cache hit.
[2024-05-31 22:05:12] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-31 22:05:12] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-31 22:05:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-31 22:05:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/21 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 8 unsolved in 54 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/21 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/230 places, 15/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 9/230 places, 15/270 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-04 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(X(F(p1))))))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 220 transition count 260
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 220 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 214 transition count 253
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 214 transition count 253
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 209 transition count 247
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 209 transition count 247
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 205 transition count 241
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 205 transition count 241
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 201 transition count 236
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 201 transition count 236
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 198 transition count 233
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 198 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 197 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 197 transition count 232
Applied a total of 66 rules in 18 ms. Remains 197 /230 variables (removed 33) and now considering 232/270 (removed 38) transitions.
// Phase 1: matrix 232 rows 197 cols
[2024-05-31 22:05:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:05:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-31 22:05:13] [INFO ] Invariant cache hit.
[2024-05-31 22:05:13] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-31 22:05:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 232/429 variables, 197/199 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:05:16] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 3 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:05:17] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:05:18] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:05:18] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:05:18] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:05:18] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:05:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 219 constraints, problems are : Problem set: 0 solved, 231 unsolved in 8983 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/429 variables, 197/219 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 231/450 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/429 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 450 constraints, problems are : Problem set: 0 solved, 231 unsolved in 12335 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 20/20 constraints]
After SMT, in 21408ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 21412ms
Starting structural reductions in LTL mode, iteration 1 : 197/230 places, 232/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21653 ms. Remains : 197/230 places, 232/270 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-05
Stuttering criterion allowed to conclude after 352 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-05 finished in 21878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Graph (complete) has 458 edges and 230 vertex of which 228 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 227 transition count 233
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 193 transition count 233
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 69 place count 193 transition count 196
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 143 place count 156 transition count 196
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 148 place count 151 transition count 191
Iterating global reduction 2 with 5 rules applied. Total rules applied 153 place count 151 transition count 191
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 148 transition count 188
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 148 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 145 transition count 183
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 145 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 167 place count 143 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 143 transition count 181
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 281 place count 87 transition count 125
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 291 place count 77 transition count 106
Iterating global reduction 2 with 10 rules applied. Total rules applied 301 place count 77 transition count 106
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 311 place count 67 transition count 94
Iterating global reduction 2 with 10 rules applied. Total rules applied 321 place count 67 transition count 94
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 331 place count 57 transition count 75
Iterating global reduction 2 with 10 rules applied. Total rules applied 341 place count 57 transition count 75
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 351 place count 47 transition count 64
Iterating global reduction 2 with 10 rules applied. Total rules applied 361 place count 47 transition count 64
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 371 place count 37 transition count 45
Iterating global reduction 2 with 10 rules applied. Total rules applied 381 place count 37 transition count 45
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 391 place count 27 transition count 34
Iterating global reduction 2 with 10 rules applied. Total rules applied 401 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 403 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 405 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 24 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 24 transition count 29
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 410 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 412 place count 22 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 24 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 419 place count 17 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 423 place count 13 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 429 place count 10 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 430 place count 10 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 432 place count 8 transition count 14
Applied a total of 432 rules in 32 ms. Remains 8 /230 variables (removed 222) and now considering 14/270 (removed 256) transitions.
[2024-05-31 22:05:34] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-31 22:05:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:05:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 22:05:34] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-31 22:05:34] [INFO ] Invariant cache hit.
[2024-05-31 22:05:34] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-31 22:05:34] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-31 22:05:34] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-31 22:05:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 9 unsolved in 62 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/18 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 17 constraints, problems are : Problem set: 0 solved, 9 unsolved in 48 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/230 places, 14/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 8/230 places, 14/270 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-06 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 219 transition count 259
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 219 transition count 259
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 213 transition count 252
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 213 transition count 252
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 208 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 208 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 203 transition count 239
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 203 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 199 transition count 234
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 199 transition count 234
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 196 transition count 231
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 195 transition count 230
Applied a total of 70 rules in 16 ms. Remains 195 /230 variables (removed 35) and now considering 230/270 (removed 40) transitions.
// Phase 1: matrix 230 rows 195 cols
[2024-05-31 22:05:35] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 22:05:35] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 22:05:35] [INFO ] Invariant cache hit.
[2024-05-31 22:05:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-31 22:05:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:05:39] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:05:40] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
[2024-05-31 22:05:40] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:05:40] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:05:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:05:40] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:05:40] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 218 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9885 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 447 constraints, problems are : Problem set: 0 solved, 229 unsolved in 10952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
After SMT, in 20907ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 20912ms
Starting structural reductions in LTL mode, iteration 1 : 195/230 places, 230/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21143 ms. Remains : 195/230 places, 230/270 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 396 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-07 finished in 21603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(p0)||X(p1))))&&F(p2))))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 219 transition count 259
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 219 transition count 259
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 214 transition count 253
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 214 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 211 transition count 249
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 211 transition count 249
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 208 transition count 245
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 208 transition count 245
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 206 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 206 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 205 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 205 transition count 242
Applied a total of 50 rules in 17 ms. Remains 205 /230 variables (removed 25) and now considering 242/270 (removed 28) transitions.
// Phase 1: matrix 242 rows 205 cols
[2024-05-31 22:05:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:05:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 22:05:56] [INFO ] Invariant cache hit.
[2024-05-31 22:05:57] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-31 22:05:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 242/447 variables, 205/207 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:06:01] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:06:02] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:06:02] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:06:02] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:06:02] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 0/447 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 227 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/447 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 241/468 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/447 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 468 constraints, problems are : Problem set: 0 solved, 241 unsolved in 11295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 20/20 constraints]
After SMT, in 20787ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 20789ms
Starting structural reductions in LTL mode, iteration 1 : 205/230 places, 242/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20998 ms. Remains : 205/230 places, 242/270 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-08
Stuttering criterion allowed to conclude after 433 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-08 finished in 21327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((p1 U (G(p1)||(p1&&G(p0))))))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Graph (complete) has 458 edges and 230 vertex of which 228 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 227 transition count 232
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 192 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 191 transition count 231
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 73 place count 191 transition count 194
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 147 place count 154 transition count 194
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 151 place count 150 transition count 190
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 150 transition count 190
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 148 transition count 188
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 148 transition count 188
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 161 place count 146 transition count 185
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 146 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 165 place count 144 transition count 182
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 144 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 143 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 143 transition count 181
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 283 place count 86 transition count 124
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 293 place count 76 transition count 105
Iterating global reduction 3 with 10 rules applied. Total rules applied 303 place count 76 transition count 105
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 313 place count 66 transition count 93
Iterating global reduction 3 with 10 rules applied. Total rules applied 323 place count 66 transition count 93
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 332 place count 57 transition count 76
Iterating global reduction 3 with 9 rules applied. Total rules applied 341 place count 57 transition count 76
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 350 place count 48 transition count 66
Iterating global reduction 3 with 9 rules applied. Total rules applied 359 place count 48 transition count 66
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 368 place count 39 transition count 49
Iterating global reduction 3 with 9 rules applied. Total rules applied 377 place count 39 transition count 49
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 386 place count 30 transition count 39
Iterating global reduction 3 with 9 rules applied. Total rules applied 395 place count 30 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 397 place count 28 transition count 36
Iterating global reduction 3 with 2 rules applied. Total rules applied 399 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 400 place count 27 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 401 place count 27 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 402 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 404 place count 25 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 411 place count 20 transition count 25
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 415 place count 16 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 423 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 426 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 429 place count 9 transition count 15
Applied a total of 429 rules in 34 ms. Remains 9 /230 variables (removed 221) and now considering 15/270 (removed 255) transitions.
[2024-05-31 22:06:18] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2024-05-31 22:06:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 22:06:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 22:06:18] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2024-05-31 22:06:18] [INFO ] Invariant cache hit.
[2024-05-31 22:06:18] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-31 22:06:18] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-31 22:06:18] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2024-05-31 22:06:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 49 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/19 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 47 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/230 places, 15/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 9/230 places, 15/270 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-10
Stuttering criterion allowed to conclude after 59 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-10 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1)||(p2&&X(p0)))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 220 transition count 260
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 220 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 214 transition count 253
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 214 transition count 253
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 209 transition count 247
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 209 transition count 247
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 205 transition count 241
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 205 transition count 241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 202 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 202 transition count 238
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 200 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 200 transition count 236
Applied a total of 60 rules in 10 ms. Remains 200 /230 variables (removed 30) and now considering 236/270 (removed 34) transitions.
// Phase 1: matrix 236 rows 200 cols
[2024-05-31 22:06:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:06:18] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 22:06:18] [INFO ] Invariant cache hit.
[2024-05-31 22:06:18] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-31 22:06:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 236/436 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 220 constraints, problems are : Problem set: 0 solved, 235 unsolved in 10353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/436 variables, 200/220 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 235/455 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 455 constraints, problems are : Problem set: 0 solved, 235 unsolved in 11310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 18/18 constraints]
After SMT, in 21758ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 21761ms
Starting structural reductions in LTL mode, iteration 1 : 200/230 places, 236/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21976 ms. Remains : 200/230 places, 236/270 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1896 steps with 4 reset in 16 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-11 finished in 22159 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 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 219 transition count 259
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 219 transition count 259
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 213 transition count 252
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 213 transition count 252
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 208 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 208 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 203 transition count 239
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 203 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 199 transition count 234
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 199 transition count 234
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 196 transition count 231
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 195 transition count 230
Applied a total of 70 rules in 14 ms. Remains 195 /230 variables (removed 35) and now considering 230/270 (removed 40) transitions.
// Phase 1: matrix 230 rows 195 cols
[2024-05-31 22:06:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:06:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 22:06:40] [INFO ] Invariant cache hit.
[2024-05-31 22:06:40] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-31 22:06:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:06:44] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:06:45] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 218 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9906 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 447 constraints, problems are : Problem set: 0 solved, 229 unsolved in 11120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
After SMT, in 21103ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 21106ms
Starting structural reductions in LTL mode, iteration 1 : 195/230 places, 230/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21339 ms. Remains : 195/230 places, 230/270 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 184 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-12 finished in 21466 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 U !p1))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Graph (complete) has 458 edges and 230 vertex of which 228 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 227 transition count 232
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 192 transition count 232
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 71 place count 192 transition count 197
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 141 place count 157 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 153 transition count 193
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 153 transition count 193
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 151 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 151 transition count 191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 149 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 149 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 159 place count 147 transition count 185
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 147 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 146 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 146 transition count 184
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 277 place count 89 transition count 127
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 287 place count 79 transition count 108
Iterating global reduction 2 with 10 rules applied. Total rules applied 297 place count 79 transition count 108
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 307 place count 69 transition count 96
Iterating global reduction 2 with 10 rules applied. Total rules applied 317 place count 69 transition count 96
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 327 place count 59 transition count 77
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 59 transition count 77
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 347 place count 49 transition count 66
Iterating global reduction 2 with 10 rules applied. Total rules applied 357 place count 49 transition count 66
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 366 place count 40 transition count 49
Iterating global reduction 2 with 9 rules applied. Total rules applied 375 place count 40 transition count 49
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 384 place count 31 transition count 39
Iterating global reduction 2 with 9 rules applied. Total rules applied 393 place count 31 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 395 place count 29 transition count 36
Iterating global reduction 2 with 2 rules applied. Total rules applied 397 place count 29 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 398 place count 28 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 28 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 401 place count 28 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 28 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 404 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 407 place count 25 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 409 place count 23 transition count 29
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 409 place count 23 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 417 place count 19 transition count 25
Applied a total of 417 rules in 29 ms. Remains 19 /230 variables (removed 211) and now considering 25/270 (removed 245) transitions.
[2024-05-31 22:07:02] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 19 cols
[2024-05-31 22:07:02] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 22:07:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 22:07:02] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-05-31 22:07:02] [INFO ] Invariant cache hit.
[2024-05-31 22:07:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:07:02] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-31 22:07:02] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-31 22:07:02] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-05-31 22:07:02] [INFO ] Invariant cache hit.
[2024-05-31 22:07:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 21 constraints, problems are : Problem set: 0 solved, 24 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 45 constraints, problems are : Problem set: 0 solved, 24 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/230 places, 25/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 482 ms. Remains : 19/230 places, 25/270 transitions.
Stuttering acceptance computed with spot in 92 ms :[p1, p1]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-13
Product exploration explored 100000 steps with 711 reset in 165 ms.
Stack based approach found an accepted trace after 319 steps with 2 reset with depth 61 and stack size 52 in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-13 finished in 761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U G((!p0||G(!p1)))))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 219 transition count 259
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 219 transition count 259
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 213 transition count 252
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 213 transition count 252
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 208 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 208 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 203 transition count 239
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 203 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 199 transition count 234
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 199 transition count 234
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 196 transition count 231
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 195 transition count 230
Applied a total of 70 rules in 20 ms. Remains 195 /230 variables (removed 35) and now considering 230/270 (removed 40) transitions.
// Phase 1: matrix 230 rows 195 cols
[2024-05-31 22:07:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:07:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 22:07:02] [INFO ] Invariant cache hit.
[2024-05-31 22:07:03] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-31 22:07:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 3 ms to minimize.
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 22:07:07] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 218 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/218 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 447 constraints, problems are : Problem set: 0 solved, 229 unsolved in 11089 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 21/21 constraints]
After SMT, in 21105ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 21109ms
Starting structural reductions in LTL mode, iteration 1 : 195/230 places, 230/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21335 ms. Remains : 195/230 places, 230/270 transitions.
Stuttering acceptance computed with spot in 404 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (NOT p0), false, (AND p0 p1), (AND p1 (NOT p0)), true, (AND p1 p0), p1]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 162 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-14 finished in 21779 ms.
All properties solved by simple procedures.
Total runtime 207379 ms.
ITS solved all properties within timeout

BK_STOP 1717193244709

--------------------
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="DiscoveryGPU-PT-12b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DiscoveryGPU-PT-12b, 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 r488-tall-171631132700468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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