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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 02:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 02:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 02:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 75K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716364619127

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-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:57:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:57:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:57:00] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 07:57:00] [INFO ] Transformed 296 places.
[2024-05-22 07:57:00] [INFO ] Transformed 314 transitions.
[2024-05-22 07:57:00] [INFO ] Found NUPN structural information;
[2024-05-22 07:57:00] [INFO ] Parsed PT model containing 296 places and 314 transitions and 819 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 276 transition count 314
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 67 place count 229 transition count 267
Iterating global reduction 1 with 47 rules applied. Total rules applied 114 place count 229 transition count 267
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 124 place count 219 transition count 257
Iterating global reduction 1 with 10 rules applied. Total rules applied 134 place count 219 transition count 257
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 211 transition count 249
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 211 transition count 249
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 157 place count 204 transition count 242
Iterating global reduction 1 with 7 rules applied. Total rules applied 164 place count 204 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 201 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 201 transition count 236
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 198 transition count 233
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 198 transition count 233
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 179 place count 195 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 182 place count 195 transition count 230
Applied a total of 182 rules in 89 ms. Remains 195 /296 variables (removed 101) and now considering 230/314 (removed 84) transitions.
// Phase 1: matrix 230 rows 195 cols
[2024-05-22 07:57:00] [INFO ] Computed 2 invariants in 16 ms
[2024-05-22 07:57:00] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-22 07:57:00] [INFO ] Invariant cache hit.
[2024-05-22 07:57:01] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-22 07:57:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 07:57:05] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 15 ms to minimize.
[2024-05-22 07:57:05] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:57:05] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-22 07:57:05] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-22 07:57:05] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:57:05] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 2 ms to minimize.
[2024-05-22 07:57:05] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-22 07:57:05] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-22 07:57:06] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:57:06] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:57:06] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:57:06] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-22 07:57:06] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 210 constraints, problems are : Problem set: 0 solved, 229 unsolved in 10624 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/210 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/439 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 07:57:14] [INFO ] Deduced a trap composed of 128 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 0/425 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 440 constraints, problems are : Problem set: 0 solved, 229 unsolved in 14868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 14/14 constraints]
After SMT, in 25664ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 25686ms
Starting structural reductions in LTL mode, iteration 1 : 195/296 places, 230/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26194 ms. Remains : 195/296 places, 230/314 transitions.
Support contains 29 out of 195 places after structural reductions.
[2024-05-22 07:57:26] [INFO ] Flatten gal took : 50 ms
[2024-05-22 07:57:27] [INFO ] Flatten gal took : 24 ms
[2024-05-22 07:57:27] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (122 resets) in 983 ms. (40 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40002 steps (22 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
[2024-05-22 07:57:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/97 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 271/368 variables, 133/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 50/418 variables, 42/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/425 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/425 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/97 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 271/368 variables, 133/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 50/418 variables, 42/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/425 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:57:27] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Int declared 425/425 variables, and 199 constraints, problems are : Problem set: 1 solved, 0 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 499ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 386 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(F((p2||X(p2)))))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 185 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 185 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 179 transition count 210
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 179 transition count 210
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 174 transition count 205
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 174 transition count 205
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 170 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 170 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 169 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 169 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 168 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 168 transition count 198
Applied a total of 54 rules in 26 ms. Remains 168 /195 variables (removed 27) and now considering 198/230 (removed 32) transitions.
// Phase 1: matrix 198 rows 168 cols
[2024-05-22 07:57:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:57:28] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-22 07:57:28] [INFO ] Invariant cache hit.
[2024-05-22 07:57:28] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-22 07:57:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 198/366 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:57:31] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:57:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 18/188 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 188 constraints, problems are : Problem set: 0 solved, 197 unsolved in 7618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/366 variables, 168/188 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 197/385 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 385 constraints, problems are : Problem set: 0 solved, 197 unsolved in 8891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 18/18 constraints]
After SMT, in 16575ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 16578ms
Starting structural reductions in LTL mode, iteration 1 : 168/195 places, 198/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17062 ms. Remains : 168/195 places, 198/230 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-00
Product exploration explored 100000 steps with 4404 reset in 241 ms.
Stack based approach found an accepted trace after 94 steps with 3 reset with depth 21 and stack size 21 in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-00 finished in 17618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 185 transition count 218
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 185 transition count 218
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 179 transition count 210
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 179 transition count 210
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 174 transition count 205
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 174 transition count 205
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 171 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 171 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 170 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 170 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 169 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 169 transition count 199
Applied a total of 52 rules in 28 ms. Remains 169 /195 variables (removed 26) and now considering 199/230 (removed 31) transitions.
// Phase 1: matrix 199 rows 169 cols
[2024-05-22 07:57:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:57:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 07:57:46] [INFO ] Invariant cache hit.
[2024-05-22 07:57:46] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-22 07:57:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/368 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 07:57:48] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 07:57:48] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:57:49] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 19/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 190 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/368 variables, 169/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 198/388 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 388 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 19/19 constraints]
After SMT, in 15710ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 15713ms
Starting structural reductions in LTL mode, iteration 1 : 169/195 places, 199/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16032 ms. Remains : 169/195 places, 199/230 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-01
Product exploration explored 100000 steps with 1410 reset in 190 ms.
Stack based approach found an accepted trace after 609 steps with 12 reset with depth 101 and stack size 101 in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-01 finished in 16310 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 p1))||G((F(p1)&&F(G(p2))))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Graph (complete) has 386 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 193 transition count 199
Reduce places removed 29 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 164 transition count 196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 161 transition count 196
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 65 place count 161 transition count 165
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 127 place count 130 transition count 165
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 134 place count 123 transition count 155
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 123 transition count 155
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 119 transition count 150
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 119 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 118 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 118 transition count 149
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 239 place count 74 transition count 105
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 248 place count 65 transition count 88
Iterating global reduction 3 with 9 rules applied. Total rules applied 257 place count 65 transition count 88
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 266 place count 56 transition count 77
Iterating global reduction 3 with 9 rules applied. Total rules applied 275 place count 56 transition count 77
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 283 place count 48 transition count 62
Iterating global reduction 3 with 8 rules applied. Total rules applied 291 place count 48 transition count 62
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 299 place count 40 transition count 53
Iterating global reduction 3 with 8 rules applied. Total rules applied 307 place count 40 transition count 53
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 314 place count 33 transition count 40
Iterating global reduction 3 with 7 rules applied. Total rules applied 321 place count 33 transition count 40
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 328 place count 26 transition count 32
Iterating global reduction 3 with 7 rules applied. Total rules applied 335 place count 26 transition count 32
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 337 place count 24 transition count 29
Iterating global reduction 3 with 2 rules applied. Total rules applied 339 place count 24 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 24 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 342 place count 22 transition count 26
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 3 with 2 rules applied. Total rules applied 344 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 345 place count 20 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 345 place count 20 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 351 place count 17 transition count 22
Applied a total of 351 rules in 73 ms. Remains 17 /195 variables (removed 178) and now considering 22/230 (removed 208) transitions.
[2024-05-22 07:58:02] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 17 cols
[2024-05-22 07:58:02] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 07:58:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 07:58:02] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2024-05-22 07:58:02] [INFO ] Invariant cache hit.
[2024-05-22 07:58:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:58:02] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-22 07:58:02] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 07:58:02] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2024-05-22 07:58:02] [INFO ] Invariant cache hit.
[2024-05-22 07:58:02] [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) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 19 constraints, problems are : Problem set: 0 solved, 20 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 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) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 39 constraints, problems are : Problem set: 0 solved, 20 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/195 places, 22/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 646 ms. Remains : 17/195 places, 22/230 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-02
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-02 finished in 883 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)||G(F(p1)))))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Graph (complete) has 386 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 193 transition count 196
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 161 transition count 196
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 65 place count 161 transition count 165
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 127 place count 130 transition count 165
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 125 transition count 158
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 125 transition count 158
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 122 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 122 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 121 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 121 transition count 153
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 239 place count 74 transition count 106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 247 place count 66 transition count 91
Iterating global reduction 2 with 8 rules applied. Total rules applied 255 place count 66 transition count 91
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 263 place count 58 transition count 81
Iterating global reduction 2 with 8 rules applied. Total rules applied 271 place count 58 transition count 81
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 279 place count 50 transition count 66
Iterating global reduction 2 with 8 rules applied. Total rules applied 287 place count 50 transition count 66
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 295 place count 42 transition count 57
Iterating global reduction 2 with 8 rules applied. Total rules applied 303 place count 42 transition count 57
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 311 place count 34 transition count 42
Iterating global reduction 2 with 8 rules applied. Total rules applied 319 place count 34 transition count 42
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 327 place count 26 transition count 33
Iterating global reduction 2 with 8 rules applied. Total rules applied 335 place count 26 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 337 place count 24 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 340 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 341 place count 23 transition count 29
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 342 place count 23 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 344 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 345 place count 20 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 345 place count 20 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 349 place count 18 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 353 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 354 place count 16 transition count 21
Applied a total of 354 rules in 35 ms. Remains 16 /195 variables (removed 179) and now considering 21/230 (removed 209) transitions.
[2024-05-22 07:58:03] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2024-05-22 07:58:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 07:58:03] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 07:58:03] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-22 07:58:03] [INFO ] Invariant cache hit.
[2024-05-22 07:58:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 07:58:03] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-22 07:58:03] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 07:58:03] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-22 07:58:03] [INFO ] Invariant cache hit.
[2024-05-22 07:58:03] [INFO ] State equation strengthened by 14 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) 17/33 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 14/14 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) 17/33 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/195 places, 21/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 16/195 places, 21/230 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-04
Stuttering criterion allowed to conclude after 198 steps with 2 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-04 finished in 491 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 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Graph (complete) has 386 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 193 transition count 194
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 159 transition count 194
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 69 place count 159 transition count 164
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 129 place count 129 transition count 164
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 135 place count 123 transition count 155
Iterating global reduction 2 with 6 rules applied. Total rules applied 141 place count 123 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 119 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 119 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 118 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 118 transition count 149
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 245 place count 71 transition count 102
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 254 place count 62 transition count 85
Iterating global reduction 2 with 9 rules applied. Total rules applied 263 place count 62 transition count 85
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 272 place count 53 transition count 74
Iterating global reduction 2 with 9 rules applied. Total rules applied 281 place count 53 transition count 74
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 290 place count 44 transition count 57
Iterating global reduction 2 with 9 rules applied. Total rules applied 299 place count 44 transition count 57
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 308 place count 35 transition count 47
Iterating global reduction 2 with 9 rules applied. Total rules applied 317 place count 35 transition count 47
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 26 transition count 30
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 26 transition count 30
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 344 place count 17 transition count 20
Iterating global reduction 2 with 9 rules applied. Total rules applied 353 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 355 place count 15 transition count 17
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 15 transition count 17
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 358 place count 14 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 14 transition count 16
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 360 place count 14 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 362 place count 12 transition count 13
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 364 place count 11 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 10 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 365 place count 10 transition count 10
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 369 place count 8 transition count 10
Applied a total of 369 rules in 27 ms. Remains 8 /195 variables (removed 187) and now considering 10/230 (removed 220) transitions.
[2024-05-22 07:58:03] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 8 cols
[2024-05-22 07:58:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 07:58:03] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 07:58:03] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2024-05-22 07:58:03] [INFO ] Invariant cache hit.
[2024-05-22 07:58:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:58:03] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-22 07:58:03] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-22 07:58:03] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2024-05-22 07:58:03] [INFO ] Invariant cache hit.
[2024-05-22 07:58:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 9/16 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/17 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 10 constraints, problems are : Problem set: 0 solved, 9 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 9/16 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/195 places, 10/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 8/195 places, 10/230 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-05
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-05 finished in 250 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)||X((p1||G(p2))))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 186 transition count 219
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 186 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 181 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 181 transition count 212
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 177 transition count 208
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 177 transition count 208
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 175 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 175 transition count 206
Applied a total of 40 rules in 18 ms. Remains 175 /195 variables (removed 20) and now considering 206/230 (removed 24) transitions.
// Phase 1: matrix 206 rows 175 cols
[2024-05-22 07:58:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:58:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 07:58:03] [INFO ] Invariant cache hit.
[2024-05-22 07:58:04] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-22 07:58:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 206/381 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 10 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 07:58:07] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:58:08] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 07:58:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:58:08] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:58:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 0/381 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 197 constraints, problems are : Problem set: 0 solved, 205 unsolved in 7343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/381 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 205/402 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/381 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 402 constraints, problems are : Problem set: 0 solved, 205 unsolved in 8899 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 20/20 constraints]
After SMT, in 16316ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 16318ms
Starting structural reductions in LTL mode, iteration 1 : 175/195 places, 206/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16536 ms. Remains : 175/195 places, 206/230 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 256 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-06 finished in 16829 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&&X(p1)))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 184 transition count 217
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 184 transition count 217
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 177 transition count 207
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 177 transition count 207
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 171 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 171 transition count 201
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 167 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 166 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 165 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 165 transition count 194
Applied a total of 60 rules in 15 ms. Remains 165 /195 variables (removed 30) and now considering 194/230 (removed 36) transitions.
// Phase 1: matrix 194 rows 165 cols
[2024-05-22 07:58:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:58:20] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 07:58:20] [INFO ] Invariant cache hit.
[2024-05-22 07:58:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-22 07:58:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:58:23] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:58:24] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:58:24] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:58:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:58:24] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:58:24] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:58:24] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:58:24] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:58:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 187 constraints, problems are : Problem set: 0 solved, 193 unsolved in 6471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 380 constraints, problems are : Problem set: 0 solved, 193 unsolved in 8201 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 20/20 constraints]
After SMT, in 14723ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 14726ms
Starting structural reductions in LTL mode, iteration 1 : 165/195 places, 194/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14910 ms. Remains : 165/195 places, 194/230 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 137 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-08 finished in 15062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0)||(p0&&F(p1))) U p2))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 186 transition count 219
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 186 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 181 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 181 transition count 213
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 177 transition count 209
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 177 transition count 209
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 175 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 175 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 174 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 174 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 173 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 173 transition count 204
Applied a total of 44 rules in 12 ms. Remains 173 /195 variables (removed 22) and now considering 204/230 (removed 26) transitions.
// Phase 1: matrix 204 rows 173 cols
[2024-05-22 07:58:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:58:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 07:58:35] [INFO ] Invariant cache hit.
[2024-05-22 07:58:35] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-22 07:58:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 204/377 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 16/191 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 191 constraints, problems are : Problem set: 0 solved, 203 unsolved in 7767 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/377 variables, 173/191 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 203/394 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 394 constraints, problems are : Problem set: 0 solved, 203 unsolved in 8789 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 16/16 constraints]
After SMT, in 16607ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 16609ms
Starting structural reductions in LTL mode, iteration 1 : 173/195 places, 204/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16778 ms. Remains : 173/195 places, 204/230 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-09
Stuttering criterion allowed to conclude after 304 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-09 finished in 16999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Graph (complete) has 386 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 193 transition count 194
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 159 transition count 194
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 69 place count 159 transition count 165
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 127 place count 130 transition count 165
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 134 place count 123 transition count 155
Iterating global reduction 2 with 7 rules applied. Total rules applied 141 place count 123 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 141 place count 123 transition count 154
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 122 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 147 place count 118 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 118 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 117 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 117 transition count 148
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 243 place count 72 transition count 103
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 252 place count 63 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 261 place count 63 transition count 86
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 270 place count 54 transition count 75
Iterating global reduction 2 with 9 rules applied. Total rules applied 279 place count 54 transition count 75
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 288 place count 45 transition count 58
Iterating global reduction 2 with 9 rules applied. Total rules applied 297 place count 45 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 306 place count 36 transition count 48
Iterating global reduction 2 with 9 rules applied. Total rules applied 315 place count 36 transition count 48
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 324 place count 27 transition count 31
Iterating global reduction 2 with 9 rules applied. Total rules applied 333 place count 27 transition count 31
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 342 place count 18 transition count 21
Iterating global reduction 2 with 9 rules applied. Total rules applied 351 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 353 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 356 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 15 transition count 17
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 358 place count 15 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 360 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 13 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 365 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 367 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 369 place count 5 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 371 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 4 transition count 6
Applied a total of 372 rules in 22 ms. Remains 4 /195 variables (removed 191) and now considering 6/230 (removed 224) transitions.
[2024-05-22 07:58:52] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 07:58:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 07:58:52] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 07:58:52] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 07:58:52] [INFO ] Invariant cache hit.
[2024-05-22 07:58:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 07:58:52] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 07:58:52] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 07:58:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 51ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/195 places, 6/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 4/195 places, 6/230 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-10 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Graph (complete) has 386 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 193 transition count 194
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 159 transition count 194
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 69 place count 159 transition count 164
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 129 place count 129 transition count 164
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 136 place count 122 transition count 154
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 122 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 143 place count 122 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 121 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 117 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 117 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 116 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 116 transition count 147
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 243 place count 72 transition count 103
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 252 place count 63 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 261 place count 63 transition count 86
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 270 place count 54 transition count 75
Iterating global reduction 2 with 9 rules applied. Total rules applied 279 place count 54 transition count 75
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 288 place count 45 transition count 58
Iterating global reduction 2 with 9 rules applied. Total rules applied 297 place count 45 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 306 place count 36 transition count 48
Iterating global reduction 2 with 9 rules applied. Total rules applied 315 place count 36 transition count 48
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 324 place count 27 transition count 31
Iterating global reduction 2 with 9 rules applied. Total rules applied 333 place count 27 transition count 31
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 342 place count 18 transition count 21
Iterating global reduction 2 with 9 rules applied. Total rules applied 351 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 353 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 356 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 15 transition count 17
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 358 place count 15 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 360 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 13 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 365 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 367 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 369 place count 5 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 371 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 4 transition count 6
Applied a total of 372 rules in 22 ms. Remains 4 /195 variables (removed 191) and now considering 6/230 (removed 224) transitions.
[2024-05-22 07:58:52] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 07:58:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 07:58:52] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-05-22 07:58:52] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 07:58:52] [INFO ] Invariant cache hit.
[2024-05-22 07:58:52] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-22 07:58:52] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 07:58:52] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 07:58:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 57ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/195 places, 6/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 4/195 places, 6/230 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-12 finished in 167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U (p2||G(p1)))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Graph (complete) has 386 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 193 transition count 197
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 162 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 161 transition count 196
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 65 place count 161 transition count 166
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 125 place count 131 transition count 166
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 131 place count 125 transition count 157
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 125 transition count 157
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 121 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 121 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 120 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 120 transition count 151
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 237 place count 75 transition count 106
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 68 transition count 93
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 68 transition count 93
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 258 place count 61 transition count 84
Iterating global reduction 3 with 7 rules applied. Total rules applied 265 place count 61 transition count 84
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 272 place count 54 transition count 71
Iterating global reduction 3 with 7 rules applied. Total rules applied 279 place count 54 transition count 71
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 286 place count 47 transition count 63
Iterating global reduction 3 with 7 rules applied. Total rules applied 293 place count 47 transition count 63
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 300 place count 40 transition count 50
Iterating global reduction 3 with 7 rules applied. Total rules applied 307 place count 40 transition count 50
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 314 place count 33 transition count 42
Iterating global reduction 3 with 7 rules applied. Total rules applied 321 place count 33 transition count 42
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 31 transition count 39
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 326 place count 30 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 30 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 328 place count 30 transition count 37
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 30 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 29 transition count 36
Applied a total of 331 rules in 16 ms. Remains 29 /195 variables (removed 166) and now considering 36/230 (removed 194) transitions.
[2024-05-22 07:58:53] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 29 cols
[2024-05-22 07:58:53] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 07:58:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 07:58:53] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2024-05-22 07:58:53] [INFO ] Invariant cache hit.
[2024-05-22 07:58:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 07:58:53] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-22 07:58:53] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2024-05-22 07:58:53] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2024-05-22 07:58:53] [INFO ] Invariant cache hit.
[2024-05-22 07:58:53] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 31/60 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 57 constraints, problems are : Problem set: 0 solved, 35 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 31/60 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 35/91 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/61 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 92 constraints, problems are : Problem set: 0 solved, 35 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 763ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 764ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/195 places, 36/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 884 ms. Remains : 29/195 places, 36/230 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p1)), true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 23 stabilizing places and 24 stable transitions
Computed a total of 23 stabilizing places and 24 stable transitions
Detected a total of 23/29 stabilizing places and 24/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 18 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-10b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-13 finished in 1285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Graph (complete) has 386 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 193 transition count 195
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 160 transition count 195
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 67 place count 160 transition count 166
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 125 place count 131 transition count 166
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 132 place count 124 transition count 156
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 124 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 139 place count 124 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 123 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 119 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 119 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 118 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 118 transition count 149
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 241 place count 73 transition count 104
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 250 place count 64 transition count 87
Iterating global reduction 2 with 9 rules applied. Total rules applied 259 place count 64 transition count 87
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 268 place count 55 transition count 76
Iterating global reduction 2 with 9 rules applied. Total rules applied 277 place count 55 transition count 76
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 286 place count 46 transition count 59
Iterating global reduction 2 with 9 rules applied. Total rules applied 295 place count 46 transition count 59
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 303 place count 38 transition count 50
Iterating global reduction 2 with 8 rules applied. Total rules applied 311 place count 38 transition count 50
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 319 place count 30 transition count 35
Iterating global reduction 2 with 8 rules applied. Total rules applied 327 place count 30 transition count 35
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 335 place count 22 transition count 26
Iterating global reduction 2 with 8 rules applied. Total rules applied 343 place count 22 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 345 place count 20 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 347 place count 20 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 19 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 19 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 351 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 26 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 3 rules applied. Total rules applied 354 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 355 place count 14 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 357 place count 13 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 359 place count 11 transition count 16
Applied a total of 359 rules in 22 ms. Remains 11 /195 variables (removed 184) and now considering 16/230 (removed 214) transitions.
[2024-05-22 07:58:54] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 11 cols
[2024-05-22 07:58:54] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 07:58:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 07:58:54] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-22 07:58:54] [INFO ] Invariant cache hit.
[2024-05-22 07:58:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-22 07:58:54] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-22 07:58:54] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-22 07:58:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/23 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/25 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 12 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/23 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/25 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 24 constraints, problems are : Problem set: 0 solved, 12 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/195 places, 16/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 11/195 places, 16/230 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-14 finished in 394 ms.
All properties solved by simple procedures.
Total runtime 114519 ms.
ITS solved all properties within timeout

BK_STOP 1716364734789

--------------------
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-10b"
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-10b, 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-171631131100436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10b.tgz
mv DiscoveryGPU-PT-10b execution
cd execution
if [ "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 ;