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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 13:31 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 4.0K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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 68K 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-09b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678790825649

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 10:47:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:47:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:47:08] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-14 10:47:08] [INFO ] Transformed 268 places.
[2023-03-14 10:47:08] [INFO ] Transformed 284 transitions.
[2023-03-14 10:47:08] [INFO ] Found NUPN structural information;
[2023-03-14 10:47:08] [INFO ] Parsed PT model containing 268 places and 284 transitions and 740 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 250 transition count 284
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 60 place count 208 transition count 242
Iterating global reduction 1 with 42 rules applied. Total rules applied 102 place count 208 transition count 242
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 200 transition count 234
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 200 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 124 place count 194 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 130 place count 194 transition count 228
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 136 place count 188 transition count 222
Iterating global reduction 1 with 6 rules applied. Total rules applied 142 place count 188 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 146 place count 184 transition count 214
Iterating global reduction 1 with 4 rules applied. Total rules applied 150 place count 184 transition count 214
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 154 place count 180 transition count 210
Iterating global reduction 1 with 4 rules applied. Total rules applied 158 place count 180 transition count 210
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 177 transition count 207
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 177 transition count 207
Applied a total of 164 rules in 109 ms. Remains 177 /268 variables (removed 91) and now considering 207/284 (removed 77) transitions.
// Phase 1: matrix 207 rows 177 cols
[2023-03-14 10:47:08] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-14 10:47:09] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-14 10:47:09] [INFO ] Invariant cache hit.
[2023-03-14 10:47:09] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2023-03-14 10:47:09] [INFO ] Invariant cache hit.
[2023-03-14 10:47:10] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 177/268 places, 207/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1347 ms. Remains : 177/268 places, 207/284 transitions.
Support contains 31 out of 177 places after structural reductions.
[2023-03-14 10:47:10] [INFO ] Flatten gal took : 62 ms
[2023-03-14 10:47:10] [INFO ] Flatten gal took : 24 ms
[2023-03-14 10:47:10] [INFO ] Input system was already deterministic with 207 transitions.
Support contains 30 out of 177 places (down from 31) after GAL structural reductions.
Finished random walk after 2621 steps, including 8 resets, run visited all 33 properties in 163 ms. (steps per millisecond=16 )
Computed a total of 33 stabilizing places and 33 stable transitions
Graph (complete) has 347 edges and 177 vertex of which 175 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Graph (complete) has 347 edges and 177 vertex of which 175 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 174 transition count 175
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 145 transition count 175
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 59 place count 145 transition count 149
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 111 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 115 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 115 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 119 place count 115 transition count 143
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 114 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 112 transition count 141
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 112 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 111 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 110 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 110 transition count 138
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 217 place count 66 transition count 94
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 225 place count 58 transition count 79
Iterating global reduction 2 with 8 rules applied. Total rules applied 233 place count 58 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 240 place count 51 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 247 place count 51 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 254 place count 44 transition count 57
Iterating global reduction 2 with 7 rules applied. Total rules applied 261 place count 44 transition count 57
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 268 place count 37 transition count 50
Iterating global reduction 2 with 7 rules applied. Total rules applied 275 place count 37 transition count 50
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 282 place count 30 transition count 36
Iterating global reduction 2 with 7 rules applied. Total rules applied 289 place count 30 transition count 36
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 296 place count 23 transition count 29
Iterating global reduction 2 with 7 rules applied. Total rules applied 303 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 304 place count 22 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 306 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 21 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 308 place count 21 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 311 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 20 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 318 place count 14 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 322 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 326 place count 8 transition count 14
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 328 place count 7 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 329 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 330 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 332 place count 5 transition count 10
Applied a total of 332 rules in 92 ms. Remains 5 /177 variables (removed 172) and now considering 10/207 (removed 197) transitions.
[2023-03-14 10:47:11] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-14 10:47:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 10:47:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-14 10:47:11] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-14 10:47:11] [INFO ] Invariant cache hit.
[2023-03-14 10:47:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-14 10:47:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 10:47:11] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-14 10:47:11] [INFO ] Invariant cache hit.
[2023-03-14 10:47:11] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/177 places, 10/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 5/177 places, 10/207 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-00 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:(EQ s3 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-00 finished in 524 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 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Graph (complete) has 347 edges and 177 vertex of which 175 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 174 transition count 175
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 145 transition count 175
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 59 place count 145 transition count 149
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 111 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 115 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 115 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 113 transition count 142
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 113 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 112 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 111 transition count 139
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 217 place count 66 transition count 94
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 224 place count 59 transition count 81
Iterating global reduction 2 with 7 rules applied. Total rules applied 231 place count 59 transition count 81
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 238 place count 52 transition count 72
Iterating global reduction 2 with 7 rules applied. Total rules applied 245 place count 52 transition count 72
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 252 place count 45 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 259 place count 45 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 266 place count 38 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 273 place count 38 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 280 place count 31 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 31 transition count 38
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 294 place count 24 transition count 30
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 24 transition count 30
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 303 place count 22 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 305 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 306 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 21 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 308 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 19 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 312 place count 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 313 place count 17 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 313 place count 17 transition count 19
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 319 place count 14 transition count 19
Applied a total of 319 rules in 67 ms. Remains 14 /177 variables (removed 163) and now considering 19/207 (removed 188) transitions.
[2023-03-14 10:47:11] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2023-03-14 10:47:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 10:47:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 10:47:11] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2023-03-14 10:47:11] [INFO ] Invariant cache hit.
[2023-03-14 10:47:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 10:47:11] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-14 10:47:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 10:47:11] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2023-03-14 10:47:11] [INFO ] Invariant cache hit.
[2023-03-14 10:47:11] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/177 places, 19/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 14/177 places, 19/207 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-01 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:(AND (EQ s3 1) (EQ s13 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]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-01 finished in 283 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) U (G((X(p1) U !p0))||p2)))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 167 transition count 196
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 167 transition count 196
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 162 transition count 190
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 162 transition count 190
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 158 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 158 transition count 186
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 155 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 155 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 153 transition count 179
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 153 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 151 transition count 177
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 151 transition count 177
Applied a total of 52 rules in 31 ms. Remains 151 /177 variables (removed 26) and now considering 177/207 (removed 30) transitions.
// Phase 1: matrix 177 rows 151 cols
[2023-03-14 10:47:11] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-14 10:47:12] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-14 10:47:12] [INFO ] Invariant cache hit.
[2023-03-14 10:47:12] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-14 10:47:12] [INFO ] Invariant cache hit.
[2023-03-14 10:47:12] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/177 places, 177/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 151/177 places, 177/207 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s134 1) (EQ s147 1)), p0:(EQ s10 1), p1:(AND (EQ s119 1) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 465 reset in 410 ms.
Stack based approach found an accepted trace after 1602 steps with 7 reset with depth 64 and stack size 64 in 9 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-02 finished in 1025 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(G(X(p0)))||p1) U (X(p0) U p2)))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 167 transition count 197
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 167 transition count 197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 163 transition count 192
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 163 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 160 transition count 189
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 160 transition count 189
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 157 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 157 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 155 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 155 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 153 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 153 transition count 180
Applied a total of 48 rules in 17 ms. Remains 153 /177 variables (removed 24) and now considering 180/207 (removed 27) transitions.
// Phase 1: matrix 180 rows 153 cols
[2023-03-14 10:47:13] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-14 10:47:13] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-14 10:47:13] [INFO ] Invariant cache hit.
[2023-03-14 10:47:13] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-14 10:47:13] [INFO ] Invariant cache hit.
[2023-03-14 10:47:13] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/177 places, 180/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 153/177 places, 180/207 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s21 1) (EQ s149 1)), p1:(EQ s41 1), p0:(EQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-03 finished in 626 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((p0&&G(p1)&&X(F((p2||X(p3)))))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 167 transition count 196
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 167 transition count 196
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 162 transition count 190
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 162 transition count 190
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 158 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 158 transition count 186
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 155 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 155 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 153 transition count 179
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 153 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 151 transition count 177
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 151 transition count 177
Applied a total of 52 rules in 20 ms. Remains 151 /177 variables (removed 26) and now considering 177/207 (removed 30) transitions.
// Phase 1: matrix 177 rows 151 cols
[2023-03-14 10:47:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 10:47:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-14 10:47:13] [INFO ] Invariant cache hit.
[2023-03-14 10:47:13] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-14 10:47:13] [INFO ] Invariant cache hit.
[2023-03-14 10:47:14] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/177 places, 177/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 151/177 places, 177/207 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p1 p2) (AND p1 p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s65 1), p2:(EQ s135 0), p3:(EQ s22 0), p0:(EQ s135 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-04 finished in 800 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((G((p0||G(p1)))||F(p2))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 168 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 168 transition count 197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 164 transition count 193
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 164 transition count 193
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 161 transition count 190
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 161 transition count 190
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 159 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 159 transition count 186
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 157 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 157 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 155 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 155 transition count 182
Applied a total of 44 rules in 18 ms. Remains 155 /177 variables (removed 22) and now considering 182/207 (removed 25) transitions.
// Phase 1: matrix 182 rows 155 cols
[2023-03-14 10:47:14] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-14 10:47:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-14 10:47:14] [INFO ] Invariant cache hit.
[2023-03-14 10:47:14] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-14 10:47:14] [INFO ] Invariant cache hit.
[2023-03-14 10:47:14] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/177 places, 182/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 155/177 places, 182/207 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s75 1), p2:(AND (EQ s38 1) (EQ s151 1)), p0:(EQ s117 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][false, false, false, false]]
Product exploration explored 100000 steps with 676 reset in 234 ms.
Stack based approach found an accepted trace after 89 steps with 0 reset with depth 90 and stack size 90 in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-05 finished in 792 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 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Graph (complete) has 347 edges and 177 vertex of which 175 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 174 transition count 176
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 146 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 145 transition count 175
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 59 place count 145 transition count 149
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 111 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 115 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 115 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 113 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 113 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 112 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 111 transition count 139
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 215 place count 67 transition count 95
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 223 place count 59 transition count 80
Iterating global reduction 3 with 8 rules applied. Total rules applied 231 place count 59 transition count 80
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 239 place count 51 transition count 70
Iterating global reduction 3 with 8 rules applied. Total rules applied 247 place count 51 transition count 70
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 254 place count 44 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 261 place count 44 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 268 place count 37 transition count 49
Iterating global reduction 3 with 7 rules applied. Total rules applied 275 place count 37 transition count 49
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 282 place count 30 transition count 36
Iterating global reduction 3 with 7 rules applied. Total rules applied 289 place count 30 transition count 36
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 295 place count 24 transition count 29
Iterating global reduction 3 with 6 rules applied. Total rules applied 301 place count 24 transition count 29
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 303 place count 22 transition count 26
Iterating global reduction 3 with 2 rules applied. Total rules applied 305 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 306 place count 21 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 307 place count 21 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 308 place count 21 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 19 transition count 22
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 3 with 2 rules applied. Total rules applied 312 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 313 place count 17 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 313 place count 17 transition count 18
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 319 place count 14 transition count 18
Applied a total of 319 rules in 39 ms. Remains 14 /177 variables (removed 163) and now considering 18/207 (removed 189) transitions.
[2023-03-14 10:47:15] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 14 cols
[2023-03-14 10:47:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 10:47:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 10:47:15] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
[2023-03-14 10:47:15] [INFO ] Invariant cache hit.
[2023-03-14 10:47:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 10:47:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-14 10:47:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 10:47:15] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
[2023-03-14 10:47:15] [INFO ] Invariant cache hit.
[2023-03-14 10:47:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/177 places, 18/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 14/177 places, 18/207 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-07 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:(OR (EQ s7 0) (EQ s13 0) (EQ s10 1)), p1:(AND (EQ s7 1) (EQ s13 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 123 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-07 finished in 281 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(G(p0)))'
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 166 transition count 195
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 166 transition count 195
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 161 transition count 189
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 161 transition count 189
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 157 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 157 transition count 185
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 154 transition count 180
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 152 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 150 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 150 transition count 176
Applied a total of 54 rules in 13 ms. Remains 150 /177 variables (removed 27) and now considering 176/207 (removed 31) transitions.
// Phase 1: matrix 176 rows 150 cols
[2023-03-14 10:47:15] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-14 10:47:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-14 10:47:15] [INFO ] Invariant cache hit.
[2023-03-14 10:47:15] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-14 10:47:15] [INFO ] Invariant cache hit.
[2023-03-14 10:47:15] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/177 places, 176/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 150/177 places, 176/207 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s26 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-08 finished in 521 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)&&(F(G(p1)) U p2)))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Graph (complete) has 347 edges and 177 vertex of which 175 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 174 transition count 177
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 147 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 146 transition count 176
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 57 place count 146 transition count 150
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 109 place count 120 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 113 place count 116 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 116 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 114 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 114 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 113 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 113 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 112 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 112 transition count 140
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 211 place count 69 transition count 97
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 219 place count 61 transition count 82
Iterating global reduction 3 with 8 rules applied. Total rules applied 227 place count 61 transition count 82
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 235 place count 53 transition count 72
Iterating global reduction 3 with 8 rules applied. Total rules applied 243 place count 53 transition count 72
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 251 place count 45 transition count 57
Iterating global reduction 3 with 8 rules applied. Total rules applied 259 place count 45 transition count 57
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 267 place count 37 transition count 48
Iterating global reduction 3 with 8 rules applied. Total rules applied 275 place count 37 transition count 48
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 281 place count 31 transition count 37
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 place count 31 transition count 37
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 292 place count 26 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 297 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 298 place count 25 transition count 30
Iterating global reduction 3 with 1 rules applied. Total rules applied 299 place count 25 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 300 place count 24 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 24 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 24 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 24 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 305 place count 22 transition count 26
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 3 with 2 rules applied. Total rules applied 307 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 20 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 308 place count 20 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 312 place count 18 transition count 23
Applied a total of 312 rules in 32 ms. Remains 18 /177 variables (removed 159) and now considering 23/207 (removed 184) transitions.
[2023-03-14 10:47:16] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 18 cols
[2023-03-14 10:47:16] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 10:47:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 10:47:16] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-14 10:47:16] [INFO ] Invariant cache hit.
[2023-03-14 10:47:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 10:47:16] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-14 10:47:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 10:47:16] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-14 10:47:16] [INFO ] Invariant cache hit.
[2023-03-14 10:47:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/177 places, 23/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 18/177 places, 23/207 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ 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}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s11 1), p2:(EQ s15 1), p1:(AND (EQ s8 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 125 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-09 finished in 327 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 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Graph (complete) has 347 edges and 177 vertex of which 175 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 174 transition count 176
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 146 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 145 transition count 175
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 59 place count 145 transition count 149
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 111 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 115 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 115 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 113 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 113 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 112 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 111 transition count 139
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 215 place count 67 transition count 95
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 222 place count 60 transition count 82
Iterating global reduction 3 with 7 rules applied. Total rules applied 229 place count 60 transition count 82
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 236 place count 53 transition count 73
Iterating global reduction 3 with 7 rules applied. Total rules applied 243 place count 53 transition count 73
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 249 place count 47 transition count 62
Iterating global reduction 3 with 6 rules applied. Total rules applied 255 place count 47 transition count 62
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 261 place count 41 transition count 55
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 41 transition count 55
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 273 place count 35 transition count 44
Iterating global reduction 3 with 6 rules applied. Total rules applied 279 place count 35 transition count 44
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 285 place count 29 transition count 37
Iterating global reduction 3 with 6 rules applied. Total rules applied 291 place count 29 transition count 37
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 293 place count 27 transition count 34
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 296 place count 26 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 26 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 298 place count 26 transition count 32
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 300 place count 24 transition count 30
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 3 with 2 rules applied. Total rules applied 302 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 22 transition count 29
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 303 place count 22 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 311 place count 18 transition count 25
Applied a total of 311 rules in 28 ms. Remains 18 /177 variables (removed 159) and now considering 25/207 (removed 182) transitions.
[2023-03-14 10:47:16] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 18 cols
[2023-03-14 10:47:16] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 10:47:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 10:47:16] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2023-03-14 10:47:16] [INFO ] Invariant cache hit.
[2023-03-14 10:47:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 10:47:16] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-14 10:47:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 10:47:16] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2023-03-14 10:47:16] [INFO ] Invariant cache hit.
[2023-03-14 10:47:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/177 places, 25/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 18/177 places, 25/207 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s17 1) (EQ s14 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 109 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-10 finished in 191 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(p0) U (X(p1) U p2)))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 168 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 168 transition count 197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 164 transition count 192
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 164 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 161 transition count 189
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 161 transition count 189
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 159 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 159 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 158 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 158 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 157 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 157 transition count 184
Applied a total of 40 rules in 18 ms. Remains 157 /177 variables (removed 20) and now considering 184/207 (removed 23) transitions.
// Phase 1: matrix 184 rows 157 cols
[2023-03-14 10:47:16] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 10:47:16] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-14 10:47:16] [INFO ] Invariant cache hit.
[2023-03-14 10:47:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-14 10:47:16] [INFO ] Invariant cache hit.
[2023-03-14 10:47:16] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/177 places, 184/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 157/177 places, 184/207 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s119 1) (EQ s153 1)), p0:(OR (EQ s46 1) (AND (EQ s119 1) (EQ s153 1))), p1:(EQ s46 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-11 finished in 566 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)&&F(p1)&&F((X(F(p3))&&p2))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 168 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 168 transition count 197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 164 transition count 192
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 164 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 161 transition count 189
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 161 transition count 189
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 159 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 159 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 158 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 158 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 157 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 157 transition count 184
Applied a total of 40 rules in 10 ms. Remains 157 /177 variables (removed 20) and now considering 184/207 (removed 23) transitions.
// Phase 1: matrix 184 rows 157 cols
[2023-03-14 10:47:17] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 10:47:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-14 10:47:17] [INFO ] Invariant cache hit.
[2023-03-14 10:47:17] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-14 10:47:17] [INFO ] Invariant cache hit.
[2023-03-14 10:47:17] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/177 places, 184/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 157/177 places, 184/207 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s137 0), p1:(EQ s41 0), p2:(AND (EQ s48 1) (EQ s153 1)), p3:(OR (EQ s48 0) (EQ s153 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 499 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-12 finished in 655 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)||X(X(X((p1||F(G(p2))))))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 167 transition count 196
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 167 transition count 196
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 163 transition count 191
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 163 transition count 191
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 159 transition count 187
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 159 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 156 transition count 182
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 156 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 154 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 152 transition count 178
Applied a total of 50 rules in 13 ms. Remains 152 /177 variables (removed 25) and now considering 178/207 (removed 29) transitions.
// Phase 1: matrix 178 rows 152 cols
[2023-03-14 10:47:17] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-14 10:47:17] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-14 10:47:17] [INFO ] Invariant cache hit.
[2023-03-14 10:47:18] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-14 10:47:18] [INFO ] Invariant cache hit.
[2023-03-14 10:47:18] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/177 places, 178/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 152/177 places, 178/207 transitions.
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s23 0), p1:(EQ s147 0), p2:(EQ s75 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 236 ms.
Product exploration explored 100000 steps with 25000 reset in 203 ms.
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 305 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 31 stabilizing places and 31 stable transitions
Detected a total of 31/152 stabilizing places and 31/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 471 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:47:19] [INFO ] Invariant cache hit.
[2023-03-14 10:47:19] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:47:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 10:47:20] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:47:20] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
[2023-03-14 10:47:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 95 ms
[2023-03-14 10:47:20] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-14 10:47:20] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 385 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 178/178 transitions.
Applied a total of 0 rules in 10 ms. Remains 152 /152 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-14 10:47:21] [INFO ] Invariant cache hit.
[2023-03-14 10:47:21] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-14 10:47:21] [INFO ] Invariant cache hit.
[2023-03-14 10:47:21] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-14 10:47:21] [INFO ] Invariant cache hit.
[2023-03-14 10:47:21] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 152/152 places, 178/178 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 305 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 31 stabilizing places and 31 stable transitions
Detected a total of 31/152 stabilizing places and 31/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 797 steps, including 2 resets, run visited all 3 properties in 7 ms. (steps per millisecond=113 )
Knowledge obtained : [(AND p2 p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Product exploration explored 100000 steps with 25000 reset in 146 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 178/178 transitions.
Graph (complete) has 305 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 151 transition count 177
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 19 place count 151 transition count 177
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 49 place count 151 transition count 177
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 70 place count 151 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 149 transition count 183
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 149 transition count 183
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 92 place count 149 transition count 219
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 142 transition count 205
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 142 transition count 205
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 127 place count 121 transition count 170
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 148 place count 121 transition count 170
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 167 place count 102 transition count 139
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 186 place count 102 transition count 139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 192 place count 96 transition count 133
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 198 place count 96 transition count 133
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 210 place count 84 transition count 115
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 222 place count 84 transition count 115
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 246 place count 60 transition count 79
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 270 place count 60 transition count 79
Deduced a syphon composed of 34 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 276 place count 60 transition count 73
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 279 place count 57 transition count 70
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 282 place count 57 transition count 70
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 282 rules in 41 ms. Remains 57 /152 variables (removed 95) and now considering 70/178 (removed 108) transitions.
[2023-03-14 10:47:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 10:47:24] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
// Phase 1: matrix 67 rows 57 cols
[2023-03-14 10:47:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 10:47:24] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/152 places, 70/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 57/152 places, 70/178 transitions.
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 152 cols
[2023-03-14 10:47:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 10:47:24] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-14 10:47:24] [INFO ] Invariant cache hit.
[2023-03-14 10:47:24] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-14 10:47:24] [INFO ] Invariant cache hit.
[2023-03-14 10:47:24] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 152/152 places, 178/178 transitions.
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-14 finished in 7220 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 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 207/207 transitions.
Graph (complete) has 347 edges and 177 vertex of which 175 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 174 transition count 175
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 145 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 144 transition count 174
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 61 place count 144 transition count 148
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 113 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 117 place count 114 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 114 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 121 place count 114 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 113 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 111 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 111 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 110 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 110 transition count 138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 109 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 109 transition count 137
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 219 place count 65 transition count 93
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 227 place count 57 transition count 78
Iterating global reduction 3 with 8 rules applied. Total rules applied 235 place count 57 transition count 78
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 243 place count 49 transition count 68
Iterating global reduction 3 with 8 rules applied. Total rules applied 251 place count 49 transition count 68
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 258 place count 42 transition count 55
Iterating global reduction 3 with 7 rules applied. Total rules applied 265 place count 42 transition count 55
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 272 place count 35 transition count 47
Iterating global reduction 3 with 7 rules applied. Total rules applied 279 place count 35 transition count 47
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 286 place count 28 transition count 34
Iterating global reduction 3 with 7 rules applied. Total rules applied 293 place count 28 transition count 34
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 300 place count 21 transition count 26
Iterating global reduction 3 with 7 rules applied. Total rules applied 307 place count 21 transition count 26
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 309 place count 19 transition count 23
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 18 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 314 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 16 edges and 14 vertex of which 11 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 3 with 5 rules applied. Total rules applied 321 place count 11 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 323 place count 9 transition count 14
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 5 with 4 rules applied. Total rules applied 327 place count 7 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 329 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 5 transition count 8
Applied a total of 331 rules in 35 ms. Remains 5 /177 variables (removed 172) and now considering 8/207 (removed 199) transitions.
[2023-03-14 10:47:24] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2023-03-14 10:47:24] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 10:47:25] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-14 10:47:25] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2023-03-14 10:47:25] [INFO ] Invariant cache hit.
[2023-03-14 10:47:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-14 10:47:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 10:47:25] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2023-03-14 10:47:25] [INFO ] Invariant cache hit.
[2023-03-14 10:47:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/177 places, 8/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 5/177 places, 8/207 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-15 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 0)], 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 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-15 finished in 155 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)||X(X(X((p1||F(G(p2))))))))'
[2023-03-14 10:47:25] [INFO ] Flatten gal took : 17 ms
[2023-03-14 10:47:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-14 10:47:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 207 transitions and 552 arcs took 3 ms.
Total runtime 16978 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1198/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DiscoveryGPU-PT-09b-LTLFireability-14

BK_STOP 1678790846462

--------------------
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
mcc2023
ltl formula name DiscoveryGPU-PT-09b-LTLFireability-14
ltl formula formula --ltl=/tmp/1198/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 177 places, 207 transitions and 552 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1198/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1198/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1198/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1198/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

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

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

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

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