Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414300404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DiscoveryGPU-PT-13b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414300404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.9K Feb 25 13:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 13:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678326060481

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 01:41:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 01:41:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:41:04] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-09 01:41:04] [INFO ] Transformed 380 places.
[2023-03-09 01:41:04] [INFO ] Transformed 404 transitions.
[2023-03-09 01:41:04] [INFO ] Found NUPN structural information;
[2023-03-09 01:41:04] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 85 place count 295 transition count 345
Iterating global reduction 1 with 59 rules applied. Total rules applied 144 place count 295 transition count 345
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 158 place count 281 transition count 331
Iterating global reduction 1 with 14 rules applied. Total rules applied 172 place count 281 transition count 331
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 183 place count 270 transition count 320
Iterating global reduction 1 with 11 rules applied. Total rules applied 194 place count 270 transition count 320
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 202 place count 262 transition count 312
Iterating global reduction 1 with 8 rules applied. Total rules applied 210 place count 262 transition count 312
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 217 place count 255 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 224 place count 255 transition count 298
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 231 place count 248 transition count 291
Iterating global reduction 1 with 7 rules applied. Total rules applied 238 place count 248 transition count 291
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 245 place count 241 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 252 place count 241 transition count 284
Applied a total of 252 rules in 209 ms. Remains 241 /380 variables (removed 139) and now considering 284/404 (removed 120) transitions.
// Phase 1: matrix 284 rows 241 cols
[2023-03-09 01:41:04] [INFO ] Computed 2 place invariants in 25 ms
[2023-03-09 01:41:05] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-09 01:41:05] [INFO ] Invariant cache hit.
[2023-03-09 01:41:05] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2023-03-09 01:41:05] [INFO ] Invariant cache hit.
[2023-03-09 01:41:05] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/380 places, 284/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1601 ms. Remains : 241/380 places, 284/404 transitions.
Support contains 26 out of 241 places after structural reductions.
[2023-03-09 01:41:06] [INFO ] Flatten gal took : 139 ms
[2023-03-09 01:41:06] [INFO ] Flatten gal took : 39 ms
[2023-03-09 01:41:06] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 25 out of 241 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 01:41:06] [INFO ] Invariant cache hit.
[2023-03-09 01:41:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 01:41:07] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 01:41:07] [INFO ] After 224ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-09 01:41:07] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 01:41:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 01:41:07] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 01:41:07] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-09 01:41:07] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 239 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 239 transition count 232
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 89 place count 202 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 201 transition count 231
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 90 place count 201 transition count 181
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 190 place count 151 transition count 181
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 193 place count 148 transition count 178
Iterating global reduction 3 with 3 rules applied. Total rules applied 196 place count 148 transition count 178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 199 place count 145 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 202 place count 145 transition count 173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 205 place count 142 transition count 169
Iterating global reduction 3 with 3 rules applied. Total rules applied 208 place count 142 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 209 place count 141 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 141 transition count 168
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 312 place count 90 transition count 117
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 178 edges and 90 vertex of which 20 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 26 rules applied. Total rules applied 338 place count 20 transition count 92
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 410 place count 20 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 411 place count 20 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 412 place count 19 transition count 18
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 13 rules applied. Total rules applied 425 place count 17 transition count 7
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 436 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 436 place count 6 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 438 place count 5 transition count 6
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 439 place count 5 transition count 6
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 440 place count 4 transition count 5
Iterating global reduction 7 with 1 rules applied. Total rules applied 441 place count 4 transition count 5
Applied a total of 441 rules in 117 ms. Remains 4 /241 variables (removed 237) and now considering 5/284 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 4/241 places, 5/284 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 479 edges and 241 vertex of which 238 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 238 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 237 transition count 242
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 199 transition count 242
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 77 place count 199 transition count 207
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 147 place count 164 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 160 transition count 203
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 160 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 157 place count 158 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 158 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 156 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 156 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 155 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 155 transition count 196
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 291 place count 92 transition count 133
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 302 place count 81 transition count 112
Iterating global reduction 2 with 11 rules applied. Total rules applied 313 place count 81 transition count 112
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 324 place count 70 transition count 99
Iterating global reduction 2 with 11 rules applied. Total rules applied 335 place count 70 transition count 99
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 346 place count 59 transition count 78
Iterating global reduction 2 with 11 rules applied. Total rules applied 357 place count 59 transition count 78
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 368 place count 48 transition count 66
Iterating global reduction 2 with 11 rules applied. Total rules applied 379 place count 48 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 389 place count 38 transition count 47
Iterating global reduction 2 with 10 rules applied. Total rules applied 399 place count 38 transition count 47
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 409 place count 28 transition count 36
Iterating global reduction 2 with 10 rules applied. Total rules applied 419 place count 28 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 421 place count 26 transition count 33
Iterating global reduction 2 with 2 rules applied. Total rules applied 423 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 424 place count 25 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 25 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 25 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 429 place count 22 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 429 place count 22 transition count 27
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 433 place count 20 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 437 place count 18 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 438 place count 18 transition count 24
Applied a total of 438 rules in 76 ms. Remains 18 /241 variables (removed 223) and now considering 24/284 (removed 260) transitions.
[2023-03-09 01:41:08] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2023-03-09 01:41:08] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-09 01:41:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 01:41:08] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-09 01:41:08] [INFO ] Invariant cache hit.
[2023-03-09 01:41:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 01:41:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-09 01:41:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:41:08] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-09 01:41:08] [INFO ] Invariant cache hit.
[2023-03-09 01:41:08] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/241 places, 24/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 18/241 places, 24/284 transitions.
Stuttering acceptance computed with spot in 339 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s15 0) (EQ s17 0)), p0:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 167 steps with 1 reset in 8 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-01 finished in 630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(X((p1 U G(p2)))))))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 231 transition count 274
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 231 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 228 transition count 269
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 228 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 225 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 225 transition count 266
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 222 transition count 263
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 222 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 221 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 221 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 220 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 220 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 219 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 219 transition count 259
Applied a total of 44 rules in 82 ms. Remains 219 /241 variables (removed 22) and now considering 259/284 (removed 25) transitions.
// Phase 1: matrix 259 rows 219 cols
[2023-03-09 01:41:08] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:41:09] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-09 01:41:09] [INFO ] Invariant cache hit.
[2023-03-09 01:41:09] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-09 01:41:09] [INFO ] Invariant cache hit.
[2023-03-09 01:41:09] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/241 places, 259/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 219/241 places, 259/284 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s181 0), p2:(AND (EQ s79 1) (EQ s218 1)), p1:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 824 steps with 1 reset in 7 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-02 finished in 1181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 238 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 237 transition count 242
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 199 transition count 242
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 77 place count 199 transition count 205
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 151 place count 162 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 155 place count 158 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 159 place count 158 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 155 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 155 transition count 196
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 152 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 152 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 151 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 151 transition count 191
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 295 place count 90 transition count 130
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 307 place count 78 transition count 107
Iterating global reduction 2 with 12 rules applied. Total rules applied 319 place count 78 transition count 107
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 331 place count 66 transition count 93
Iterating global reduction 2 with 12 rules applied. Total rules applied 343 place count 66 transition count 93
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 355 place count 54 transition count 70
Iterating global reduction 2 with 12 rules applied. Total rules applied 367 place count 54 transition count 70
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 379 place count 42 transition count 57
Iterating global reduction 2 with 12 rules applied. Total rules applied 391 place count 42 transition count 57
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 403 place count 30 transition count 34
Iterating global reduction 2 with 12 rules applied. Total rules applied 415 place count 30 transition count 34
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 426 place count 19 transition count 22
Iterating global reduction 2 with 11 rules applied. Total rules applied 437 place count 19 transition count 22
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 439 place count 17 transition count 19
Iterating global reduction 2 with 2 rules applied. Total rules applied 441 place count 17 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 442 place count 16 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 443 place count 16 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 444 place count 16 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 445 place count 15 transition count 16
Applied a total of 445 rules in 53 ms. Remains 15 /241 variables (removed 226) and now considering 16/284 (removed 268) transitions.
[2023-03-09 01:41:10] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2023-03-09 01:41:10] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 01:41:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 01:41:10] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-09 01:41:10] [INFO ] Invariant cache hit.
[2023-03-09 01:41:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 01:41:10] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 88 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/241 places, 16/284 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 13 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 11 transition count 13
Applied a total of 6 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 13/16 (removed 3) transitions.
[2023-03-09 01:41:10] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 11 cols
[2023-03-09 01:41:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 01:41:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 01:41:10] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-09 01:41:10] [INFO ] Invariant cache hit.
[2023-03-09 01:41:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 01:41:10] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/241 places, 13/284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 11/241 places, 13/284 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s9 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-03 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 230 transition count 273
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 230 transition count 273
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 225 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 225 transition count 265
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 220 transition count 259
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 220 transition count 259
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 215 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 215 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 213 transition count 251
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 211 transition count 249
Applied a total of 60 rules in 48 ms. Remains 211 /241 variables (removed 30) and now considering 249/284 (removed 35) transitions.
// Phase 1: matrix 249 rows 211 cols
[2023-03-09 01:41:10] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 01:41:10] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-09 01:41:10] [INFO ] Invariant cache hit.
[2023-03-09 01:41:11] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-09 01:41:11] [INFO ] Invariant cache hit.
[2023-03-09 01:41:11] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/241 places, 249/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 211/241 places, 249/284 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s147 1), p0:(AND (EQ s38 1) (EQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-05 finished in 962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 238 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 237 transition count 242
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 199 transition count 242
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 77 place count 199 transition count 206
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 149 place count 163 transition count 206
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 159 transition count 202
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 159 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 156 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 156 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 153 transition count 193
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 153 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 152 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 152 transition count 192
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 293 place count 91 transition count 131
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 305 place count 79 transition count 108
Iterating global reduction 2 with 12 rules applied. Total rules applied 317 place count 79 transition count 108
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 329 place count 67 transition count 94
Iterating global reduction 2 with 12 rules applied. Total rules applied 341 place count 67 transition count 94
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 352 place count 56 transition count 73
Iterating global reduction 2 with 11 rules applied. Total rules applied 363 place count 56 transition count 73
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 374 place count 45 transition count 61
Iterating global reduction 2 with 11 rules applied. Total rules applied 385 place count 45 transition count 61
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 396 place count 34 transition count 40
Iterating global reduction 2 with 11 rules applied. Total rules applied 407 place count 34 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 416 place count 25 transition count 30
Iterating global reduction 2 with 9 rules applied. Total rules applied 425 place count 25 transition count 30
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 427 place count 23 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 429 place count 23 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 430 place count 22 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 22 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 22 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 434 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 18 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 437 place count 18 transition count 20
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 441 place count 16 transition count 20
Applied a total of 441 rules in 55 ms. Remains 16 /241 variables (removed 225) and now considering 20/284 (removed 264) transitions.
[2023-03-09 01:41:11] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 16 cols
[2023-03-09 01:41:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 01:41:11] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-09 01:41:11] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2023-03-09 01:41:11] [INFO ] Invariant cache hit.
[2023-03-09 01:41:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 01:41:11] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-09 01:41:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:41:11] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2023-03-09 01:41:11] [INFO ] Invariant cache hit.
[2023-03-09 01:41:11] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/241 places, 20/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 16/241 places, 20/284 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 0) (EQ s9 0)), p2:(AND (EQ s7 1) (NOT (AND (EQ s12 1) (EQ s15 1)))), p1:(AND (EQ s12 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 885 reset in 346 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 17 in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-06 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 238 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 237 transition count 243
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 200 transition count 243
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 75 place count 200 transition count 206
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 149 place count 163 transition count 206
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 159 transition count 202
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 159 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 156 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 156 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 153 transition count 193
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 153 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 152 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 152 transition count 192
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 295 place count 90 transition count 130
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 307 place count 78 transition count 107
Iterating global reduction 2 with 12 rules applied. Total rules applied 319 place count 78 transition count 107
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 331 place count 66 transition count 93
Iterating global reduction 2 with 12 rules applied. Total rules applied 343 place count 66 transition count 93
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 355 place count 54 transition count 70
Iterating global reduction 2 with 12 rules applied. Total rules applied 367 place count 54 transition count 70
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 379 place count 42 transition count 57
Iterating global reduction 2 with 12 rules applied. Total rules applied 391 place count 42 transition count 57
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 402 place count 31 transition count 36
Iterating global reduction 2 with 11 rules applied. Total rules applied 413 place count 31 transition count 36
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 424 place count 20 transition count 24
Iterating global reduction 2 with 11 rules applied. Total rules applied 435 place count 20 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 437 place count 18 transition count 21
Iterating global reduction 2 with 2 rules applied. Total rules applied 439 place count 18 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 440 place count 17 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 441 place count 17 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 442 place count 17 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 443 place count 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 445 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 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 removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 449 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 450 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 450 place count 9 transition count 12
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 452 place count 8 transition count 12
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 456 place count 6 transition count 13
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 459 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 460 place count 5 transition count 9
Applied a total of 460 rules in 49 ms. Remains 5 /241 variables (removed 236) and now considering 9/284 (removed 275) transitions.
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 01:41:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:41:12] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2023-03-09 01:41:12] [INFO ] Invariant cache hit.
[2023-03-09 01:41:12] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-09 01:41:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2023-03-09 01:41:12] [INFO ] Invariant cache hit.
[2023-03-09 01:41:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/241 places, 9/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 5/241 places, 9/284 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-07 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 238 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 237 transition count 243
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 200 transition count 243
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 75 place count 200 transition count 207
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 147 place count 164 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 160 transition count 203
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 160 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 158 place count 157 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 161 place count 157 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 164 place count 154 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 154 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 153 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 153 transition count 193
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 295 place count 90 transition count 130
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 307 place count 78 transition count 107
Iterating global reduction 2 with 12 rules applied. Total rules applied 319 place count 78 transition count 107
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 331 place count 66 transition count 93
Iterating global reduction 2 with 12 rules applied. Total rules applied 343 place count 66 transition count 93
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 355 place count 54 transition count 70
Iterating global reduction 2 with 12 rules applied. Total rules applied 367 place count 54 transition count 70
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 378 place count 43 transition count 58
Iterating global reduction 2 with 11 rules applied. Total rules applied 389 place count 43 transition count 58
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 400 place count 32 transition count 37
Iterating global reduction 2 with 11 rules applied. Total rules applied 411 place count 32 transition count 37
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 422 place count 21 transition count 25
Iterating global reduction 2 with 11 rules applied. Total rules applied 433 place count 21 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 435 place count 19 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 437 place count 19 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 438 place count 18 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 439 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 441 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 25 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 444 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 445 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 447 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 449 place count 10 transition count 15
Applied a total of 449 rules in 40 ms. Remains 10 /241 variables (removed 231) and now considering 15/284 (removed 269) transitions.
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2023-03-09 01:41:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 01:41:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-09 01:41:12] [INFO ] Invariant cache hit.
[2023-03-09 01:41:12] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-09 01:41:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-09 01:41:12] [INFO ] Invariant cache hit.
[2023-03-09 01:41:12] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/241 places, 15/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 10/241 places, 15/284 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s9 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-08 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F(p1))))'
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 238 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 237 transition count 242
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 199 transition count 242
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 77 place count 199 transition count 207
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 147 place count 164 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 161 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 161 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 159 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 159 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 159 place count 157 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 157 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 156 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 156 transition count 197
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 287 place count 94 transition count 135
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 298 place count 83 transition count 114
Iterating global reduction 2 with 11 rules applied. Total rules applied 309 place count 83 transition count 114
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 320 place count 72 transition count 101
Iterating global reduction 2 with 11 rules applied. Total rules applied 331 place count 72 transition count 101
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 341 place count 62 transition count 82
Iterating global reduction 2 with 10 rules applied. Total rules applied 351 place count 62 transition count 82
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 361 place count 52 transition count 71
Iterating global reduction 2 with 10 rules applied. Total rules applied 371 place count 52 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 381 place count 42 transition count 52
Iterating global reduction 2 with 10 rules applied. Total rules applied 391 place count 42 transition count 52
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 400 place count 33 transition count 42
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 33 transition count 42
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 411 place count 31 transition count 39
Iterating global reduction 2 with 2 rules applied. Total rules applied 413 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 414 place count 30 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 415 place count 30 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 30 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 28 transition count 36
Applied a total of 418 rules in 45 ms. Remains 28 /241 variables (removed 213) and now considering 36/284 (removed 248) transitions.
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 28 cols
[2023-03-09 01:41:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 01:41:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2023-03-09 01:41:12] [INFO ] Invariant cache hit.
[2023-03-09 01:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 01:41:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-09 01:41:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:41:12] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2023-03-09 01:41:12] [INFO ] Invariant cache hit.
[2023-03-09 01:41:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/241 places, 36/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 28/241 places, 36/284 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s21 1) (EQ s25 1)), p0:(OR (AND (EQ s11 1) (EQ s27 1)) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8380 reset in 281 ms.
Stack based approach found an accepted trace after 33 steps with 2 reset with depth 15 and stack size 15 in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-10 finished in 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 239 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 removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 238 transition count 244
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 201 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 200 transition count 243
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 77 place count 200 transition count 206
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 151 place count 163 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 160 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 160 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 157 transition count 198
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 157 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 154 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 154 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 170 place count 153 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 171 place count 153 transition count 193
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 295 place count 91 transition count 131
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 305 place count 81 transition count 111
Iterating global reduction 3 with 10 rules applied. Total rules applied 315 place count 81 transition count 111
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 325 place count 71 transition count 100
Iterating global reduction 3 with 10 rules applied. Total rules applied 335 place count 71 transition count 100
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 345 place count 61 transition count 81
Iterating global reduction 3 with 10 rules applied. Total rules applied 355 place count 61 transition count 81
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 365 place count 51 transition count 70
Iterating global reduction 3 with 10 rules applied. Total rules applied 375 place count 51 transition count 70
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 385 place count 41 transition count 51
Iterating global reduction 3 with 10 rules applied. Total rules applied 395 place count 41 transition count 51
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 405 place count 31 transition count 40
Iterating global reduction 3 with 10 rules applied. Total rules applied 415 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 416 place count 30 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 30 transition count 39
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 419 place count 30 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 421 place count 28 transition count 35
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 30 edges and 26 vertex of which 23 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 removed 3 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 11 rules applied. Total rules applied 432 place count 23 transition count 24
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 440 place count 15 transition count 24
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 446 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 447 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 450 place count 9 transition count 17
Applied a total of 450 rules in 39 ms. Remains 9 /241 variables (removed 232) and now considering 17/284 (removed 267) transitions.
[2023-03-09 01:41:13] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2023-03-09 01:41:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:41:13] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 01:41:13] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2023-03-09 01:41:13] [INFO ] Invariant cache hit.
[2023-03-09 01:41:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-09 01:41:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:41:13] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2023-03-09 01:41:13] [INFO ] Invariant cache hit.
[2023-03-09 01:41:13] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/241 places, 17/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 9/241 places, 17/284 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-11 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 479 edges and 241 vertex of which 238 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 237 transition count 244
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 201 transition count 244
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 73 place count 201 transition count 207
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 147 place count 164 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 160 transition count 203
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 160 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 158 place count 157 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 161 place count 157 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 164 place count 154 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 154 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 153 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 153 transition count 193
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 291 place count 92 transition count 132
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 303 place count 80 transition count 109
Iterating global reduction 2 with 12 rules applied. Total rules applied 315 place count 80 transition count 109
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 327 place count 68 transition count 95
Iterating global reduction 2 with 12 rules applied. Total rules applied 339 place count 68 transition count 95
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 350 place count 57 transition count 74
Iterating global reduction 2 with 11 rules applied. Total rules applied 361 place count 57 transition count 74
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 372 place count 46 transition count 62
Iterating global reduction 2 with 11 rules applied. Total rules applied 383 place count 46 transition count 62
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 394 place count 35 transition count 41
Iterating global reduction 2 with 11 rules applied. Total rules applied 405 place count 35 transition count 41
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 416 place count 24 transition count 29
Iterating global reduction 2 with 11 rules applied. Total rules applied 427 place count 24 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 429 place count 22 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 431 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 432 place count 21 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 21 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 21 transition count 24
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 436 place count 21 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 19 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 443 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 445 place count 12 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 451 place count 9 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 453 place count 8 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 454 place count 8 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 455 place count 7 transition count 13
Applied a total of 455 rules in 40 ms. Remains 7 /241 variables (removed 234) and now considering 13/284 (removed 271) transitions.
[2023-03-09 01:41:13] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 7 cols
[2023-03-09 01:41:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:41:13] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 01:41:13] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-09 01:41:13] [INFO ] Invariant cache hit.
[2023-03-09 01:41:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-09 01:41:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:41:13] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-09 01:41:13] [INFO ] Invariant cache hit.
[2023-03-09 01:41:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/241 places, 13/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 7/241 places, 13/284 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(NEQ s4 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 128 steps with 6 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-12 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X(F(X(X(F(p0))))) U X(X(!p0))))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 229 transition count 272
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 229 transition count 272
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 224 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 224 transition count 264
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 219 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 219 transition count 258
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 214 transition count 253
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 214 transition count 253
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 212 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 210 transition count 248
Applied a total of 62 rules in 21 ms. Remains 210 /241 variables (removed 31) and now considering 248/284 (removed 36) transitions.
// Phase 1: matrix 248 rows 210 cols
[2023-03-09 01:41:13] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-09 01:41:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 01:41:13] [INFO ] Invariant cache hit.
[2023-03-09 01:41:13] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-09 01:41:13] [INFO ] Invariant cache hit.
[2023-03-09 01:41:13] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/241 places, 248/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 210/241 places, 248/284 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p0:(AND (EQ s187 1) (EQ s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-13 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(F(p1))) U (G((!p0||X(F(p1))))||((!p0||X(F(p1)))&&X(p0)))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 230 transition count 273
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 230 transition count 273
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 226 transition count 267
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 226 transition count 267
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 222 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 222 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 218 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 218 transition count 258
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 216 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 216 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 215 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 214 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 214 transition count 253
Applied a total of 54 rules in 25 ms. Remains 214 /241 variables (removed 27) and now considering 253/284 (removed 31) transitions.
// Phase 1: matrix 253 rows 214 cols
[2023-03-09 01:41:14] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:41:14] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-09 01:41:14] [INFO ] Invariant cache hit.
[2023-03-09 01:41:14] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-09 01:41:14] [INFO ] Invariant cache hit.
[2023-03-09 01:41:15] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 214/241 places, 253/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 214/241 places, 253/284 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s64 1) (EQ s210 1)), p1:(NEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-15 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-15 finished in 996 ms.
All properties solved by simple procedures.
Total runtime 11352 ms.
ITS solved all properties within timeout

BK_STOP 1678326076266

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-13b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DiscoveryGPU-PT-13b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414300404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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