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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:40 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 61K 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-08b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716363114034

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-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:31:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:31:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:31:55] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-22 07:31:55] [INFO ] Transformed 240 places.
[2024-05-22 07:31:55] [INFO ] Transformed 254 transitions.
[2024-05-22 07:31:55] [INFO ] Found NUPN structural information;
[2024-05-22 07:31:55] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 182 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 2 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 51 place count 189 transition count 219
Iterating global reduction 1 with 35 rules applied. Total rules applied 86 place count 189 transition count 219
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 181 transition count 211
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 181 transition count 211
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 176 transition count 206
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 176 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 172 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 172 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 170 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 170 transition count 198
Applied a total of 124 rules in 90 ms. Remains 170 /240 variables (removed 70) and now considering 198/254 (removed 56) transitions.
// Phase 1: matrix 198 rows 170 cols
[2024-05-22 07:31:55] [INFO ] Computed 2 invariants in 21 ms
[2024-05-22 07:31:56] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-22 07:31:56] [INFO ] Invariant cache hit.
[2024-05-22 07:31:56] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-22 07:31:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 198/368 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 07:31:59] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 47 ms to minimize.
[2024-05-22 07:31:59] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:31:59] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-22 07:32:00] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 2 ms to minimize.
[2024-05-22 07:32:00] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:32:00] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-22 07:32:00] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 2 ms to minimize.
[2024-05-22 07:32:00] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:32:00] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 15 ms to minimize.
[2024-05-22 07:32:00] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-22 07:32:01] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 11/183 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 183 constraints, problems are : Problem set: 0 solved, 197 unsolved in 8649 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/368 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 197/380 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 380 constraints, problems are : Problem set: 0 solved, 197 unsolved in 7739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 11/11 constraints]
After SMT, in 16512ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 16532ms
Starting structural reductions in LTL mode, iteration 1 : 170/240 places, 198/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17084 ms. Remains : 170/240 places, 198/254 transitions.
Support contains 35 out of 170 places after structural reductions.
[2024-05-22 07:32:12] [INFO ] Flatten gal took : 43 ms
[2024-05-22 07:32:13] [INFO ] Flatten gal took : 25 ms
[2024-05-22 07:32:13] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 34 out of 170 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (151 resets) in 788 ms. (50 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40002 steps (21 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
[2024-05-22 07:32:13] [INFO ] Invariant cache hit.
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 2/368 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 18ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 331 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)&&(p1||F(p2)))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 160 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 188
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 155 transition count 182
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 155 transition count 182
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 152 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 149 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 149 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 147 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 146 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 146 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 145 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 145 transition count 170
Applied a total of 50 rules in 19 ms. Remains 145 /170 variables (removed 25) and now considering 170/198 (removed 28) transitions.
// Phase 1: matrix 170 rows 145 cols
[2024-05-22 07:32:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:32:13] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 07:32:13] [INFO ] Invariant cache hit.
[2024-05-22 07:32:14] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-22 07:32:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 170/315 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:32:16] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 0/315 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 157 constraints, problems are : Problem set: 0 solved, 169 unsolved in 5653 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 170/315 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 169/326 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 326 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6332 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 10/10 constraints]
After SMT, in 12037ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 12039ms
Starting structural reductions in LTL mode, iteration 1 : 145/170 places, 170/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12258 ms. Remains : 145/170 places, 170/198 transitions.
Stuttering acceptance computed with spot in 405 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-00 finished in 12723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 158 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 158 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 151 transition count 177
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 146 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 146 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 141 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 135 transition count 158
Applied a total of 70 rules in 19 ms. Remains 135 /170 variables (removed 35) and now considering 158/198 (removed 40) transitions.
// Phase 1: matrix 158 rows 135 cols
[2024-05-22 07:32:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:32:26] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-22 07:32:26] [INFO ] Invariant cache hit.
[2024-05-22 07:32:26] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-22 07:32:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 158/293 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-22 07:32:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:32:28] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:32:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:32:29] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 151 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/293 variables, 135/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 157/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 308 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5781 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 14/14 constraints]
After SMT, in 11007ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 11009ms
Starting structural reductions in LTL mode, iteration 1 : 135/170 places, 158/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11291 ms. Remains : 135/170 places, 158/198 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-01
Product exploration explored 100000 steps with 826 reset in 335 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 69 in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-01 finished in 11711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 147 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 142 transition count 166
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 142 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 139 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 139 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 137 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 137 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 136 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 136 transition count 159
Applied a total of 68 rules in 11 ms. Remains 136 /170 variables (removed 34) and now considering 159/198 (removed 39) transitions.
// Phase 1: matrix 159 rows 136 cols
[2024-05-22 07:32:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:32:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 07:32:38] [INFO ] Invariant cache hit.
[2024-05-22 07:32:38] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-22 07:32:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 159/295 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:32:40] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 12/150 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 150 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4991 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/295 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 158/308 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 308 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4679 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 12/12 constraints]
After SMT, in 9715ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 9717ms
Starting structural reductions in LTL mode, iteration 1 : 136/170 places, 159/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9881 ms. Remains : 136/170 places, 159/198 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-02
Stuttering criterion allowed to conclude after 218 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-02 finished in 10033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||F(p1)) U (F(!p1)&&p2)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 160 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 154 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 154 transition count 180
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 150 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 150 transition count 175
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 146 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 146 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 144 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 144 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 143 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 143 transition count 167
Applied a total of 54 rules in 13 ms. Remains 143 /170 variables (removed 27) and now considering 167/198 (removed 31) transitions.
// Phase 1: matrix 167 rows 143 cols
[2024-05-22 07:32:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:32:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 07:32:48] [INFO ] Invariant cache hit.
[2024-05-22 07:32:48] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 07:32:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 167/310 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:32:50] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 9/154 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 154 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/310 variables, 143/154 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 166/320 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 320 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 9/9 constraints]
After SMT, in 10362ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 10364ms
Starting structural reductions in LTL mode, iteration 1 : 143/170 places, 167/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10519 ms. Remains : 143/170 places, 167/198 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p0)), p1, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-03
Stuttering criterion allowed to conclude after 998 steps with 3 reset in 5 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-03 finished in 10693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Graph (complete) has 331 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 166 transition count 164
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 136 transition count 164
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 61 place count 136 transition count 141
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 107 place count 113 transition count 141
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 113 place count 107 transition count 134
Iterating global reduction 2 with 6 rules applied. Total rules applied 119 place count 107 transition count 134
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 104 transition count 131
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 104 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 102 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 102 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 100 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 100 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 99 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 99 transition count 124
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 215 place count 59 transition count 84
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 222 place count 52 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 229 place count 52 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 236 place count 45 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 243 place count 45 transition count 62
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 249 place count 39 transition count 51
Iterating global reduction 2 with 6 rules applied. Total rules applied 255 place count 39 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 261 place count 33 transition count 44
Iterating global reduction 2 with 6 rules applied. Total rules applied 267 place count 33 transition count 44
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 273 place count 27 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 279 place count 27 transition count 33
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 285 place count 21 transition count 26
Iterating global reduction 2 with 6 rules applied. Total rules applied 291 place count 21 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 293 place count 19 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 296 place count 18 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 297 place count 18 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 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 303 place count 14 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 303 place count 14 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 307 place count 12 transition count 16
Applied a total of 307 rules in 48 ms. Remains 12 /170 variables (removed 158) and now considering 16/198 (removed 182) transitions.
[2024-05-22 07:32:59] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2024-05-22 07:32:59] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 07:32:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 07:32:59] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 07:32:59] [INFO ] Invariant cache hit.
[2024-05-22 07:32:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:32:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-22 07:32:59] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 07:32:59] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 07:32:59] [INFO ] Invariant cache hit.
[2024-05-22 07:32:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 269ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/170 places, 16/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 12/170 places, 16/198 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-04
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-04 finished in 408 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(X(p0))&&(p1 U (G(X(p0)) U p1))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 158 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 158 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 151 transition count 177
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 146 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 146 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 141 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 135 transition count 158
Applied a total of 70 rules in 17 ms. Remains 135 /170 variables (removed 35) and now considering 158/198 (removed 40) transitions.
// Phase 1: matrix 158 rows 135 cols
[2024-05-22 07:32:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:32:59] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 07:32:59] [INFO ] Invariant cache hit.
[2024-05-22 07:32:59] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-22 07:32:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 158/293 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 9 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 151 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4963 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/293 variables, 135/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 157/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 308 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5972 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 14/14 constraints]
After SMT, in 10969ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 10971ms
Starting structural reductions in LTL mode, iteration 1 : 135/170 places, 158/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11108 ms. Remains : 135/170 places, 158/198 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-05 finished in 11319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U X(p2)))))))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 160 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 188
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 155 transition count 182
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 155 transition count 182
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 151 transition count 177
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 151 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 147 transition count 172
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 144 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 144 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 142 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 141 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 141 transition count 165
Applied a total of 58 rules in 20 ms. Remains 141 /170 variables (removed 29) and now considering 165/198 (removed 33) transitions.
// Phase 1: matrix 165 rows 141 cols
[2024-05-22 07:33:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:33:10] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 07:33:10] [INFO ] Invariant cache hit.
[2024-05-22 07:33:10] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-22 07:33:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/306 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 07:33:12] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 07:33:12] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:33:12] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 15/158 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 158 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5616 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/306 variables, 141/158 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 164/322 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 322 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 15/15 constraints]
After SMT, in 11106ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 11108ms
Starting structural reductions in LTL mode, iteration 1 : 141/170 places, 165/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11256 ms. Remains : 141/170 places, 165/198 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-06
Stuttering criterion allowed to conclude after 812 steps with 3 reset in 5 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-06 finished in 11506 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(X(F(p0)))||(X(p1) U p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 147 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 143 transition count 168
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 143 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 141 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 140 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 139 transition count 163
Applied a total of 62 rules in 19 ms. Remains 139 /170 variables (removed 31) and now considering 163/198 (removed 35) transitions.
// Phase 1: matrix 163 rows 139 cols
[2024-05-22 07:33:22] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:33:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 07:33:22] [INFO ] Invariant cache hit.
[2024-05-22 07:33:22] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-22 07:33:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 163/302 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:33:24] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 9/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 150 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5219 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/302 variables, 139/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 162/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 312 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5258 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 9/9 constraints]
After SMT, in 10510ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 10513ms
Starting structural reductions in LTL mode, iteration 1 : 139/170 places, 163/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10670 ms. Remains : 139/170 places, 163/198 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-07
Product exploration explored 100000 steps with 33283 reset in 113 ms.
Product exploration explored 100000 steps with 33449 reset in 137 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 130 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 38210 steps (144 resets) in 207 ms. (183 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 11 factoid took 289 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-22 07:33:34] [INFO ] Invariant cache hit.
[2024-05-22 07:33:34] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 07:33:34] [INFO ] Invariant cache hit.
[2024-05-22 07:33:34] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-22 07:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 163/302 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:33:36] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 9/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 150 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/302 variables, 139/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 162/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 312 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 9/9 constraints]
After SMT, in 10147ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 10148ms
Finished structural reductions in LTL mode , in 1 iterations and 10288 ms. Remains : 139/139 places, 163/163 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 122 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 34468 steps (126 resets) in 75 ms. (453 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 11 factoid took 268 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33532 reset in 76 ms.
Product exploration explored 100000 steps with 33415 reset in 85 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Graph (complete) has 279 edges and 139 vertex of which 138 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
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 138 transition count 162
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 17 place count 138 transition count 162
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 42 place count 138 transition count 162
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 63 place count 138 transition count 170
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 136 transition count 168
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 136 transition count 168
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 136 transition count 200
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 89 place count 130 transition count 188
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 95 place count 130 transition count 188
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 113 place count 112 transition count 158
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 131 place count 112 transition count 158
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 148 place count 95 transition count 130
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 165 place count 95 transition count 130
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 170 place count 90 transition count 125
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 175 place count 90 transition count 125
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 183 place count 82 transition count 113
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 191 place count 82 transition count 113
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 207 place count 66 transition count 89
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 223 place count 66 transition count 89
Deduced a syphon composed of 36 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 225 place count 66 transition count 87
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 225 rules in 35 ms. Remains 66 /139 variables (removed 73) and now considering 87/163 (removed 76) transitions.
[2024-05-22 07:33:46] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-22 07:33:46] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 66 cols
[2024-05-22 07:33:46] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 07:33:46] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-22 07:33:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-22 07:33:46] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 83 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/70 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 8/78 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/78 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/78 constraints. Problems are: Problem set: 49 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 78 constraints, problems are : Problem set: 49 solved, 37 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 49 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 4/33 variables, 2/2 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 81/114 variables, 33/37 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 8/45 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 37/82 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/82 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 35/149 variables, 33/115 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/115 constraints. Problems are: Problem set: 49 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/115 constraints. Problems are: Problem set: 49 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 115 constraints, problems are : Problem set: 49 solved, 37 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 37/86 constraints, Known Traps: 2/2 constraints]
After SMT, in 1770ms problems are : Problem set: 49 solved, 37 unsolved
Search for dead transitions found 49 dead transitions in 1773ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 66/139 places, 38/163 transitions.
Graph (complete) has 83 edges and 66 vertex of which 30 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 30 /66 variables (removed 36) and now considering 38/38 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/139 places, 38/163 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1835 ms. Remains : 30/139 places, 38/163 transitions.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 139 cols
[2024-05-22 07:33:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:33:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 07:33:47] [INFO ] Invariant cache hit.
[2024-05-22 07:33:47] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-22 07:33:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 163/302 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-22 07:33:49] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:33:50] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:33:50] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:33:50] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:33:50] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:33:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:33:50] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:33:50] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:33:50] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 9/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 150 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/302 variables, 139/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 162/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 312 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5081 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 9/9 constraints]
After SMT, in 10208ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 10209ms
Finished structural reductions in LTL mode , in 1 iterations and 10363 ms. Remains : 139/139 places, 163/163 transitions.
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-07 finished in 36006 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))||G(p1)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 147 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 147 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 142 transition count 166
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 142 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 139 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 139 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 137 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 137 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 136 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 136 transition count 159
Applied a total of 68 rules in 19 ms. Remains 136 /170 variables (removed 34) and now considering 159/198 (removed 39) transitions.
// Phase 1: matrix 159 rows 136 cols
[2024-05-22 07:33:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:33:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 07:33:58] [INFO ] Invariant cache hit.
[2024-05-22 07:33:58] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-22 07:33:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 159/295 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:34:00] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 149 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/295 variables, 136/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 158/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 307 constraints, problems are : Problem set: 0 solved, 158 unsolved in 5471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 11/11 constraints]
After SMT, in 10392ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 10393ms
Starting structural reductions in LTL mode, iteration 1 : 136/170 places, 159/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10573 ms. Remains : 136/170 places, 159/198 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-08 finished in 10764 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((p0&&G(F(p1))))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 152 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 148 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 148 transition count 173
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 144 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 144 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 142 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 141 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 140 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 140 transition count 164
Applied a total of 60 rules in 17 ms. Remains 140 /170 variables (removed 30) and now considering 164/198 (removed 34) transitions.
// Phase 1: matrix 164 rows 140 cols
[2024-05-22 07:34:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:34:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 07:34:09] [INFO ] Invariant cache hit.
[2024-05-22 07:34:09] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-22 07:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 164/304 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:11] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 153 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/304 variables, 140/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 163/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 316 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5880 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 11/11 constraints]
After SMT, in 11018ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 11020ms
Starting structural reductions in LTL mode, iteration 1 : 140/170 places, 164/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11208 ms. Remains : 140/170 places, 164/198 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-09 finished in 11425 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) U X(G(p1))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 153 transition count 179
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 153 transition count 179
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 148 transition count 173
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 148 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 143 transition count 167
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 143 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 140 transition count 163
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 140 transition count 163
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 138 transition count 161
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 138 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 137 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 137 transition count 160
Applied a total of 66 rules in 17 ms. Remains 137 /170 variables (removed 33) and now considering 160/198 (removed 38) transitions.
// Phase 1: matrix 160 rows 137 cols
[2024-05-22 07:34:20] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 07:34:20] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 07:34:20] [INFO ] Invariant cache hit.
[2024-05-22 07:34:20] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-22 07:34:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 160/297 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:34:22] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:23] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:34:23] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 16/155 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 155 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/297 variables, 137/155 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 159/314 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 314 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5384 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 16/16 constraints]
After SMT, in 10550ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 10551ms
Starting structural reductions in LTL mode, iteration 1 : 137/170 places, 160/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10705 ms. Remains : 137/170 places, 160/198 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-10
Product exploration explored 100000 steps with 1491 reset in 127 ms.
Stack based approach found an accepted trace after 114 steps with 1 reset with depth 91 and stack size 91 in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-10 finished in 10968 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(p2)))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 159 transition count 187
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 159 transition count 187
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 153 transition count 179
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 153 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 149 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 149 transition count 175
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 145 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 145 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 143 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 143 transition count 167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 141 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 140 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 140 transition count 164
Applied a total of 60 rules in 8 ms. Remains 140 /170 variables (removed 30) and now considering 164/198 (removed 34) transitions.
// Phase 1: matrix 164 rows 140 cols
[2024-05-22 07:34:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:34:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 07:34:31] [INFO ] Invariant cache hit.
[2024-05-22 07:34:31] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-22 07:34:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 164/304 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:34:33] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:34:34] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 154 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5329 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/304 variables, 140/154 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 163/317 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 317 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 12/12 constraints]
After SMT, in 10442ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 10443ms
Starting structural reductions in LTL mode, iteration 1 : 140/170 places, 164/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10587 ms. Remains : 140/170 places, 164/198 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-13 finished in 10780 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 U (G(p1)||(p1&&(!p0 U (p2||G(!p0)))))))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Graph (complete) has 331 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 166 transition count 166
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 138 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 136 transition count 164
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 61 place count 136 transition count 142
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 105 place count 114 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 111 place count 108 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 117 place count 108 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 105 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 105 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 103 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 103 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 101 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 100 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 100 transition count 125
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 209 place count 62 transition count 87
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 216 place count 55 transition count 74
Iterating global reduction 3 with 7 rules applied. Total rules applied 223 place count 55 transition count 74
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 48 transition count 65
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 48 transition count 65
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 41 transition count 52
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 41 transition count 52
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 258 place count 34 transition count 44
Iterating global reduction 3 with 7 rules applied. Total rules applied 265 place count 34 transition count 44
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 271 place count 28 transition count 33
Iterating global reduction 3 with 6 rules applied. Total rules applied 277 place count 28 transition count 33
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 282 place count 23 transition count 27
Iterating global reduction 3 with 5 rules applied. Total rules applied 287 place count 23 transition count 27
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 289 place count 21 transition count 24
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 21 transition count 24
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 292 place count 20 transition count 23
Iterating global reduction 3 with 1 rules applied. Total rules applied 293 place count 20 transition count 23
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 294 place count 20 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 296 place count 18 transition count 20
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 298 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 16 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 299 place count 16 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 303 place count 14 transition count 17
Applied a total of 303 rules in 34 ms. Remains 14 /170 variables (removed 156) and now considering 17/198 (removed 181) transitions.
[2024-05-22 07:34:42] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 14 cols
[2024-05-22 07:34:42] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 07:34:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 07:34:42] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-22 07:34:42] [INFO ] Invariant cache hit.
[2024-05-22 07:34:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:34:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-22 07:34:42] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 07:34:42] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-22 07:34:42] [INFO ] Invariant cache hit.
[2024-05-22 07:34:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 16/29 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/30 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 16 constraints, problems are : Problem set: 0 solved, 15 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 16/29 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/30 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 31 constraints, problems are : Problem set: 0 solved, 15 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 251ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/170 places, 17/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 14/170 places, 17/198 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-14
Stuttering criterion allowed to conclude after 39558 steps with 1938 reset in 52 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-14 finished in 519 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))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 158 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 158 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 151 transition count 177
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 146 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 146 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 141 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 141 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 138 transition count 161
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 135 transition count 158
Applied a total of 70 rules in 15 ms. Remains 135 /170 variables (removed 35) and now considering 158/198 (removed 40) transitions.
// Phase 1: matrix 158 rows 135 cols
[2024-05-22 07:34:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:34:42] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 07:34:42] [INFO ] Invariant cache hit.
[2024-05-22 07:34:42] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-22 07:34:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 158/293 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-22 07:34:44] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:34:44] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:44] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:44] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:34:44] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:44] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 151 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4879 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/293 variables, 135/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 157/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 308 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5689 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 14/14 constraints]
After SMT, in 10604ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 10606ms
Starting structural reductions in LTL mode, iteration 1 : 135/170 places, 158/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10771 ms. Remains : 135/170 places, 158/198 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 120 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-15 finished in 10896 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(X(F(p0)))||(X(p1) U p2))))'
Found a Lengthening insensitive property : DiscoveryGPU-PT-08b-LTLFireability-07
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 170/170 places, 198/198 transitions.
Graph (complete) has 331 edges and 170 vertex of which 167 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 166 transition count 166
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 138 transition count 166
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 57 place count 138 transition count 143
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 103 place count 115 transition count 143
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 109 transition count 136
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 109 transition count 136
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 106 transition count 133
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 106 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 104 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 104 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 103 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 103 transition count 129
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 205 place count 64 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 211 place count 58 transition count 79
Iterating global reduction 2 with 6 rules applied. Total rules applied 217 place count 58 transition count 79
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 52 transition count 71
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 52 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 234 place count 47 transition count 62
Iterating global reduction 2 with 5 rules applied. Total rules applied 239 place count 47 transition count 62
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 244 place count 42 transition count 56
Iterating global reduction 2 with 5 rules applied. Total rules applied 249 place count 42 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 253 place count 38 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 257 place count 38 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 261 place count 34 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 265 place count 34 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 267 place count 32 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 269 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 270 place count 31 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 271 place count 31 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 273 place count 31 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 28 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 276 place count 28 transition count 36
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 280 place count 26 transition count 36
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 286 place count 23 transition count 32
Applied a total of 286 rules in 21 ms. Remains 23 /170 variables (removed 147) and now considering 32/198 (removed 166) transitions.
[2024-05-22 07:34:53] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 23 cols
[2024-05-22 07:34:53] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 07:34:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 07:34:53] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:53] [INFO ] Invariant cache hit.
[2024-05-22 07:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:34:53] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 31 sub problems to find dead transitions.
[2024-05-22 07:34:53] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:53] [INFO ] Invariant cache hit.
[2024-05-22 07:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 25 constraints, problems are : Problem set: 0 solved, 31 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 56 constraints, problems are : Problem set: 0 solved, 31 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 553ms
Starting structural reductions in LI_LTL mode, iteration 1 : 23/170 places, 32/198 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 637 ms. Remains : 23/170 places, 32/198 transitions.
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-07
Product exploration explored 100000 steps with 33141 reset in 103 ms.
Product exploration explored 100000 steps with 33237 reset in 123 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/23 stabilizing places and 25/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 279 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 16426 steps (171 resets) in 35 ms. (456 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 13 factoid took 661 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-22 07:34:55] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:55] [INFO ] Invariant cache hit.
[2024-05-22 07:34:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 07:34:56] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:56] [INFO ] Invariant cache hit.
[2024-05-22 07:34:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:34:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 31 sub problems to find dead transitions.
[2024-05-22 07:34:56] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:56] [INFO ] Invariant cache hit.
[2024-05-22 07:34:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 25 constraints, problems are : Problem set: 0 solved, 31 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 56 constraints, problems are : Problem set: 0 solved, 31 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 518ms
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 23/23 places, 32/32 transitions.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/23 stabilizing places and 25/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 271 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 16008 steps (168 resets) in 34 ms. (457 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 13 factoid took 796 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33286 reset in 83 ms.
Product exploration explored 100000 steps with 33374 reset in 96 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-22 07:34:58] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-22 07:34:58] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:58] [INFO ] Invariant cache hit.
[2024-05-22 07:34:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 25 constraints, problems are : Problem set: 0 solved, 31 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 56 constraints, problems are : Problem set: 0 solved, 31 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 558ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 23/23 places, 32/32 transitions.
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-22 07:34:59] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:59] [INFO ] Invariant cache hit.
[2024-05-22 07:34:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 07:34:59] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:59] [INFO ] Invariant cache hit.
[2024-05-22 07:34:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:34:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 31 sub problems to find dead transitions.
[2024-05-22 07:34:59] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-22 07:34:59] [INFO ] Invariant cache hit.
[2024-05-22 07:34:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 25 constraints, problems are : Problem set: 0 solved, 31 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 56 constraints, problems are : Problem set: 0 solved, 31 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 539ms
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 23/23 places, 32/32 transitions.
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-07 finished in 6147 ms.
[2024-05-22 07:34:59] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:34:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-22 07:34:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 198 transitions and 528 arcs took 2 ms.
Total runtime 184517 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-08b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 170
TRANSITIONS: 198
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


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


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

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

Process ID: 2017
MODEL NAME: /home/mcc/execution/413/model
170 places, 198 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DiscoveryGPU-PT-08b-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716363329128

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

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