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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 02:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 02:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 02:02 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 75K 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-10b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716364430030

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:53:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:53:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:53:51] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-22 07:53:51] [INFO ] Transformed 296 places.
[2024-05-22 07:53:51] [INFO ] Transformed 314 transitions.
[2024-05-22 07:53:51] [INFO ] Found NUPN structural information;
[2024-05-22 07:53:51] [INFO ] Parsed PT model containing 296 places and 314 transitions and 819 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 279 transition count 314
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 59 place count 237 transition count 272
Iterating global reduction 1 with 42 rules applied. Total rules applied 101 place count 237 transition count 272
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 111 place count 227 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 121 place count 227 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 128 place count 220 transition count 255
Iterating global reduction 1 with 7 rules applied. Total rules applied 135 place count 220 transition count 255
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 142 place count 213 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 149 place count 213 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 210 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 210 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 208 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 208 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 161 place count 206 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 163 place count 206 transition count 238
Applied a total of 163 rules in 93 ms. Remains 206 /296 variables (removed 90) and now considering 238/314 (removed 76) transitions.
// Phase 1: matrix 238 rows 206 cols
[2024-05-22 07:53:51] [INFO ] Computed 2 invariants in 18 ms
[2024-05-22 07:53:51] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-22 07:53:51] [INFO ] Invariant cache hit.
[2024-05-22 07:53:52] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-05-22 07:53:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (OVERLAPS) 238/441 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-22 07:53:56] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 17 ms to minimize.
[2024-05-22 07:53:56] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 3 ms to minimize.
[2024-05-22 07:53:56] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:53:56] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 07:53:56] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-05-22 07:53:56] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 3 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:53:57] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 17/222 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 3/444 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 225 constraints, problems are : Problem set: 0 solved, 237 unsolved in 12559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/441 variables, 203/222 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 234/456 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 3/444 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 3/462 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 0/444 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 462 constraints, problems are : Problem set: 0 solved, 237 unsolved in 18027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 17/17 constraints]
After SMT, in 30743ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 30758ms
Starting structural reductions in LTL mode, iteration 1 : 206/296 places, 238/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31353 ms. Remains : 206/296 places, 238/314 transitions.
Support contains 33 out of 206 places after structural reductions.
[2024-05-22 07:54:23] [INFO ] Flatten gal took : 50 ms
[2024-05-22 07:54:23] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:54:23] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 32 out of 206 places (down from 33) after GAL structural reductions.
RANDOM walk for 9067 steps (25 resets) in 407 ms. (22 steps per ms) remains 0/18 properties
Computed a total of 34 stabilizing places and 34 stable transitions
Graph (complete) has 397 edges and 206 vertex of which 197 are kept as prefixes of interest. Removing 9 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' '!(X(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 191 transition count 226
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 191 transition count 226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 185 transition count 217
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 185 transition count 217
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 180 transition count 212
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 180 transition count 212
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 175 transition count 207
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 175 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 173 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 173 transition count 203
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 171 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 171 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 169 transition count 199
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 169 transition count 199
Applied a total of 71 rules in 29 ms. Remains 169 /206 variables (removed 37) and now considering 199/238 (removed 39) transitions.
// Phase 1: matrix 199 rows 169 cols
[2024-05-22 07:54:23] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 07:54:23] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 07:54:23] [INFO ] Invariant cache hit.
[2024-05-22 07:54:24] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-22 07:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/368 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 07:54:26] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:54:26] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:54:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
[2024-05-22 07:54:27] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 19/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 190 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/368 variables, 169/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 198/388 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 388 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 19/19 constraints]
After SMT, in 15730ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 15739ms
Starting structural reductions in LTL mode, iteration 1 : 169/206 places, 199/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16054 ms. Remains : 169/206 places, 199/238 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 340 edges and 169 vertex of which 167 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-01 finished in 16773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 190 transition count 224
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 190 transition count 224
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 184 transition count 216
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 184 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 179 transition count 211
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 179 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 176 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 176 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 175 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 175 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 174 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 174 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 173 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 173 transition count 204
Applied a total of 63 rules in 24 ms. Remains 173 /206 variables (removed 33) and now considering 204/238 (removed 34) transitions.
// Phase 1: matrix 204 rows 173 cols
[2024-05-22 07:54:40] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 07:54:40] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 07:54:40] [INFO ] Invariant cache hit.
[2024-05-22 07:54:40] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-22 07:54:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 204/377 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 3 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 19/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 194 constraints, problems are : Problem set: 0 solved, 203 unsolved in 8091 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/377 variables, 173/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 203/397 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 397 constraints, problems are : Problem set: 0 solved, 203 unsolved in 8648 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 19/19 constraints]
After SMT, in 16801ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 16804ms
Starting structural reductions in LTL mode, iteration 1 : 173/206 places, 204/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17001 ms. Remains : 173/206 places, 204/238 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 349 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-02 finished in 17280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 190 transition count 224
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 190 transition count 224
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 184 transition count 216
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 184 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 179 transition count 211
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 179 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 175 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 175 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 173 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 173 transition count 203
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 171 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 171 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 169 transition count 199
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 169 transition count 199
Applied a total of 71 rules in 21 ms. Remains 169 /206 variables (removed 37) and now considering 199/238 (removed 39) transitions.
// Phase 1: matrix 199 rows 169 cols
[2024-05-22 07:54:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:54:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 07:54:57] [INFO ] Invariant cache hit.
[2024-05-22 07:54:57] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-22 07:54:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/368 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 07:55:00] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:55:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
[2024-05-22 07:55:00] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:55:00] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:55:00] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:55:01] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 18/189 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 189 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7751 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/368 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 198/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 387 constraints, problems are : Problem set: 0 solved, 198 unsolved in 8072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 18/18 constraints]
After SMT, in 15891ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 15893ms
Starting structural reductions in LTL mode, iteration 1 : 169/206 places, 199/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16105 ms. Remains : 169/206 places, 199/238 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-03
Stuttering criterion allowed to conclude after 350 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-03 finished in 16192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Graph (complete) has 397 edges and 206 vertex of which 201 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 200 transition count 201
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 168 transition count 201
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 65 place count 168 transition count 170
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 127 place count 137 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 132 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 132 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 137 place count 132 transition count 162
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 139 place count 131 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 129 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 129 transition count 160
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 237 place count 82 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 244 place count 75 transition count 100
Iterating global reduction 2 with 7 rules applied. Total rules applied 251 place count 75 transition count 100
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 258 place count 68 transition count 91
Iterating global reduction 2 with 7 rules applied. Total rules applied 265 place count 68 transition count 91
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 271 place count 62 transition count 80
Iterating global reduction 2 with 6 rules applied. Total rules applied 277 place count 62 transition count 80
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 283 place count 56 transition count 73
Iterating global reduction 2 with 6 rules applied. Total rules applied 289 place count 56 transition count 73
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 295 place count 50 transition count 62
Iterating global reduction 2 with 6 rules applied. Total rules applied 301 place count 50 transition count 62
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 307 place count 44 transition count 55
Iterating global reduction 2 with 6 rules applied. Total rules applied 313 place count 44 transition count 55
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 315 place count 42 transition count 52
Iterating global reduction 2 with 2 rules applied. Total rules applied 317 place count 42 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 41 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 41 transition count 51
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 321 place count 41 transition count 49
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 323 place count 41 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 325 place count 39 transition count 47
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 43 edges and 37 vertex of which 34 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 336 place count 34 transition count 36
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 345 place count 26 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 346 place count 25 transition count 35
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 358 place count 19 transition count 29
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 360 place count 19 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 364 place count 15 transition count 23
Applied a total of 364 rules in 91 ms. Remains 15 /206 variables (removed 191) and now considering 23/238 (removed 215) transitions.
[2024-05-22 07:55:14] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 15 cols
[2024-05-22 07:55:14] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 07:55:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 07:55:14] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-05-22 07:55:14] [INFO ] Invariant cache hit.
[2024-05-22 07:55:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 07:55:14] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-22 07:55:14] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-05-22 07:55:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/31 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/32 variables, and 15 constraints, problems are : Problem set: 0 solved, 14 unsolved in 104 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/32 variables, and 29 constraints, problems are : Problem set: 0 solved, 14 unsolved in 92 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/206 places, 23/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 15/206 places, 23/238 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-04
Stuttering criterion allowed to conclude after 854 steps with 26 reset in 4 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-04 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F((p1||G(!p0)))))))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 189 transition count 223
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 189 transition count 223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 183 transition count 214
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 183 transition count 214
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 178 transition count 209
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 178 transition count 209
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 174 transition count 205
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 174 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 172 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 172 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 170 transition count 199
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 170 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 168 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 168 transition count 197
Applied a total of 73 rules in 29 ms. Remains 168 /206 variables (removed 38) and now considering 197/238 (removed 41) transitions.
// Phase 1: matrix 197 rows 168 cols
[2024-05-22 07:55:14] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 07:55:14] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-22 07:55:14] [INFO ] Invariant cache hit.
[2024-05-22 07:55:14] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 07:55:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/365 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-05-22 07:55:17] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:55:18] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:55:18] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-22 07:55:18] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:55:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:18] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:55:18] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:55:18] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:55:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 18/188 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 188 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7614 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/365 variables, 168/188 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 196/384 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 384 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 18/18 constraints]
After SMT, in 15380ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15381ms
Starting structural reductions in LTL mode, iteration 1 : 168/206 places, 197/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15728 ms. Remains : 168/206 places, 197/238 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-06
Stuttering criterion allowed to conclude after 1327 steps with 3 reset in 8 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-06 finished in 15909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 189 transition count 223
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 189 transition count 223
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 182 transition count 213
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 182 transition count 213
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 176 transition count 207
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 176 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 171 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 171 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 169 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 167 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 167 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 165 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 165 transition count 194
Applied a total of 79 rules in 10 ms. Remains 165 /206 variables (removed 41) and now considering 194/238 (removed 44) transitions.
// Phase 1: matrix 194 rows 165 cols
[2024-05-22 07:55:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:55:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 07:55:30] [INFO ] Invariant cache hit.
[2024-05-22 07:55:30] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-22 07:55:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:55:34] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 187 constraints, problems are : Problem set: 0 solved, 193 unsolved in 6355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 380 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7811 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 20/20 constraints]
After SMT, in 14223ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 14225ms
Starting structural reductions in LTL mode, iteration 1 : 165/206 places, 194/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14430 ms. Remains : 165/206 places, 194/238 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 351 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-07 finished in 14618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Graph (complete) has 397 edges and 206 vertex of which 197 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 196 transition count 198
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 163 transition count 198
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 67 place count 163 transition count 167
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 129 place count 132 transition count 167
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 136 place count 125 transition count 157
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 125 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 143 place count 125 transition count 156
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 145 place count 124 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 120 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 120 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 119 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 119 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 118 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 118 transition count 149
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 247 place count 73 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 255 place count 65 transition count 89
Iterating global reduction 2 with 8 rules applied. Total rules applied 263 place count 65 transition count 89
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 271 place count 57 transition count 79
Iterating global reduction 2 with 8 rules applied. Total rules applied 279 place count 57 transition count 79
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 287 place count 49 transition count 64
Iterating global reduction 2 with 8 rules applied. Total rules applied 295 place count 49 transition count 64
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 303 place count 41 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 311 place count 41 transition count 55
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 319 place count 33 transition count 40
Iterating global reduction 2 with 8 rules applied. Total rules applied 327 place count 33 transition count 40
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 334 place count 26 transition count 32
Iterating global reduction 2 with 7 rules applied. Total rules applied 341 place count 26 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 343 place count 24 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 23 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 23 transition count 28
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 348 place count 23 transition count 27
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 349 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 351 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 19 vertex of which 16 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 2 with 7 rules applied. Total rules applied 358 place count 16 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 362 place count 12 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 366 place count 10 transition count 16
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 4 with 2 rules applied. Total rules applied 368 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 369 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 370 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 372 place count 7 transition count 12
Applied a total of 372 rules in 28 ms. Remains 7 /206 variables (removed 199) and now considering 12/238 (removed 226) transitions.
[2024-05-22 07:55:44] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2024-05-22 07:55:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 07:55:44] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 07:55:44] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2024-05-22 07:55:44] [INFO ] Invariant cache hit.
[2024-05-22 07:55:44] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2024-05-22 07:55:44] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-22 07:55:44] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2024-05-22 07:55:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/206 places, 12/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 7/206 places, 12/238 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-08 finished in 233 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&&G(F(p1))))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 191 transition count 225
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 191 transition count 225
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 185 transition count 216
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 185 transition count 216
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 179 transition count 210
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 179 transition count 210
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 174 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 174 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 172 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 172 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 170 transition count 199
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 170 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 168 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 168 transition count 197
Applied a total of 73 rules in 18 ms. Remains 168 /206 variables (removed 38) and now considering 197/238 (removed 41) transitions.
// Phase 1: matrix 197 rows 168 cols
[2024-05-22 07:55:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:55:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 07:55:45] [INFO ] Invariant cache hit.
[2024-05-22 07:55:45] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 07:55:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/365 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-05-22 07:55:48] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 17/187 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 187 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/365 variables, 168/187 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 196/383 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 383 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
After SMT, in 16213ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 16215ms
Starting structural reductions in LTL mode, iteration 1 : 168/206 places, 197/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16396 ms. Remains : 168/206 places, 197/238 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-09
Stuttering criterion allowed to conclude after 1441 steps with 5 reset in 3 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-09 finished in 16619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Graph (complete) has 397 edges and 206 vertex of which 199 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 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 198 transition count 198
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 164 transition count 198
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 69 place count 164 transition count 168
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 129 place count 134 transition count 168
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 136 place count 127 transition count 158
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 127 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 143 place count 127 transition count 157
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 145 place count 126 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 122 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 122 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 121 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 121 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 120 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 120 transition count 150
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 251 place count 73 transition count 103
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 260 place count 64 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 269 place count 64 transition count 86
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 278 place count 55 transition count 75
Iterating global reduction 2 with 9 rules applied. Total rules applied 287 place count 55 transition count 75
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 295 place count 47 transition count 60
Iterating global reduction 2 with 8 rules applied. Total rules applied 303 place count 47 transition count 60
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 311 place count 39 transition count 51
Iterating global reduction 2 with 8 rules applied. Total rules applied 319 place count 39 transition count 51
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 327 place count 31 transition count 36
Iterating global reduction 2 with 8 rules applied. Total rules applied 335 place count 31 transition count 36
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 342 place count 24 transition count 28
Iterating global reduction 2 with 7 rules applied. Total rules applied 349 place count 24 transition count 28
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 22 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 22 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 354 place count 21 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 21 transition count 24
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 356 place count 21 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 358 place count 19 transition count 21
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 17 vertex of which 14 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 363 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 365 place count 12 transition count 16
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 371 place count 9 transition count 13
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 372 place count 9 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 374 place count 7 transition count 10
Applied a total of 374 rules in 38 ms. Remains 7 /206 variables (removed 199) and now considering 10/238 (removed 228) transitions.
[2024-05-22 07:56:01] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 7 cols
[2024-05-22 07:56:01] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 07:56:01] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 07:56:01] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 07:56:01] [INFO ] Invariant cache hit.
[2024-05-22 07:56:01] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-22 07:56:01] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-22 07:56:01] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 07:56:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/14 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/14 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/206 places, 10/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 7/206 places, 10/238 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-10 finished in 189 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 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 190 transition count 224
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 190 transition count 224
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 184 transition count 215
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 184 transition count 215
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 179 transition count 210
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 179 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 175 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 175 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 174 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 174 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 173 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 173 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 172 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 172 transition count 202
Applied a total of 65 rules in 16 ms. Remains 172 /206 variables (removed 34) and now considering 202/238 (removed 36) transitions.
// Phase 1: matrix 202 rows 172 cols
[2024-05-22 07:56:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:56:02] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 07:56:02] [INFO ] Invariant cache hit.
[2024-05-22 07:56:02] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-22 07:56:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 202/374 variables, 172/174 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-22 07:56:04] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-22 07:56:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:05] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 13/187 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 187 constraints, problems are : Problem set: 0 solved, 201 unsolved in 7630 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/374 variables, 172/187 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 201/388 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 388 constraints, problems are : Problem set: 0 solved, 201 unsolved in 8887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 13/13 constraints]
After SMT, in 16572ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 16575ms
Starting structural reductions in LTL mode, iteration 1 : 172/206 places, 202/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16754 ms. Remains : 172/206 places, 202/238 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-12 finished in 16865 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 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 189 transition count 223
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 189 transition count 223
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 182 transition count 213
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 182 transition count 213
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 176 transition count 207
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 176 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 171 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 171 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 169 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 167 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 167 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 165 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 165 transition count 194
Applied a total of 79 rules in 20 ms. Remains 165 /206 variables (removed 41) and now considering 194/238 (removed 44) transitions.
// Phase 1: matrix 194 rows 165 cols
[2024-05-22 07:56:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:56:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 07:56:18] [INFO ] Invariant cache hit.
[2024-05-22 07:56:19] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-22 07:56:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 07:56:21] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-22 07:56:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-22 07:56:21] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:56:21] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-05-22 07:56:21] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:56:21] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:56:21] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:56:21] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:56:22] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 187 constraints, problems are : Problem set: 0 solved, 193 unsolved in 6382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 380 constraints, problems are : Problem set: 0 solved, 193 unsolved in 8043 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 20/20 constraints]
After SMT, in 14476ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 14478ms
Starting structural reductions in LTL mode, iteration 1 : 165/206 places, 194/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14665 ms. Remains : 165/206 places, 194/238 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-13 finished in 14760 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(((p1&&G(p2))||p0))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 238
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 190 transition count 224
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 190 transition count 224
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 183 transition count 214
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 183 transition count 214
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 177 transition count 208
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 177 transition count 208
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 172 transition count 203
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 172 transition count 203
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 170 transition count 199
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 170 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 168 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 168 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 167 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 167 transition count 196
Applied a total of 75 rules in 16 ms. Remains 167 /206 variables (removed 39) and now considering 196/238 (removed 42) transitions.
// Phase 1: matrix 196 rows 167 cols
[2024-05-22 07:56:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:56:33] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 07:56:33] [INFO ] Invariant cache hit.
[2024-05-22 07:56:33] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-22 07:56:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 196/363 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:56:36] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 11/180 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 180 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7068 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/363 variables, 167/180 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 195/375 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 195 unsolved in 8203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 11/11 constraints]
After SMT, in 15332ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 15334ms
Starting structural reductions in LTL mode, iteration 1 : 167/206 places, 196/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15515 ms. Remains : 167/206 places, 196/238 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 282 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-15 finished in 15675 ms.
All properties solved by simple procedures.
Total runtime 178013 ms.
ITS solved all properties within timeout

BK_STOP 1716364609277

--------------------
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 LTLCardinality -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-10b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10b.tgz
mv DiscoveryGPU-PT-10b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;