Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.9K Feb 25 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 75K 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-10b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678322535343

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 00:42:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 00:42:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:42:19] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-09 00:42:19] [INFO ] Transformed 296 places.
[2023-03-09 00:42:19] [INFO ] Transformed 314 transitions.
[2023-03-09 00:42:19] [INFO ] Found NUPN structural information;
[2023-03-09 00:42:19] [INFO ] Parsed PT model containing 296 places and 314 transitions and 819 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 276 transition count 314
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 65 place count 231 transition count 269
Iterating global reduction 1 with 45 rules applied. Total rules applied 110 place count 231 transition count 269
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 119 place count 222 transition count 260
Iterating global reduction 1 with 9 rules applied. Total rules applied 128 place count 222 transition count 260
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 215 transition count 253
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 215 transition count 253
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 147 place count 210 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 152 place count 210 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 156 place count 206 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 160 place count 206 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 164 place count 202 transition count 236
Iterating global reduction 1 with 4 rules applied. Total rules applied 168 place count 202 transition count 236
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 172 place count 198 transition count 232
Iterating global reduction 1 with 4 rules applied. Total rules applied 176 place count 198 transition count 232
Applied a total of 176 rules in 164 ms. Remains 198 /296 variables (removed 98) and now considering 232/314 (removed 82) transitions.
// Phase 1: matrix 232 rows 198 cols
[2023-03-09 00:42:19] [INFO ] Computed 2 place invariants in 35 ms
[2023-03-09 00:42:20] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-09 00:42:20] [INFO ] Invariant cache hit.
[2023-03-09 00:42:20] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-09 00:42:20] [INFO ] Invariant cache hit.
[2023-03-09 00:42:21] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/296 places, 232/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1486 ms. Remains : 198/296 places, 232/314 transitions.
Support contains 35 out of 198 places after structural reductions.
[2023-03-09 00:42:21] [INFO ] Flatten gal took : 104 ms
[2023-03-09 00:42:21] [INFO ] Flatten gal took : 38 ms
[2023-03-09 00:42:21] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 32 out of 198 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 00:42:22] [INFO ] Invariant cache hit.
[2023-03-09 00:42:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 00:42:22] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 00:42:22] [INFO ] After 164ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 00:42:22] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 9 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-10b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 392 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 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 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Graph (complete) has 392 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 194 transition count 197
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 163 transition count 197
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 63 place count 163 transition count 166
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 125 place count 132 transition count 166
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 127 transition count 161
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 127 transition count 161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 124 transition count 158
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 124 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 122 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 122 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 120 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 120 transition count 152
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 243 place count 73 transition count 105
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 251 place count 65 transition count 90
Iterating global reduction 2 with 8 rules applied. Total rules applied 259 place count 65 transition count 90
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 266 place count 58 transition count 81
Iterating global reduction 2 with 7 rules applied. Total rules applied 273 place count 58 transition count 81
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 280 place count 51 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 51 transition count 68
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 294 place count 44 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 44 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 308 place count 37 transition count 47
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 37 transition count 47
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 322 place count 30 transition count 39
Iterating global reduction 2 with 7 rules applied. Total rules applied 329 place count 30 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 331 place count 28 transition count 36
Iterating global reduction 2 with 2 rules applied. Total rules applied 333 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 334 place count 27 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 27 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 25 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 346 place count 20 transition count 24
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 352 place count 15 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 358 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 359 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 362 place count 9 transition count 16
Applied a total of 362 rules in 127 ms. Remains 9 /198 variables (removed 189) and now considering 16/232 (removed 216) transitions.
[2023-03-09 00:42:23] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2023-03-09 00:42:23] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 00:42:23] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 00:42:23] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-09 00:42:23] [INFO ] Invariant cache hit.
[2023-03-09 00:42:23] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-09 00:42:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:42:23] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-09 00:42:23] [INFO ] Invariant cache hit.
[2023-03-09 00:42:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/198 places, 16/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 9/198 places, 16/232 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-00 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' '!(X((G(p0) U p1)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 185 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 185 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 181 transition count 212
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 181 transition count 212
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 177 transition count 208
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 208
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 174 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 174 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 173 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 173 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 172 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 172 transition count 202
Applied a total of 52 rules in 38 ms. Remains 172 /198 variables (removed 26) and now considering 202/232 (removed 30) transitions.
// Phase 1: matrix 202 rows 172 cols
[2023-03-09 00:42:23] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 00:42:23] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-09 00:42:23] [INFO ] Invariant cache hit.
[2023-03-09 00:42:24] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-09 00:42:24] [INFO ] Invariant cache hit.
[2023-03-09 00:42:24] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/198 places, 202/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 172/198 places, 202/232 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s63 1), p0:(EQ s147 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-01 finished in 1070 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 p1) U G((p0&&F(p2))))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 190 transition count 224
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 190 transition count 224
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 185 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 185 transition count 218
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 180 transition count 211
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 180 transition count 211
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 175 transition count 206
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 175 transition count 206
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 171 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 171 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 169 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 167 transition count 196
Applied a total of 62 rules in 37 ms. Remains 167 /198 variables (removed 31) and now considering 196/232 (removed 36) transitions.
// Phase 1: matrix 196 rows 167 cols
[2023-03-09 00:42:24] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 00:42:24] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 00:42:24] [INFO ] Invariant cache hit.
[2023-03-09 00:42:25] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-09 00:42:25] [INFO ] Invariant cache hit.
[2023-03-09 00:42:25] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/198 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 649 ms. Remains : 167/198 places, 196/232 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s44 1), p1:(OR (EQ s24 1) (EQ s44 1)), p2:(EQ s163 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-03 finished in 896 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 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Graph (complete) has 392 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 194 transition count 197
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 163 transition count 197
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 63 place count 163 transition count 168
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 121 place count 134 transition count 168
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 130 transition count 164
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 130 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 128 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 128 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 126 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 126 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 124 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 124 transition count 156
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 239 place count 75 transition count 107
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 247 place count 67 transition count 92
Iterating global reduction 2 with 8 rules applied. Total rules applied 255 place count 67 transition count 92
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 263 place count 59 transition count 82
Iterating global reduction 2 with 8 rules applied. Total rules applied 271 place count 59 transition count 82
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 279 place count 51 transition count 67
Iterating global reduction 2 with 8 rules applied. Total rules applied 287 place count 51 transition count 67
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 295 place count 43 transition count 58
Iterating global reduction 2 with 8 rules applied. Total rules applied 303 place count 43 transition count 58
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 311 place count 35 transition count 43
Iterating global reduction 2 with 8 rules applied. Total rules applied 319 place count 35 transition count 43
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 326 place count 28 transition count 35
Iterating global reduction 2 with 7 rules applied. Total rules applied 333 place count 28 transition count 35
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 335 place count 26 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 337 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 338 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 339 place count 25 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 25 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 23 transition count 28
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 344 place count 22 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 345 place count 21 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 345 place count 21 transition count 25
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 349 place count 19 transition count 25
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 353 place count 17 transition count 23
Applied a total of 353 rules in 85 ms. Remains 17 /198 variables (removed 181) and now considering 23/232 (removed 209) transitions.
[2023-03-09 00:42:25] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
// Phase 1: matrix 20 rows 17 cols
[2023-03-09 00:42:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 00:42:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 00:42:25] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
[2023-03-09 00:42:25] [INFO ] Invariant cache hit.
[2023-03-09 00:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 00:42:25] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-09 00:42:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:42:25] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
[2023-03-09 00:42:25] [INFO ] Invariant cache hit.
[2023-03-09 00:42:25] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/198 places, 23/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 17/198 places, 23/232 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 1) (AND (EQ s7 1) (EQ s16 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 190 steps with 8 reset in 8 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-04 finished in 398 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&&(p1 U p2)))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Graph (complete) has 392 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 194 transition count 197
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 163 transition count 197
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 63 place count 163 transition count 169
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 119 place count 135 transition count 169
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 130 transition count 164
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 130 transition count 164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 127 transition count 161
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 127 transition count 161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 124 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 124 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 121 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 121 transition count 152
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 241 place count 74 transition count 105
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 250 place count 65 transition count 88
Iterating global reduction 2 with 9 rules applied. Total rules applied 259 place count 65 transition count 88
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 268 place count 56 transition count 77
Iterating global reduction 2 with 9 rules applied. Total rules applied 277 place count 56 transition count 77
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 286 place count 47 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 295 place count 47 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 304 place count 38 transition count 50
Iterating global reduction 2 with 9 rules applied. Total rules applied 313 place count 38 transition count 50
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 321 place count 30 transition count 35
Iterating global reduction 2 with 8 rules applied. Total rules applied 329 place count 30 transition count 35
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 337 place count 22 transition count 26
Iterating global reduction 2 with 8 rules applied. Total rules applied 345 place count 22 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 347 place count 20 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 349 place count 20 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 19 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 19 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 19 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 354 place count 17 transition count 19
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 356 place count 16 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 357 place count 15 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 357 place count 15 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 361 place count 13 transition count 16
Applied a total of 361 rules in 72 ms. Remains 13 /198 variables (removed 185) and now considering 16/232 (removed 216) transitions.
[2023-03-09 00:42:26] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 13 cols
[2023-03-09 00:42:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 00:42:26] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 00:42:26] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-09 00:42:26] [INFO ] Invariant cache hit.
[2023-03-09 00:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 00:42:26] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-09 00:42:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 00:42:26] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-09 00:42:26] [INFO ] Invariant cache hit.
[2023-03-09 00:42:26] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/198 places, 16/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 13/198 places, 16/232 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s12 1)), p0:(EQ s7 0), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-05 finished in 375 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 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Graph (complete) has 392 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 194 transition count 199
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 165 transition count 199
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 59 place count 165 transition count 169
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 119 place count 135 transition count 169
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 130 transition count 164
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 130 transition count 164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 127 transition count 161
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 127 transition count 161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 124 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 124 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 121 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 121 transition count 152
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 241 place count 74 transition count 105
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 249 place count 66 transition count 90
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 66 transition count 90
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 265 place count 58 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 273 place count 58 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 280 place count 51 transition count 66
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 51 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 294 place count 44 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 44 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 308 place count 37 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 37 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 322 place count 30 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 329 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 330 place count 29 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 331 place count 29 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 332 place count 28 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 333 place count 28 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 334 place count 28 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 28 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 337 place count 26 transition count 32
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 339 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 340 place count 24 transition count 31
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 340 place count 24 transition count 27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 348 place count 20 transition count 27
Applied a total of 348 rules in 65 ms. Remains 20 /198 variables (removed 178) and now considering 27/232 (removed 205) transitions.
[2023-03-09 00:42:26] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 20 cols
[2023-03-09 00:42:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 00:42:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 00:42:26] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2023-03-09 00:42:26] [INFO ] Invariant cache hit.
[2023-03-09 00:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 00:42:26] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-09 00:42:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:42:26] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2023-03-09 00:42:26] [INFO ] Invariant cache hit.
[2023-03-09 00:42:26] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/198 places, 27/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 20/198 places, 27/232 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s14 1) (AND (EQ s3 1) (EQ s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 254 steps with 4 reset in 4 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-06 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))||G(p2)||p0)))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 188 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 188 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 183 transition count 216
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 183 transition count 216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 178 transition count 209
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 178 transition count 209
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 173 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 173 transition count 204
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 169 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 169 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 168 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 168 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 167 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 167 transition count 196
Applied a total of 62 rules in 65 ms. Remains 167 /198 variables (removed 31) and now considering 196/232 (removed 36) transitions.
// Phase 1: matrix 196 rows 167 cols
[2023-03-09 00:42:26] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 00:42:26] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-09 00:42:26] [INFO ] Invariant cache hit.
[2023-03-09 00:42:27] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-09 00:42:27] [INFO ] Invariant cache hit.
[2023-03-09 00:42:27] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/198 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 737 ms. Remains : 167/198 places, 196/232 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s10 0), p0:(OR (EQ s62 0) (EQ s166 0)), p2:(EQ s128 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 50000 reset in 579 ms.
Product exploration explored 100000 steps with 50000 reset in 461 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 337 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Detected a total of 32/167 stabilizing places and 32/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-10b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-09 finished in 2304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 188 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 188 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 183 transition count 216
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 183 transition count 216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 178 transition count 209
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 178 transition count 209
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 173 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 173 transition count 204
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 169 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 169 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 168 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 168 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 167 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 167 transition count 196
Applied a total of 62 rules in 23 ms. Remains 167 /198 variables (removed 31) and now considering 196/232 (removed 36) transitions.
// Phase 1: matrix 196 rows 167 cols
[2023-03-09 00:42:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 00:42:29] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 00:42:29] [INFO ] Invariant cache hit.
[2023-03-09 00:42:29] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-09 00:42:29] [INFO ] Invariant cache hit.
[2023-03-09 00:42:29] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/198 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 167/198 places, 196/232 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s120 0) (EQ s163 0) (AND (EQ s146 1) (EQ s166 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 337 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-10b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-10 finished in 1389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p1 U p2)))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Graph (complete) has 392 edges and 198 vertex of which 196 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 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 195 transition count 200
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 166 transition count 200
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 59 place count 166 transition count 169
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 121 place count 135 transition count 169
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 131 transition count 165
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 131 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 129 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 129 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 127 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 127 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 125 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 125 transition count 157
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 235 place count 78 transition count 110
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 243 place count 70 transition count 95
Iterating global reduction 2 with 8 rules applied. Total rules applied 251 place count 70 transition count 95
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 259 place count 62 transition count 85
Iterating global reduction 2 with 8 rules applied. Total rules applied 267 place count 62 transition count 85
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 275 place count 54 transition count 70
Iterating global reduction 2 with 8 rules applied. Total rules applied 283 place count 54 transition count 70
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 291 place count 46 transition count 61
Iterating global reduction 2 with 8 rules applied. Total rules applied 299 place count 46 transition count 61
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 306 place count 39 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 313 place count 39 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 319 place count 33 transition count 42
Iterating global reduction 2 with 6 rules applied. Total rules applied 325 place count 33 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 326 place count 32 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 327 place count 32 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 328 place count 31 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 329 place count 31 transition count 39
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 331 place count 31 transition count 37
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 333 place count 31 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 335 place count 29 transition count 35
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 31 edges and 27 vertex of which 24 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 343 place count 24 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 348 place count 19 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 348 place count 19 transition count 26
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 350 place count 18 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 352 place count 17 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 358 place count 14 transition count 28
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 363 place count 14 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 365 place count 12 transition count 21
Applied a total of 365 rules in 42 ms. Remains 12 /198 variables (removed 186) and now considering 21/232 (removed 211) transitions.
[2023-03-09 00:42:30] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 12 cols
[2023-03-09 00:42:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 00:42:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 00:42:30] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2023-03-09 00:42:30] [INFO ] Invariant cache hit.
[2023-03-09 00:42:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-09 00:42:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:42:30] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2023-03-09 00:42:30] [INFO ] Invariant cache hit.
[2023-03-09 00:42:30] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/198 places, 21/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 12/198 places, 21/232 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s6 1) (EQ s11 1)), p1:(EQ s1 1), p0:(NEQ s11 1)], nbAcceptance=0, 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 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-11 finished in 220 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||X(X(((p1 U p2) U p3)))))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 188 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 188 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 183 transition count 216
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 183 transition count 216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 178 transition count 209
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 178 transition count 209
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 173 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 173 transition count 204
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 169 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 166 transition count 195
Applied a total of 64 rules in 16 ms. Remains 166 /198 variables (removed 32) and now considering 195/232 (removed 37) transitions.
// Phase 1: matrix 195 rows 166 cols
[2023-03-09 00:42:30] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-09 00:42:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-09 00:42:30] [INFO ] Invariant cache hit.
[2023-03-09 00:42:30] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-09 00:42:30] [INFO ] Invariant cache hit.
[2023-03-09 00:42:31] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/198 places, 195/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 166/198 places, 195/232 transitions.
Stuttering acceptance computed with spot in 570 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 5}]], initial=0, aps=[p0:(EQ s122 0), p3:(AND (EQ s26 1) (EQ s165 1)), p2:(EQ s146 1), p1:(AND (EQ s110 1) (EQ s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 312 reset in 356 ms.
Product exploration explored 100000 steps with 311 reset in 492 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 335 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 1461 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Finished random walk after 2198 steps, including 6 resets, run visited all 13 properties in 166 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (F (AND p1 (NOT p2))), (F (OR (AND p1 (NOT p0) (NOT p3)) (AND p2 (NOT p0) (NOT p3)))), (F (NOT p0)), (F p3), (F (AND (NOT p0) (NOT p3))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 1925 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 562 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 553 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 195/195 transitions.
Applied a total of 0 rules in 2 ms. Remains 166 /166 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2023-03-09 00:42:37] [INFO ] Invariant cache hit.
[2023-03-09 00:42:38] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 00:42:38] [INFO ] Invariant cache hit.
[2023-03-09 00:42:38] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-09 00:42:38] [INFO ] Invariant cache hit.
[2023-03-09 00:42:38] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 649 ms. Remains : 166/166 places, 195/195 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 335 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p2 (NOT p0) (NOT p3)))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 1548 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 555 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Finished random walk after 1765 steps, including 5 resets, run visited all 13 properties in 104 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p2 (NOT p0) (NOT p3)))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (F (AND p1 (NOT p2))), (F (OR (AND p1 (NOT p0) (NOT p3)) (AND p2 (NOT p0) (NOT p3)))), (F (NOT p0)), (F p3), (F (AND (NOT p0) (NOT p3))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 1913 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 544 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 635 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 535 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 310 reset in 266 ms.
Stack based approach found an accepted trace after 38566 steps with 120 reset with depth 77 and stack size 76 in 241 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-12 finished in 14382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U X(X(p1))))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 185 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 185 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 181 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 181 transition count 213
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 177 transition count 209
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 209
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 174 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 174 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 172 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 172 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 170 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 170 transition count 200
Applied a total of 56 rules in 23 ms. Remains 170 /198 variables (removed 28) and now considering 200/232 (removed 32) transitions.
// Phase 1: matrix 200 rows 170 cols
[2023-03-09 00:42:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 00:42:45] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-09 00:42:45] [INFO ] Invariant cache hit.
[2023-03-09 00:42:45] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-09 00:42:45] [INFO ] Invariant cache hit.
[2023-03-09 00:42:45] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/198 places, 200/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 170/198 places, 200/232 transitions.
Stuttering acceptance computed with spot in 472 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s118 1), p1:(EQ s37 1)], 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-13 finished in 1095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 185 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 185 transition count 219
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 181 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 181 transition count 213
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 177 transition count 209
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 177 transition count 209
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 173 transition count 203
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 173 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 171 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 171 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 169 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 169 transition count 199
Applied a total of 58 rules in 24 ms. Remains 169 /198 variables (removed 29) and now considering 199/232 (removed 33) transitions.
// Phase 1: matrix 199 rows 169 cols
[2023-03-09 00:42:46] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 00:42:46] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-09 00:42:46] [INFO ] Invariant cache hit.
[2023-03-09 00:42:46] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-09 00:42:46] [INFO ] Invariant cache hit.
[2023-03-09 00:42:46] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/198 places, 199/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 700 ms. Remains : 169/198 places, 199/232 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s13 0), p0:(OR (NEQ s100 1) (NEQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 309 reset in 151 ms.
Product exploration explored 100000 steps with 306 reset in 190 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 341 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1583 steps, including 4 resets, run visited all 2 properties in 12 ms. (steps per millisecond=131 )
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-09 00:42:48] [INFO ] Invariant cache hit.
[2023-03-09 00:42:48] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-09 00:42:48] [INFO ] Invariant cache hit.
[2023-03-09 00:42:48] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-09 00:42:48] [INFO ] Invariant cache hit.
[2023-03-09 00:42:48] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 169/169 places, 199/199 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 341 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 625 steps, including 1 resets, run visited all 2 properties in 10 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 308 reset in 258 ms.
Product exploration explored 100000 steps with 310 reset in 283 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 199/199 transitions.
Graph (complete) has 341 edges and 169 vertex of which 168 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 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 168 transition count 198
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 21 place count 168 transition count 198
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 52 place count 168 transition count 198
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 77 place count 168 transition count 208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 166 transition count 206
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 166 transition count 206
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 95 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 102 place count 166 transition count 248
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 158 transition count 232
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 158 transition count 232
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 142 place count 134 transition count 192
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 166 place count 134 transition count 192
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 190 place count 110 transition count 152
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 214 place count 110 transition count 152
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 221 place count 103 transition count 145
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 228 place count 103 transition count 145
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 242 place count 89 transition count 124
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 256 place count 89 transition count 124
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 284 place count 61 transition count 82
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 312 place count 61 transition count 82
Deduced a syphon composed of 35 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 317 place count 61 transition count 77
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 320 place count 58 transition count 74
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 323 place count 58 transition count 74
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 323 rules in 80 ms. Remains 58 /169 variables (removed 111) and now considering 74/199 (removed 125) transitions.
[2023-03-09 00:42:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 00:42:51] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
// Phase 1: matrix 70 rows 58 cols
[2023-03-09 00:42:51] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 00:42:51] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/169 places, 74/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 58/169 places, 74/199 transitions.
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 199/199 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 169 cols
[2023-03-09 00:42:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 00:42:51] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 00:42:51] [INFO ] Invariant cache hit.
[2023-03-09 00:42:51] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-09 00:42:51] [INFO ] Invariant cache hit.
[2023-03-09 00:42:52] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 169/169 places, 199/199 transitions.
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-15 finished in 6095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : DiscoveryGPU-PT-10b-LTLFireability-15
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 232/232 transitions.
Graph (complete) has 392 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 194 transition count 199
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 165 transition count 199
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 59 place count 165 transition count 169
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 119 place count 135 transition count 169
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 130 transition count 164
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 130 transition count 164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 127 transition count 161
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 127 transition count 161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 124 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 124 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 121 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 121 transition count 152
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 241 place count 74 transition count 105
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 249 place count 66 transition count 90
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 66 transition count 90
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 265 place count 58 transition count 81
Iterating global reduction 2 with 8 rules applied. Total rules applied 273 place count 58 transition count 81
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 281 place count 50 transition count 65
Iterating global reduction 2 with 8 rules applied. Total rules applied 289 place count 50 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 296 place count 43 transition count 58
Iterating global reduction 2 with 7 rules applied. Total rules applied 303 place count 43 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 310 place count 36 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 317 place count 36 transition count 44
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 324 place count 29 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 331 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 332 place count 28 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 333 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 334 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 41 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 342 place count 23 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 344 place count 21 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 346 place count 20 transition count 28
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 348 place count 19 transition count 28
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 351 place count 16 transition count 25
Applied a total of 351 rules in 56 ms. Remains 16 /198 variables (removed 182) and now considering 25/232 (removed 207) transitions.
[2023-03-09 00:42:52] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 16 cols
[2023-03-09 00:42:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 00:42:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 00:42:52] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2023-03-09 00:42:52] [INFO ] Invariant cache hit.
[2023-03-09 00:42:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-09 00:42:52] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2023-03-09 00:42:52] [INFO ] Invariant cache hit.
[2023-03-09 00:42:52] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/198 places, 25/232 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 177 ms. Remains : 16/198 places, 25/232 transitions.
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s1 0), p0:(OR (NEQ s12 1) (NEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1335 steps with 20 reset in 16 ms.
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-15 finished in 524 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-09 00:42:52] [INFO ] Flatten gal took : 28 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 33800 ms.
ITS solved all properties within timeout

BK_STOP 1678322574073

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-10b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DiscoveryGPU-PT-10b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414200356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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