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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 02:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 12 02:03 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 97K 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-13b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716371016180

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 09:43:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 09:43:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:43:37] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-22 09:43:37] [INFO ] Transformed 380 places.
[2024-05-22 09:43:37] [INFO ] Transformed 404 transitions.
[2024-05-22 09:43:37] [INFO ] Found NUPN structural information;
[2024-05-22 09:43:37] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 89 place count 291 transition count 341
Iterating global reduction 1 with 63 rules applied. Total rules applied 152 place count 291 transition count 341
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 164 place count 279 transition count 329
Iterating global reduction 1 with 12 rules applied. Total rules applied 176 place count 279 transition count 329
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 187 place count 268 transition count 318
Iterating global reduction 1 with 11 rules applied. Total rules applied 198 place count 268 transition count 318
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 209 place count 257 transition count 307
Iterating global reduction 1 with 11 rules applied. Total rules applied 220 place count 257 transition count 307
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 229 place count 248 transition count 289
Iterating global reduction 1 with 9 rules applied. Total rules applied 238 place count 248 transition count 289
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 245 place count 241 transition count 282
Iterating global reduction 1 with 7 rules applied. Total rules applied 252 place count 241 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 258 place count 235 transition count 276
Iterating global reduction 1 with 6 rules applied. Total rules applied 264 place count 235 transition count 276
Applied a total of 264 rules in 114 ms. Remains 235 /380 variables (removed 145) and now considering 276/404 (removed 128) transitions.
// Phase 1: matrix 276 rows 235 cols
[2024-05-22 09:43:38] [INFO ] Computed 2 invariants in 25 ms
[2024-05-22 09:43:38] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-22 09:43:38] [INFO ] Invariant cache hit.
[2024-05-22 09:43:38] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-05-22 09:43:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 276/511 variables, 235/237 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 09:43:44] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 20 ms to minimize.
[2024-05-22 09:43:44] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-22 09:43:44] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-22 09:43:44] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-22 09:43:44] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-22 09:43:44] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-22 09:43:44] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-22 09:43:44] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 6 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 3 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 09:43:45] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 09:43:46] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-22 09:43:46] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-22 09:43:46] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 260 constraints, problems are : Problem set: 0 solved, 275 unsolved in 15238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/260 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 275/535 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 535 constraints, problems are : Problem set: 0 solved, 275 unsolved in 17265 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 23/23 constraints]
After SMT, in 32704ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 32731ms
Starting structural reductions in LTL mode, iteration 1 : 235/380 places, 276/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33444 ms. Remains : 235/380 places, 276/404 transitions.
Support contains 29 out of 235 places after structural reductions.
[2024-05-22 09:44:11] [INFO ] Flatten gal took : 65 ms
[2024-05-22 09:44:11] [INFO ] Flatten gal took : 28 ms
[2024-05-22 09:44:11] [INFO ] Input system was already deterministic with 276 transitions.
Support contains 28 out of 235 places (down from 29) after GAL structural reductions.
RANDOM walk for 15551 steps (34 resets) in 568 ms. (27 steps per ms) remains 0/24 properties
Computed a total of 43 stabilizing places and 43 stable transitions
Graph (complete) has 467 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(p1)))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 223 transition count 263
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 223 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 218 transition count 257
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 218 transition count 257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 215 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 215 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 213 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 210 transition count 248
Applied a total of 50 rules in 45 ms. Remains 210 /235 variables (removed 25) and now considering 248/276 (removed 28) transitions.
// Phase 1: matrix 248 rows 210 cols
[2024-05-22 09:44:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 09:44:12] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 09:44:12] [INFO ] Invariant cache hit.
[2024-05-22 09:44:13] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-22 09:44:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 09:44:18] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-22 09:44:19] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 5 ms to minimize.
[2024-05-22 09:44:19] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-22 09:44:19] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-22 09:44:19] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-22 09:44:19] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-22 09:44:19] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 17/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 229 constraints, problems are : Problem set: 0 solved, 247 unsolved in 12480 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 476 constraints, problems are : Problem set: 0 solved, 247 unsolved in 12236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 17/17 constraints]
After SMT, in 24860ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 24864ms
Starting structural reductions in LTL mode, iteration 1 : 210/235 places, 248/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25490 ms. Remains : 210/235 places, 248/276 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 427 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 53 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-13b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-00 finished in 26493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 265
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 265
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 220 transition count 259
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 220 transition count 259
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 217 transition count 256
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 217 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 215 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 214 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 214 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 213 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 212 transition count 250
Applied a total of 46 rules in 40 ms. Remains 212 /235 variables (removed 23) and now considering 250/276 (removed 26) transitions.
// Phase 1: matrix 250 rows 212 cols
[2024-05-22 09:44:38] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 09:44:39] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-22 09:44:39] [INFO ] Invariant cache hit.
[2024-05-22 09:44:39] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-05-22 09:44:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 250/462 variables, 212/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-22 09:44:43] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 3 ms to minimize.
[2024-05-22 09:44:44] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 27 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 09:44:45] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 236 constraints, problems are : Problem set: 0 solved, 249 unsolved in 12613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/462 variables, 212/236 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 249/485 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 485 constraints, problems are : Problem set: 0 solved, 249 unsolved in 12950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 22/22 constraints]
After SMT, in 25692ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 25696ms
Starting structural reductions in LTL mode, iteration 1 : 212/235 places, 250/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26304 ms. Remains : 212/235 places, 250/276 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-01 finished in 26478 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 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 265
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 265
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 220 transition count 259
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 220 transition count 259
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 217 transition count 256
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 217 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 215 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 214 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 214 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 213 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 212 transition count 250
Applied a total of 46 rules in 26 ms. Remains 212 /235 variables (removed 23) and now considering 250/276 (removed 26) transitions.
// Phase 1: matrix 250 rows 212 cols
[2024-05-22 09:45:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:45:05] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 09:45:05] [INFO ] Invariant cache hit.
[2024-05-22 09:45:05] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-05-22 09:45:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 250/462 variables, 212/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-05-22 09:45:10] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 3 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-22 09:45:11] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-22 09:45:12] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 237 constraints, problems are : Problem set: 0 solved, 249 unsolved in 12523 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/462 variables, 212/237 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 249/486 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 486 constraints, problems are : Problem set: 0 solved, 249 unsolved in 14395 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 23/23 constraints]
After SMT, in 27005ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 27008ms
Starting structural reductions in LTL mode, iteration 1 : 212/235 places, 250/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27398 ms. Remains : 212/235 places, 250/276 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 20549 steps with 49 reset in 49 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-02 finished in 27538 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) U (p1&&F(p2)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 266
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 222 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 222 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 220 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 220 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 219 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 219 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 218 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 218 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 217 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 217 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 216 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 216 transition count 255
Applied a total of 38 rules in 13 ms. Remains 216 /235 variables (removed 19) and now considering 255/276 (removed 21) transitions.
// Phase 1: matrix 255 rows 216 cols
[2024-05-22 09:45:32] [INFO ] Computed 2 invariants in 13 ms
[2024-05-22 09:45:33] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 09:45:33] [INFO ] Invariant cache hit.
[2024-05-22 09:45:33] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-22 09:45:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 255/471 variables, 216/218 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 09:45:37] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-22 09:45:37] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-22 09:45:37] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-22 09:45:37] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 5 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-22 09:45:38] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-22 09:45:39] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 242 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12786 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/471 variables, 216/242 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 254/496 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 496 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 24/24 constraints]
After SMT, in 26378ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 26398ms
Starting structural reductions in LTL mode, iteration 1 : 216/235 places, 255/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26703 ms. Remains : 216/235 places, 255/276 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-05 finished in 26879 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 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 223 transition count 263
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 223 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 218 transition count 257
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 218 transition count 257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 215 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 215 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 213 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 210 transition count 248
Applied a total of 50 rules in 15 ms. Remains 210 /235 variables (removed 25) and now considering 248/276 (removed 28) transitions.
// Phase 1: matrix 248 rows 210 cols
[2024-05-22 09:45:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:45:59] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 09:45:59] [INFO ] Invariant cache hit.
[2024-05-22 09:46:00] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-22 09:46:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 09:46:04] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-22 09:46:05] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-22 09:46:05] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-22 09:46:05] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-22 09:46:05] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 09:46:05] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 3 ms to minimize.
[2024-05-22 09:46:05] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-22 09:46:05] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-22 09:46:05] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 17/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 229 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11525 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 476 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 17/17 constraints]
After SMT, in 23586ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 23588ms
Starting structural reductions in LTL mode, iteration 1 : 210/235 places, 248/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23884 ms. Remains : 210/235 places, 248/276 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-06 finished in 23976 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((F(p1)&&p0))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 223 transition count 263
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 223 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 218 transition count 257
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 218 transition count 257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 215 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 215 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 213 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 210 transition count 248
Applied a total of 50 rules in 19 ms. Remains 210 /235 variables (removed 25) and now considering 248/276 (removed 28) transitions.
[2024-05-22 09:46:23] [INFO ] Invariant cache hit.
[2024-05-22 09:46:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 09:46:23] [INFO ] Invariant cache hit.
[2024-05-22 09:46:23] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-22 09:46:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-22 09:46:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 09:46:29] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 09:46:29] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 17/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 229 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 476 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11854 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 17/17 constraints]
After SMT, in 23269ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 23272ms
Starting structural reductions in LTL mode, iteration 1 : 210/235 places, 248/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23501 ms. Remains : 210/235 places, 248/276 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-07 finished in 23661 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 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Graph (complete) has 467 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 232 transition count 235
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 194 transition count 235
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 77 place count 194 transition count 198
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 151 place count 157 transition count 198
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 157 place count 151 transition count 191
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 151 transition count 191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 149 transition count 189
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 149 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 148 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 148 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 147 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 147 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 146 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 146 transition count 185
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 291 place count 87 transition count 126
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 303 place count 75 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 315 place count 75 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 327 place count 63 transition count 89
Iterating global reduction 2 with 12 rules applied. Total rules applied 339 place count 63 transition count 89
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 350 place count 52 transition count 68
Iterating global reduction 2 with 11 rules applied. Total rules applied 361 place count 52 transition count 68
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 372 place count 41 transition count 56
Iterating global reduction 2 with 11 rules applied. Total rules applied 383 place count 41 transition count 56
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 394 place count 30 transition count 35
Iterating global reduction 2 with 11 rules applied. Total rules applied 405 place count 30 transition count 35
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 416 place count 19 transition count 23
Iterating global reduction 2 with 11 rules applied. Total rules applied 427 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 428 place count 18 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 18 transition count 22
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 430 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 434 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 435 place count 14 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 435 place count 14 transition count 16
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 439 place count 12 transition count 16
Applied a total of 439 rules in 100 ms. Remains 12 /235 variables (removed 223) and now considering 16/276 (removed 260) transitions.
[2024-05-22 09:46:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2024-05-22 09:46:47] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 09:46:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 09:46:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 09:46:47] [INFO ] Invariant cache hit.
[2024-05-22 09:46:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:46:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-22 09:46:47] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 09:46:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 09:46:47] [INFO ] Invariant cache hit.
[2024-05-22 09:46:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 687ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 693ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/235 places, 16/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 876 ms. Remains : 12/235 places, 16/276 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-08
Product exploration explored 100000 steps with 660 reset in 188 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-08 finished in 1114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((((X(p0) U p1)&&F(G(p1))) U p2)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 267
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 267
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 224 transition count 264
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 224 transition count 264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 222 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 222 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 220 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 220 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 219 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 219 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 218 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 218 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 217 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 217 transition count 256
Applied a total of 36 rules in 58 ms. Remains 217 /235 variables (removed 18) and now considering 256/276 (removed 20) transitions.
// Phase 1: matrix 256 rows 217 cols
[2024-05-22 09:46:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:46:48] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 09:46:48] [INFO ] Invariant cache hit.
[2024-05-22 09:46:49] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-22 09:46:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/473 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 09:46:54] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-22 09:46:55] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/473 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 242 constraints, problems are : Problem set: 0 solved, 255 unsolved in 13046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/473 variables, 217/242 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 255/497 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/473 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 497 constraints, problems are : Problem set: 0 solved, 255 unsolved in 14634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 23/23 constraints]
After SMT, in 27769ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 27771ms
Starting structural reductions in LTL mode, iteration 1 : 217/235 places, 256/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28256 ms. Remains : 217/235 places, 256/276 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-09
Stuttering criterion allowed to conclude after 441 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-09 finished in 28590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 223 transition count 263
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 223 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 218 transition count 257
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 218 transition count 257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 215 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 215 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 213 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 210 transition count 248
Applied a total of 50 rules in 20 ms. Remains 210 /235 variables (removed 25) and now considering 248/276 (removed 28) transitions.
// Phase 1: matrix 248 rows 210 cols
[2024-05-22 09:47:17] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 09:47:17] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 09:47:17] [INFO ] Invariant cache hit.
[2024-05-22 09:47:17] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-22 09:47:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 09:47:21] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-22 09:47:21] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-22 09:47:21] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-22 09:47:21] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-22 09:47:21] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 09:47:21] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 09:47:22] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 17/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 229 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11809 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 476 constraints, problems are : Problem set: 0 solved, 247 unsolved in 12612 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 17/17 constraints]
After SMT, in 24502ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 24505ms
Starting structural reductions in LTL mode, iteration 1 : 210/235 places, 248/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24728 ms. Remains : 210/235 places, 248/276 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 427 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Detected a total of 41/210 stabilizing places and 41/248 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-13b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-11 finished in 25216 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&&F((p1&&X(X(p2)))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 224 transition count 264
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 224 transition count 264
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 221 transition count 261
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 221 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 220 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 220 transition count 260
Applied a total of 30 rules in 9 ms. Remains 220 /235 variables (removed 15) and now considering 260/276 (removed 16) transitions.
// Phase 1: matrix 260 rows 220 cols
[2024-05-22 09:47:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:47:42] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 09:47:42] [INFO ] Invariant cache hit.
[2024-05-22 09:47:42] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-22 09:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/480 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-22 09:47:47] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-22 09:47:48] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 245 constraints, problems are : Problem set: 0 solved, 259 unsolved in 13196 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/480 variables, 220/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 259/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 504 constraints, problems are : Problem set: 0 solved, 259 unsolved in 13036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 23/23 constraints]
After SMT, in 26320ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 26323ms
Starting structural reductions in LTL mode, iteration 1 : 220/235 places, 260/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26548 ms. Remains : 220/235 places, 260/276 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-12 finished in 26836 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 U (p1||G(p0))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Graph (complete) has 467 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 232 transition count 236
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 195 transition count 236
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 75 place count 195 transition count 200
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 147 place count 159 transition count 200
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 153 transition count 193
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 153 transition count 193
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 151 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 151 transition count 191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 150 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 150 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 149 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 149 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 148 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 148 transition count 187
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 285 place count 90 transition count 129
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 297 place count 78 transition count 105
Iterating global reduction 2 with 12 rules applied. Total rules applied 309 place count 78 transition count 105
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 321 place count 66 transition count 92
Iterating global reduction 2 with 12 rules applied. Total rules applied 333 place count 66 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 344 place count 55 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 355 place count 55 transition count 71
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 366 place count 44 transition count 59
Iterating global reduction 2 with 11 rules applied. Total rules applied 377 place count 44 transition count 59
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 387 place count 34 transition count 40
Iterating global reduction 2 with 10 rules applied. Total rules applied 397 place count 34 transition count 40
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 407 place count 24 transition count 29
Iterating global reduction 2 with 10 rules applied. Total rules applied 417 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 418 place count 23 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 419 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 420 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 421 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 423 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 425 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 426 place count 19 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 426 place count 19 transition count 21
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 432 place count 16 transition count 21
Applied a total of 432 rules in 34 ms. Remains 16 /235 variables (removed 219) and now considering 21/276 (removed 255) transitions.
[2024-05-22 09:48:09] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 16 cols
[2024-05-22 09:48:09] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 09:48:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 09:48:09] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-22 09:48:09] [INFO ] Invariant cache hit.
[2024-05-22 09:48:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:48:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 09:48:09] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 09:48:09] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-22 09:48:09] [INFO ] Invariant cache hit.
[2024-05-22 09:48:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 18 constraints, problems are : Problem set: 0 solved, 20 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 38 constraints, problems are : Problem set: 0 solved, 20 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/235 places, 21/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 16/235 places, 21/276 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-14
Product exploration explored 100000 steps with 923 reset in 225 ms.
Stack based approach found an accepted trace after 13882 steps with 114 reset with depth 28 and stack size 25 in 39 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-14 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(F(p1))) U (G((!p0||X(F(p1))))||((!p0||X(F(p1)))&&X(p0)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 276/276 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 224 transition count 264
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 224 transition count 264
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 219 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 219 transition count 258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 216 transition count 255
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 216 transition count 255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 214 transition count 253
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 214 transition count 253
Applied a total of 42 rules in 26 ms. Remains 214 /235 variables (removed 21) and now considering 253/276 (removed 23) transitions.
// Phase 1: matrix 253 rows 214 cols
[2024-05-22 09:48:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:48:10] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-22 09:48:10] [INFO ] Invariant cache hit.
[2024-05-22 09:48:10] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-22 09:48:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 253/467 variables, 214/216 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-22 09:48:14] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-22 09:48:14] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-22 09:48:14] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-22 09:48:14] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-22 09:48:15] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-22 09:48:16] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-22 09:48:16] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-22 09:48:16] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 17/233 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/467 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 233 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/467 variables, 214/233 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 252/485 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 485 constraints, problems are : Problem set: 0 solved, 252 unsolved in 13119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 17/17 constraints]
After SMT, in 25313ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 25316ms
Starting structural reductions in LTL mode, iteration 1 : 214/235 places, 253/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25849 ms. Remains : 214/235 places, 253/276 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-15
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-15 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-15 finished in 25941 ms.
All properties solved by simple procedures.
Total runtime 298529 ms.
ITS solved all properties within timeout

BK_STOP 1716371315979

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;