Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151400243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DiscoveryGPU-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151400243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716420974009

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:36:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:36:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:36:15] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-22 23:36:15] [INFO ] Transformed 212 places.
[2024-05-22 23:36:15] [INFO ] Transformed 224 transitions.
[2024-05-22 23:36:15] [INFO ] Found NUPN structural information;
[2024-05-22 23:36:15] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 224
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 46 place count 166 transition count 192
Iterating global reduction 1 with 32 rules applied. Total rules applied 78 place count 166 transition count 192
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 158 transition count 184
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 158 transition count 184
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 152 transition count 178
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 147 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 147 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 145 transition count 169
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 145 transition count 169
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 144 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 144 transition count 168
Applied a total of 122 rules in 57 ms. Remains 144 /212 variables (removed 68) and now considering 168/224 (removed 56) transitions.
// Phase 1: matrix 168 rows 144 cols
[2024-05-22 23:36:16] [INFO ] Computed 2 invariants in 13 ms
[2024-05-22 23:36:16] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 23:36:16] [INFO ] Invariant cache hit.
[2024-05-22 23:36:16] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-22 23:36:16] [INFO ] Invariant cache hit.
[2024-05-22 23:36:16] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/212 places, 168/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 144/212 places, 168/224 transitions.
Support contains 27 out of 144 places after structural reductions.
[2024-05-22 23:36:16] [INFO ] Flatten gal took : 34 ms
[2024-05-22 23:36:16] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:36:16] [INFO ] Input system was already deterministic with 168 transitions.
Support contains 26 out of 144 places (down from 27) after GAL structural reductions.
Finished random walk after 1878 steps, including 7 resets, run visited all 23 properties in 113 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F(p1)&&X(X(G(p2))))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 130 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 130 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 127 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 125 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 125 transition count 146
Applied a total of 38 rules in 14 ms. Remains 125 /144 variables (removed 19) and now considering 146/168 (removed 22) transitions.
// Phase 1: matrix 146 rows 125 cols
[2024-05-22 23:36:17] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:36:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 23:36:17] [INFO ] Invariant cache hit.
[2024-05-22 23:36:17] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-22 23:36:17] [INFO ] Invariant cache hit.
[2024-05-22 23:36:17] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/144 places, 146/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 125/144 places, 146/168 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s31 0), p1:(OR (EQ s101 1) (EQ s49 1)), p2:(EQ s49 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 726 steps with 6 reset in 11 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-00 finished in 888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 130 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 130 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 126 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 126 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 123 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 123 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 122 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 122 transition count 142
Applied a total of 44 rules in 34 ms. Remains 122 /144 variables (removed 22) and now considering 142/168 (removed 26) transitions.
// Phase 1: matrix 142 rows 122 cols
[2024-05-22 23:36:18] [INFO ] Computed 2 invariants in 22 ms
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/144 places, 142/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 122/144 places, 142/168 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s121 1), p1:(AND (EQ s47 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, 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-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-01 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 130 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 130 transition count 152
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 127 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 125 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 124 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 124 transition count 145
Applied a total of 40 rules in 28 ms. Remains 124 /144 variables (removed 20) and now considering 145/168 (removed 23) transitions.
// Phase 1: matrix 145 rows 124 cols
[2024-05-22 23:36:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:19] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/144 places, 145/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 124/144 places, 145/168 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s73 1) (AND (EQ s100 1) (EQ s120 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2209 steps with 9 reset in 10 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-02 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 121 transition count 141
Applied a total of 46 rules in 8 ms. Remains 121 /144 variables (removed 23) and now considering 141/168 (removed 27) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-22 23:36:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 23:36:19] [INFO ] Invariant cache hit.
[2024-05-22 23:36:19] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-22 23:36:19] [INFO ] Invariant cache hit.
[2024-05-22 23:36:19] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/144 places, 141/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 121/144 places, 141/168 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s21 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-03 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 121 transition count 141
Applied a total of 46 rules in 10 ms. Remains 121 /144 variables (removed 23) and now considering 141/168 (removed 27) transitions.
[2024-05-22 23:36:19] [INFO ] Invariant cache hit.
[2024-05-22 23:36:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 23:36:19] [INFO ] Invariant cache hit.
[2024-05-22 23:36:19] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-22 23:36:19] [INFO ] Invariant cache hit.
[2024-05-22 23:36:19] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/144 places, 141/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 121/144 places, 141/168 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s21 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][false, false, false]]
Stuttering criterion allowed to conclude after 485 steps with 2 reset in 3 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-04 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 141 transition count 140
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 116 transition count 140
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 51 place count 116 transition count 120
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 91 place count 96 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 92 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 92 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 99 place count 92 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 89 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 88 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 87 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 87 transition count 109
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 177 place count 53 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 182 place count 48 transition count 65
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 48 transition count 65
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 43 transition count 59
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 43 transition count 59
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 202 place count 38 transition count 50
Iterating global reduction 2 with 5 rules applied. Total rules applied 207 place count 38 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 212 place count 33 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 217 place count 33 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 222 place count 28 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 227 place count 28 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 232 place count 23 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 237 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 22 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 22 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 250 place count 15 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 254 place count 11 transition count 18
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 260 place count 8 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 6 transition count 11
Applied a total of 264 rules in 39 ms. Remains 6 /144 variables (removed 138) and now considering 11/168 (removed 157) transitions.
[2024-05-22 23:36:19] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-22 23:36:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:36:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 23:36:19] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 23:36:19] [INFO ] Invariant cache hit.
[2024-05-22 23:36:19] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 23:36:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:19] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 23:36:19] [INFO ] Invariant cache hit.
[2024-05-22 23:36:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/144 places, 11/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 6/144 places, 11/168 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-05 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 134 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 134 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 128 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 128 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 124 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 124 transition count 144
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 121 transition count 141
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 120 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 120 transition count 140
Applied a total of 48 rules in 18 ms. Remains 120 /144 variables (removed 24) and now considering 140/168 (removed 28) transitions.
// Phase 1: matrix 140 rows 120 cols
[2024-05-22 23:36:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:36:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 23:36:20] [INFO ] Invariant cache hit.
[2024-05-22 23:36:20] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-22 23:36:20] [INFO ] Invariant cache hit.
[2024-05-22 23:36:20] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/144 places, 140/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 120/144 places, 140/168 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s112 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17712 reset in 195 ms.
Product exploration explored 100000 steps with 17708 reset in 153 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/120 stabilizing places and 23/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 140/140 transitions.
Applied a total of 0 rules in 10 ms. Remains 120 /120 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-05-22 23:36:21] [INFO ] Invariant cache hit.
[2024-05-22 23:36:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 23:36:21] [INFO ] Invariant cache hit.
[2024-05-22 23:36:21] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-22 23:36:21] [INFO ] Invariant cache hit.
[2024-05-22 23:36:21] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 120/120 places, 140/140 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/120 stabilizing places and 23/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17695 reset in 100 ms.
Product exploration explored 100000 steps with 17650 reset in 142 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 140/140 transitions.
Graph (complete) has 241 edges and 120 vertex of which 119 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 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 119 transition count 139
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 15 place count 119 transition count 139
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 38 place count 119 transition count 139
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 55 places in 5 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 56 place count 119 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 116 transition count 143
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 116 transition count 143
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 116 transition count 173
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 110 transition count 161
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 110 transition count 161
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 107 place count 92 transition count 131
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 125 place count 92 transition count 131
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 143 place count 74 transition count 101
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 161 place count 74 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 167 place count 68 transition count 95
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 173 place count 68 transition count 95
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 185 place count 56 transition count 77
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 197 place count 56 transition count 77
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 221 place count 32 transition count 41
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 245 place count 32 transition count 41
Deduced a syphon composed of 19 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 249 place count 32 transition count 37
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 250 place count 31 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 251 place count 31 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 251 rules in 47 ms. Remains 31 /120 variables (removed 89) and now considering 36/140 (removed 104) transitions.
[2024-05-22 23:36:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:23] [INFO ] Flow matrix only has 35 transitions (discarded 1 similar events)
// Phase 1: matrix 35 rows 31 cols
[2024-05-22 23:36:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/120 places, 36/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 31/120 places, 36/140 transitions.
Built C files in :
/tmp/ltsmin10251536513340227574
[2024-05-22 23:36:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10251536513340227574
Running compilation step : cd /tmp/ltsmin10251536513340227574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 306 ms.
Running link step : cd /tmp/ltsmin10251536513340227574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10251536513340227574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1210846486199163899.hoa' '--buchi-type=spotba'
LTSmin run took 150 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-06 finished in 4181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 141 transition count 141
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 117 transition count 141
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 49 place count 117 transition count 120
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 91 place count 96 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 92 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 92 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 89 transition count 111
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 88 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 87 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 87 transition count 108
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 173 place count 55 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 51 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 51 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 47 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 47 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 193 place count 43 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 43 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 39 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 39 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 35 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 35 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 217 place count 31 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 221 place count 31 transition count 40
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 2 with 2 rules applied. Total rules applied 223 place count 30 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 224 place count 29 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 29 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 226 place count 28 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 227 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 228 place count 27 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 229 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 26 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 25 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 23 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 34 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 242 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 18 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 247 place count 16 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 14 transition count 21
Applied a total of 249 rules in 26 ms. Remains 14 /144 variables (removed 130) and now considering 21/168 (removed 147) transitions.
[2024-05-22 23:36:24] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 14 cols
[2024-05-22 23:36:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:36:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 23:36:24] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-22 23:36:24] [INFO ] Invariant cache hit.
[2024-05-22 23:36:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-22 23:36:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:24] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-22 23:36:24] [INFO ] Invariant cache hit.
[2024-05-22 23:36:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/144 places, 21/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 14/144 places, 21/168 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s13 1) (EQ s9 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-07 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 141 transition count 141
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 117 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 116 transition count 140
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 51 place count 116 transition count 120
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 91 place count 96 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 92 transition count 115
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 92 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 99 place count 92 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 89 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 88 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 87 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 87 transition count 109
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 175 place count 54 transition count 76
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 49 transition count 66
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 49 transition count 66
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 190 place count 44 transition count 60
Iterating global reduction 3 with 5 rules applied. Total rules applied 195 place count 44 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 40 transition count 53
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 40 transition count 53
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 36 transition count 48
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 36 transition count 48
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 215 place count 32 transition count 41
Iterating global reduction 3 with 4 rules applied. Total rules applied 219 place count 32 transition count 41
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 223 place count 28 transition count 36
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 228 place count 27 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 229 place count 27 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 233 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.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 240 place count 20 transition count 25
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 244 place count 16 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 252 place count 12 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 255 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 258 place count 9 transition count 15
Applied a total of 258 rules in 30 ms. Remains 9 /144 variables (removed 135) and now considering 15/168 (removed 153) transitions.
[2024-05-22 23:36:24] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2024-05-22 23:36:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:36:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 23:36:24] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2024-05-22 23:36:24] [INFO ] Invariant cache hit.
[2024-05-22 23:36:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 23:36:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:24] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2024-05-22 23:36:24] [INFO ] Invariant cache hit.
[2024-05-22 23:36:24] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/144 places, 15/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 9/144 places, 15/168 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-09 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(F(p1))))&&X(p0))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 121 transition count 141
Applied a total of 46 rules in 11 ms. Remains 121 /144 variables (removed 23) and now considering 141/168 (removed 27) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-22 23:36:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:24] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:36:24] [INFO ] Invariant cache hit.
[2024-05-22 23:36:24] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 23:36:24] [INFO ] Invariant cache hit.
[2024-05-22 23:36:24] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/144 places, 141/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 121/144 places, 141/168 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s31 1), p1:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-10 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(X(X(p0))))||(p1&&G(F(p2)))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 121 transition count 141
Applied a total of 46 rules in 7 ms. Remains 121 /144 variables (removed 23) and now considering 141/168 (removed 27) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-22 23:36:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 23:36:25] [INFO ] Invariant cache hit.
[2024-05-22 23:36:25] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-22 23:36:25] [INFO ] Invariant cache hit.
[2024-05-22 23:36:25] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/144 places, 141/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 121/144 places, 141/168 transitions.
Stuttering acceptance computed with spot in 515 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 9}, { cond=p1, acceptance={} source=6 dest: 10}], [{ cond=(NOT p2), acceptance={} source=7 dest: 9}, { cond=true, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(NOT p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(EQ s45 1), p2:(EQ s68 1), p0:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 257 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-11 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 141 transition count 140
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 116 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 115 transition count 139
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 53 place count 115 transition count 119
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 93 place count 95 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 90 transition count 112
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 90 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 103 place count 90 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 89 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 86 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 86 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 85 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 84 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 84 transition count 105
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 181 place count 51 transition count 72
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 187 place count 45 transition count 60
Iterating global reduction 3 with 6 rules applied. Total rules applied 193 place count 45 transition count 60
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 199 place count 39 transition count 53
Iterating global reduction 3 with 6 rules applied. Total rules applied 205 place count 39 transition count 53
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 210 place count 34 transition count 44
Iterating global reduction 3 with 5 rules applied. Total rules applied 215 place count 34 transition count 44
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 220 place count 29 transition count 38
Iterating global reduction 3 with 5 rules applied. Total rules applied 225 place count 29 transition count 38
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 230 place count 24 transition count 29
Iterating global reduction 3 with 5 rules applied. Total rules applied 235 place count 24 transition count 29
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 240 place count 19 transition count 23
Iterating global reduction 3 with 5 rules applied. Total rules applied 245 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 246 place count 18 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 250 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 16 edges and 14 vertex of which 11 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 255 place count 11 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 257 place count 9 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 7 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 5 transition count 8
Applied a total of 265 rules in 26 ms. Remains 5 /144 variables (removed 139) and now considering 8/168 (removed 160) transitions.
[2024-05-22 23:36:25] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2024-05-22 23:36:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:36:25] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 23:36:25] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 23:36:25] [INFO ] Invariant cache hit.
[2024-05-22 23:36:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 23:36:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:25] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 23:36:25] [INFO ] Invariant cache hit.
[2024-05-22 23:36:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/144 places, 8/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 5/144 places, 8/168 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-12 finished in 157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&F(p1))) U G((G(p2) U p3)))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 136 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 136 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 131 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 131 transition count 153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 128 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 128 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 125 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 124 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 124 transition count 145
Applied a total of 40 rules in 8 ms. Remains 124 /144 variables (removed 20) and now considering 145/168 (removed 23) transitions.
// Phase 1: matrix 145 rows 124 cols
[2024-05-22 23:36:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:26] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 23:36:26] [INFO ] Invariant cache hit.
[2024-05-22 23:36:26] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-22 23:36:26] [INFO ] Invariant cache hit.
[2024-05-22 23:36:26] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/144 places, 145/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 124/144 places, 145/168 transitions.
Stuttering acceptance computed with spot in 1038 ms :[(NOT p3), (NOT p3), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=1 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 5}, { cond=(OR p3 p2), acceptance={} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p3 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p3 p2), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 11}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 13}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=6 dest: 14}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=7 dest: 13}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=7 dest: 14}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=7 dest: 15}, { cond=(OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1))), acceptance={} source=7 dest: 16}], [{ cond=true, acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={0, 1} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=10 dest: 12}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=10 dest: 15}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={} source=10 dest: 16}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=10 dest: 17}, { cond=(AND p3 p2 p0 (NOT p1)), acceptance={} source=10 dest: 18}], [{ cond=(NOT p2), acceptance={} source=11 dest: 8}, { cond=p2, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p3) p2), acceptance={} source=13 dest: 11}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=13 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0, 1} source=14 dest: 14}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=15 dest: 8}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=15 dest: 13}, { cond=(OR (AND p3 p0) (AND p2 p0)), acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=16 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=16 dest: 14}, { cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))), acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=17 dest: 8}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=17 dest: 11}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=17 dest: 15}, { cond=(AND p3 p2 p0), acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=18 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=18 dest: 12}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=18 dest: 16}, { cond=(AND p3 p2 (NOT p0) (NOT p1)), acceptance={} source=18 dest: 18}]], initial=0, aps=[p3:(AND (EQ s64 1) (EQ s120 1)), p2:(EQ s108 1), p0:(EQ s27 1), p1:(NEQ s14 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-14 finished in 1349 ms.
All properties solved by simple procedures.
Total runtime 11769 ms.

BK_STOP 1716420988304

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DiscoveryGPU-PT-07b, 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 r153-tall-171631151400243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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