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.r136-tall-171631132600420.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 itstools
Input is DiscoveryGPU-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.9K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 02:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 02:00 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 68K 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-09b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716376595254

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 11:16:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 11:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:16:36] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 11:16:36] [INFO ] Transformed 268 places.
[2024-05-22 11:16:36] [INFO ] Transformed 284 transitions.
[2024-05-22 11:16:36] [INFO ] Found NUPN structural information;
[2024-05-22 11:16:36] [INFO ] Parsed PT model containing 268 places and 284 transitions and 740 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 250 transition count 284
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 61 place count 207 transition count 241
Iterating global reduction 1 with 43 rules applied. Total rules applied 104 place count 207 transition count 241
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 113 place count 198 transition count 232
Iterating global reduction 1 with 9 rules applied. Total rules applied 122 place count 198 transition count 232
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 192 transition count 226
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 192 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 137 place count 189 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 140 place count 189 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 187 transition count 219
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 187 transition count 219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 185 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 185 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 183 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 183 transition count 215
Applied a total of 152 rules in 80 ms. Remains 183 /268 variables (removed 85) and now considering 215/284 (removed 69) transitions.
// Phase 1: matrix 215 rows 183 cols
[2024-05-22 11:16:36] [INFO ] Computed 2 invariants in 16 ms
[2024-05-22 11:16:37] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 11:16:37] [INFO ] Invariant cache hit.
[2024-05-22 11:16:37] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-22 11:16:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/398 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 11:16:40] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 19 ms to minimize.
[2024-05-22 11:16:40] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:16:40] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-22 11:16:40] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 2 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 3 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 5 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-05-22 11:16:41] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 14/199 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/398 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 199 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/398 variables, 183/199 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 214/413 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 413 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 14/14 constraints]
After SMT, in 18347ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 18363ms
Starting structural reductions in LTL mode, iteration 1 : 183/268 places, 215/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18859 ms. Remains : 183/268 places, 215/284 transitions.
Support contains 27 out of 183 places after structural reductions.
[2024-05-22 11:16:55] [INFO ] Flatten gal took : 37 ms
[2024-05-22 11:16:55] [INFO ] Flatten gal took : 30 ms
[2024-05-22 11:16:55] [INFO ] Input system was already deterministic with 215 transitions.
Support contains 26 out of 183 places (down from 27) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 10252 steps (32 resets) in 433 ms. (23 steps per ms) remains 0/26 properties
FORMULA DiscoveryGPU-PT-09b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 361 edges and 183 vertex of which 180 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 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)||(F(p1)&&G(p2))))'
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Graph (complete) has 361 edges and 183 vertex of which 181 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 180 transition count 185
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 153 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 152 transition count 184
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 57 place count 152 transition count 157
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 111 place count 125 transition count 157
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 116 place count 120 transition count 152
Iterating global reduction 3 with 5 rules applied. Total rules applied 121 place count 120 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 116 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 116 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 112 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 111 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 111 transition count 139
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 223 place count 69 transition count 97
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 62 transition count 84
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 62 transition count 84
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 55 transition count 76
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 55 transition count 76
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 257 place count 49 transition count 64
Iterating global reduction 3 with 6 rules applied. Total rules applied 263 place count 49 transition count 64
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 269 place count 43 transition count 58
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 43 transition count 58
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 281 place count 37 transition count 46
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 place count 37 transition count 46
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 293 place count 31 transition count 40
Iterating global reduction 3 with 6 rules applied. Total rules applied 299 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 300 place count 30 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 302 place count 29 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 29 transition count 37
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 304 place count 29 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 305 place count 29 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 307 place count 27 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 308 place count 26 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 308 place count 26 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 314 place count 23 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 318 place count 21 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 21 transition count 28
Applied a total of 319 rules in 60 ms. Remains 21 /183 variables (removed 162) and now considering 28/215 (removed 187) transitions.
[2024-05-22 11:16:56] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 21 cols
[2024-05-22 11:16:56] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 11:16:56] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 11:16:56] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
[2024-05-22 11:16:56] [INFO ] Invariant cache hit.
[2024-05-22 11:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:16:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-22 11:16:56] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-22 11:16:56] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
[2024-05-22 11:16:56] [INFO ] Invariant cache hit.
[2024-05-22 11:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 25/46 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 23 constraints, problems are : Problem set: 0 solved, 27 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 25/46 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 50 constraints, problems are : Problem set: 0 solved, 27 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 642ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 643ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/183 places, 28/215 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 897 ms. Remains : 21/183 places, 28/215 transitions.
Stuttering acceptance computed with spot in 237 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-09b-LTLFireability-00
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-00 finished in 1194 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)) U ((X(X(p0))&&(p1||G(F(p2))))||X(X(G(p0))))))'
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 174 transition count 206
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 174 transition count 206
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 169 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 169 transition count 197
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 164 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 164 transition count 192
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 159 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 159 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 158 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 158 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 157 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 157 transition count 184
Applied a total of 52 rules in 19 ms. Remains 157 /183 variables (removed 26) and now considering 184/215 (removed 31) transitions.
// Phase 1: matrix 184 rows 157 cols
[2024-05-22 11:16:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:16:57] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 11:16:57] [INFO ] Invariant cache hit.
[2024-05-22 11:16:57] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-22 11:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 184/341 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:00] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 13/172 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 172 constraints, problems are : Problem set: 0 solved, 183 unsolved in 6171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/341 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 183/355 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 355 constraints, problems are : Problem set: 0 solved, 183 unsolved in 6189 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 13/13 constraints]
After SMT, in 12427ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 12430ms
Starting structural reductions in LTL mode, iteration 1 : 157/183 places, 184/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12617 ms. Remains : 157/183 places, 184/215 transitions.
Stuttering acceptance computed with spot in 496 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-02 finished in 13140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 172 transition count 204
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 172 transition count 204
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 166 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 166 transition count 194
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 160 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 160 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 154 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 152 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 150 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 150 transition count 176
Applied a total of 66 rules in 19 ms. Remains 150 /183 variables (removed 33) and now considering 176/215 (removed 39) transitions.
// Phase 1: matrix 176 rows 150 cols
[2024-05-22 11:17:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:17:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 11:17:10] [INFO ] Invariant cache hit.
[2024-05-22 11:17:10] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 11:17:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/326 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 166 constraints, problems are : Problem set: 0 solved, 175 unsolved in 5816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/326 variables, 150/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 175/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 341 constraints, problems are : Problem set: 0 solved, 175 unsolved in 6025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 14/14 constraints]
After SMT, in 11896ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 11899ms
Starting structural reductions in LTL mode, iteration 1 : 150/183 places, 176/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12095 ms. Remains : 150/183 places, 176/215 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-03 finished in 12191 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((F(G(p1))&&p0)))))'
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 173 transition count 205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 173 transition count 205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 168 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 168 transition count 197
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 163 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 163 transition count 192
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 158 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 158 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 156 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 156 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 154 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 154 transition count 181
Applied a total of 58 rules in 26 ms. Remains 154 /183 variables (removed 29) and now considering 181/215 (removed 34) transitions.
// Phase 1: matrix 181 rows 154 cols
[2024-05-22 11:17:22] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 11:17:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 11:17:23] [INFO ] Invariant cache hit.
[2024-05-22 11:17:23] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 11:17:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 181/335 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 13/169 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 169 constraints, problems are : Problem set: 0 solved, 180 unsolved in 6003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/335 variables, 154/169 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 180/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 349 constraints, problems are : Problem set: 0 solved, 180 unsolved in 6534 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 13/13 constraints]
After SMT, in 12582ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 12584ms
Starting structural reductions in LTL mode, iteration 1 : 154/183 places, 181/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12758 ms. Remains : 154/183 places, 181/215 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-05 finished in 12936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U p2))'
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 173 transition count 205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 173 transition count 205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 168 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 168 transition count 197
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 163 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 163 transition count 192
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 158 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 158 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 156 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 156 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 154 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 154 transition count 181
Applied a total of 58 rules in 7 ms. Remains 154 /183 variables (removed 29) and now considering 181/215 (removed 34) transitions.
// Phase 1: matrix 181 rows 154 cols
[2024-05-22 11:17:35] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 11:17:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 11:17:35] [INFO ] Invariant cache hit.
[2024-05-22 11:17:36] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 11:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 181/335 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 13/169 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 169 constraints, problems are : Problem set: 0 solved, 180 unsolved in 6117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/335 variables, 154/169 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 180/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 349 constraints, problems are : Problem set: 0 solved, 180 unsolved in 5977 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 13/13 constraints]
After SMT, in 12135ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 12137ms
Starting structural reductions in LTL mode, iteration 1 : 154/183 places, 181/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12279 ms. Remains : 154/183 places, 181/215 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-07 finished in 12382 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(F(p0))&&G((p1&&X((p1 U (!p0||G(p1)))))))))'
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 172 transition count 204
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 172 transition count 204
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 166 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 166 transition count 194
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 160 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 160 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 154 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 152 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 150 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 150 transition count 176
Applied a total of 66 rules in 11 ms. Remains 150 /183 variables (removed 33) and now considering 176/215 (removed 39) transitions.
// Phase 1: matrix 176 rows 150 cols
[2024-05-22 11:17:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:17:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:17:48] [INFO ] Invariant cache hit.
[2024-05-22 11:17:48] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 11:17:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/326 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:51] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:51] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:17:51] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 166 constraints, problems are : Problem set: 0 solved, 175 unsolved in 5788 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/326 variables, 150/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 175/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 341 constraints, problems are : Problem set: 0 solved, 175 unsolved in 5996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 14/14 constraints]
After SMT, in 11825ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 11827ms
Starting structural reductions in LTL mode, iteration 1 : 150/183 places, 176/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11969 ms. Remains : 150/183 places, 176/215 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-08 finished in 12161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Graph (complete) has 361 edges and 183 vertex of which 180 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 179 transition count 183
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 151 transition count 183
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 57 place count 151 transition count 156
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 111 place count 124 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 120 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 120 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 117 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 117 transition count 146
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 114 transition count 143
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 114 transition count 143
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 221 place count 69 transition count 98
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 228 place count 62 transition count 85
Iterating global reduction 2 with 7 rules applied. Total rules applied 235 place count 62 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 242 place count 55 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 249 place count 55 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 256 place count 48 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 263 place count 48 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 270 place count 41 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 277 place count 41 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 284 place count 34 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 291 place count 34 transition count 42
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 298 place count 27 transition count 34
Iterating global reduction 2 with 7 rules applied. Total rules applied 305 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 307 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 309 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 310 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 311 place count 24 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 313 place count 24 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 315 place count 22 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 318 place count 21 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 320 place count 19 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 320 place count 19 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 328 place count 15 transition count 20
Applied a total of 328 rules in 33 ms. Remains 15 /183 variables (removed 168) and now considering 20/215 (removed 195) transitions.
[2024-05-22 11:18:00] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2024-05-22 11:18:00] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:18:00] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 11:18:00] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2024-05-22 11:18:00] [INFO ] Invariant cache hit.
[2024-05-22 11:18:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:18:00] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 11:18:00] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 11:18:00] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2024-05-22 11:18:00] [INFO ] Invariant cache hit.
[2024-05-22 11:18:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 17 constraints, problems are : Problem set: 0 solved, 19 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 36 constraints, problems are : Problem set: 0 solved, 19 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 263ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/183 places, 20/215 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 15/183 places, 20/215 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-09
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-09 finished in 485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X((X(p2) U ((!p3&&X(p2))||X(G(p2))))))))'
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 174 transition count 206
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 174 transition count 206
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 169 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 169 transition count 198
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 164 transition count 193
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 164 transition count 193
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 159 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 159 transition count 186
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 157 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 157 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 155 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 155 transition count 182
Applied a total of 56 rules in 6 ms. Remains 155 /183 variables (removed 28) and now considering 182/215 (removed 33) transitions.
// Phase 1: matrix 182 rows 155 cols
[2024-05-22 11:18:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:18:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 11:18:00] [INFO ] Invariant cache hit.
[2024-05-22 11:18:01] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 11:18:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 182/337 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 16/173 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 0/337 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 173 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6289 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/337 variables, 155/173 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 181/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 354 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6374 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 16/16 constraints]
After SMT, in 12708ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 12711ms
Starting structural reductions in LTL mode, iteration 1 : 155/183 places, 182/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12859 ms. Remains : 155/183 places, 182/215 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 331 steps with 1 reset in 4 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-10 finished in 13098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Graph (complete) has 361 edges and 183 vertex of which 181 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 180 transition count 185
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 153 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 152 transition count 184
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 57 place count 152 transition count 155
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 115 place count 123 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 120 place count 118 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 125 place count 118 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 114 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 114 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 110 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 110 transition count 138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 109 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 109 transition count 137
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 227 place count 67 transition count 95
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 235 place count 59 transition count 80
Iterating global reduction 3 with 8 rules applied. Total rules applied 243 place count 59 transition count 80
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 251 place count 51 transition count 70
Iterating global reduction 3 with 8 rules applied. Total rules applied 259 place count 51 transition count 70
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 265 place count 45 transition count 59
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 45 transition count 59
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 277 place count 39 transition count 52
Iterating global reduction 3 with 6 rules applied. Total rules applied 283 place count 39 transition count 52
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 289 place count 33 transition count 41
Iterating global reduction 3 with 6 rules applied. Total rules applied 295 place count 33 transition count 41
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 301 place count 27 transition count 34
Iterating global reduction 3 with 6 rules applied. Total rules applied 307 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 309 place count 25 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 24 transition count 30
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 24 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 314 place count 24 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 22 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 23 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 323 place count 17 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 326 place count 14 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 332 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 334 place count 11 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 337 place count 8 transition count 13
Applied a total of 337 rules in 37 ms. Remains 8 /183 variables (removed 175) and now considering 13/215 (removed 202) transitions.
[2024-05-22 11:18:14] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-22 11:18:14] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:18:14] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 11:18:14] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-22 11:18:14] [INFO ] Invariant cache hit.
[2024-05-22 11:18:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 11:18:14] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-22 11:18:14] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-22 11:18:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 36 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/17 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 34 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/183 places, 13/215 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 8/183 places, 13/215 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-11 finished in 197 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(p1)&&p0))))'
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 173 transition count 205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 173 transition count 205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 168 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 168 transition count 196
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 163 transition count 191
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 163 transition count 191
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 158 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 158 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 157 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 157 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 156 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 156 transition count 183
Applied a total of 54 rules in 22 ms. Remains 156 /183 variables (removed 27) and now considering 183/215 (removed 32) transitions.
// Phase 1: matrix 183 rows 156 cols
[2024-05-22 11:18:14] [INFO ] Computed 2 invariants in 12 ms
[2024-05-22 11:18:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 11:18:14] [INFO ] Invariant cache hit.
[2024-05-22 11:18:14] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-22 11:18:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 183/339 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 11:18:16] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:18:16] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:18:16] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:16] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:16] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:18:16] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:18:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:18:17] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:18:17] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:18:17] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 11/169 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 169 constraints, problems are : Problem set: 0 solved, 182 unsolved in 6134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/339 variables, 156/169 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 182/351 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 351 constraints, problems are : Problem set: 0 solved, 182 unsolved in 6768 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 11/11 constraints]
After SMT, in 12948ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 12950ms
Starting structural reductions in LTL mode, iteration 1 : 156/183 places, 183/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13132 ms. Remains : 156/183 places, 183/215 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-12
Stuttering criterion allowed to conclude after 820 steps with 2 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-12 finished in 13249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((p0||G(F((p1 U (p2||G(p1))))))))))'
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 215/215 transitions.
Graph (complete) has 361 edges and 183 vertex of which 180 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 179 transition count 184
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 152 transition count 184
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 55 place count 152 transition count 156
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 111 place count 124 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 119 transition count 151
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 119 transition count 151
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 115 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 115 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 112 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 112 transition count 141
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 219 place count 70 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 226 place count 63 transition count 86
Iterating global reduction 2 with 7 rules applied. Total rules applied 233 place count 63 transition count 86
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 240 place count 56 transition count 77
Iterating global reduction 2 with 7 rules applied. Total rules applied 247 place count 56 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 254 place count 49 transition count 64
Iterating global reduction 2 with 7 rules applied. Total rules applied 261 place count 49 transition count 64
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 268 place count 42 transition count 56
Iterating global reduction 2 with 7 rules applied. Total rules applied 275 place count 42 transition count 56
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 281 place count 36 transition count 45
Iterating global reduction 2 with 6 rules applied. Total rules applied 287 place count 36 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 293 place count 30 transition count 38
Iterating global reduction 2 with 6 rules applied. Total rules applied 299 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 28 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 304 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 27 transition count 34
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 306 place count 27 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 27 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 309 place count 25 transition count 31
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 29 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 315 place count 20 transition count 25
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 319 place count 17 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 319 place count 17 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 321 place count 16 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 325 place count 14 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
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 329 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 332 place count 11 transition count 17
Applied a total of 332 rules in 20 ms. Remains 11 /183 variables (removed 172) and now considering 17/215 (removed 198) transitions.
[2024-05-22 11:18:27] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-05-22 11:18:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:18:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 11:18:27] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2024-05-22 11:18:27] [INFO ] Invariant cache hit.
[2024-05-22 11:18:27] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-22 11:18:27] [INFO ] Redundant transitions in 1 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-22 11:18:27] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2024-05-22 11:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 11 unsolved in 56 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/23 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 56 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/183 places, 17/215 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 11/183 places, 17/215 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-15
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-15 finished in 280 ms.
All properties solved by simple procedures.
Total runtime 111349 ms.

BK_STOP 1716376707778

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DiscoveryGPU-PT-09b, 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 r136-tall-171631132600420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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