fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r153-tall-171631151500282
Last Updated
July 7, 2024

About the Execution of 2023-gold for DiscoveryGPU-PT-11b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
431.172 9457.00 20275.00 274.60 FFFTFTFFFTFFTTFF normal

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-171631151500282.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-11b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151500282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K 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 58K 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 Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 01:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 01:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 01:30 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 82K 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-11b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716421305879

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:41:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:41:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:41:47] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-22 23:41:47] [INFO ] Transformed 324 places.
[2024-05-22 23:41:47] [INFO ] Transformed 344 transitions.
[2024-05-22 23:41:47] [INFO ] Found NUPN structural information;
[2024-05-22 23:41:47] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 305 transition count 344
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 67 place count 257 transition count 296
Iterating global reduction 1 with 48 rules applied. Total rules applied 115 place count 257 transition count 296
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 125 place count 247 transition count 286
Iterating global reduction 1 with 10 rules applied. Total rules applied 135 place count 247 transition count 286
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 143 place count 239 transition count 278
Iterating global reduction 1 with 8 rules applied. Total rules applied 151 place count 239 transition count 278
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 158 place count 232 transition count 271
Iterating global reduction 1 with 7 rules applied. Total rules applied 165 place count 232 transition count 271
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 170 place count 227 transition count 261
Iterating global reduction 1 with 5 rules applied. Total rules applied 175 place count 227 transition count 261
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 180 place count 222 transition count 256
Iterating global reduction 1 with 5 rules applied. Total rules applied 185 place count 222 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 190 place count 217 transition count 251
Iterating global reduction 1 with 5 rules applied. Total rules applied 195 place count 217 transition count 251
Applied a total of 195 rules in 82 ms. Remains 217 /324 variables (removed 107) and now considering 251/344 (removed 93) transitions.
// Phase 1: matrix 251 rows 217 cols
[2024-05-22 23:41:47] [INFO ] Computed 2 invariants in 14 ms
[2024-05-22 23:41:48] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 23:41:48] [INFO ] Invariant cache hit.
[2024-05-22 23:41:48] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-22 23:41:48] [INFO ] Invariant cache hit.
[2024-05-22 23:41:48] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 217/324 places, 251/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 217/324 places, 251/344 transitions.
Support contains 31 out of 217 places after structural reductions.
[2024-05-22 23:41:48] [INFO ] Flatten gal took : 43 ms
[2024-05-22 23:41:48] [INFO ] Flatten gal took : 18 ms
[2024-05-22 23:41:48] [INFO ] Input system was already deterministic with 251 transitions.
Support contains 29 out of 217 places (down from 31) after GAL structural reductions.
Finished random walk after 3574 steps, including 10 resets, run visited all 20 properties in 183 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 423 edges and 217 vertex of which 209 are kept as prefixes of interest. Removing 8 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(F(p0)))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 251
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 202 transition count 238
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 202 transition count 238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 198 transition count 233
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 198 transition count 233
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 194 transition count 229
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 194 transition count 229
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 191 transition count 226
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 191 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 189 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 189 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 187 transition count 220
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 187 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 185 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 185 transition count 218
Applied a total of 61 rules in 78 ms. Remains 185 /217 variables (removed 32) and now considering 218/251 (removed 33) transitions.
// Phase 1: matrix 218 rows 185 cols
[2024-05-22 23:41:49] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 23:41:49] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 23:41:49] [INFO ] Invariant cache hit.
[2024-05-22 23:41:49] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-22 23:41:49] [INFO ] Invariant cache hit.
[2024-05-22 23:41:49] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/217 places, 218/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 185/217 places, 218/251 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 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s49 0) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 388 steps with 1 reset in 9 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-01 finished in 601 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 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 251
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 200 transition count 236
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 200 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 195 transition count 229
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 195 transition count 229
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 190 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 190 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 186 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 186 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 184 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 184 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 182 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 180 transition count 212
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 180 transition count 212
Applied a total of 71 rules in 25 ms. Remains 180 /217 variables (removed 37) and now considering 212/251 (removed 39) transitions.
// Phase 1: matrix 212 rows 180 cols
[2024-05-22 23:41:49] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 23:41:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 23:41:49] [INFO ] Invariant cache hit.
[2024-05-22 23:41:50] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-22 23:41:50] [INFO ] Invariant cache hit.
[2024-05-22 23:41:50] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/217 places, 212/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 180/217 places, 212/251 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-03 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:(NEQ s113 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]]
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 365 edges and 180 vertex of which 179 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-03 finished in 855 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 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Graph (complete) has 423 edges and 217 vertex of which 209 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 208 transition count 212
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 175 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 174 transition count 211
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 69 place count 174 transition count 179
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 133 place count 142 transition count 179
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 137 transition count 173
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 137 transition count 173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 134 transition count 169
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 134 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 132 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 132 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 131 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 131 transition count 165
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 263 place count 77 transition count 111
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 272 place count 68 transition count 94
Iterating global reduction 3 with 9 rules applied. Total rules applied 281 place count 68 transition count 94
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 290 place count 59 transition count 83
Iterating global reduction 3 with 9 rules applied. Total rules applied 299 place count 59 transition count 83
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 308 place count 50 transition count 66
Iterating global reduction 3 with 9 rules applied. Total rules applied 317 place count 50 transition count 66
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 326 place count 41 transition count 56
Iterating global reduction 3 with 9 rules applied. Total rules applied 335 place count 41 transition count 56
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 344 place count 32 transition count 39
Iterating global reduction 3 with 9 rules applied. Total rules applied 353 place count 32 transition count 39
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 362 place count 23 transition count 29
Iterating global reduction 3 with 9 rules applied. Total rules applied 371 place count 23 transition count 29
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 373 place count 21 transition count 26
Iterating global reduction 3 with 2 rules applied. Total rules applied 375 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 376 place count 20 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 377 place count 20 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 380 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 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 387 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 391 place count 9 transition count 15
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 395 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 396 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 398 place count 5 transition count 10
Applied a total of 398 rules in 68 ms. Remains 5 /217 variables (removed 212) and now considering 10/251 (removed 241) transitions.
[2024-05-22 23:41:50] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2024-05-22 23:41:50] [INFO ] Computed 0 invariants in 6 ms
[2024-05-22 23:41:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 23:41:50] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 23:41:50] [INFO ] Invariant cache hit.
[2024-05-22 23:41:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-22 23:41:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:41:50] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 23:41:50] [INFO ] Invariant cache hit.
[2024-05-22 23:41:50] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/217 places, 10/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 5/217 places, 10/251 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-04 finished in 199 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(G((F(p1)&&X(p2)&&p0)))))'
Support contains 6 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 251
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 202 transition count 238
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 202 transition count 238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 198 transition count 232
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 198 transition count 232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 195 transition count 229
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 195 transition count 229
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 192 transition count 226
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 192 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 191 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 191 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 190 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 190 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 189 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 189 transition count 222
Applied a total of 53 rules in 33 ms. Remains 189 /217 variables (removed 28) and now considering 222/251 (removed 29) transitions.
// Phase 1: matrix 222 rows 189 cols
[2024-05-22 23:41:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:41:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 23:41:50] [INFO ] Invariant cache hit.
[2024-05-22 23:41:51] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-22 23:41:51] [INFO ] Invariant cache hit.
[2024-05-22 23:41:51] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/217 places, 222/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 189/217 places, 222/251 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p0:(AND (EQ s52 0) (EQ s73 1)), p1:(AND (EQ s126 0) (EQ s84 1)), p2:(AND (EQ s66 0) (EQ s15 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-11b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-07 finished in 562 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(p0)||X((F(G(p1)) U G(p2)))))'
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 251
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 203 transition count 239
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 203 transition count 239
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 200 transition count 235
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 200 transition count 235
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 197 transition count 232
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 197 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 195 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 195 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 194 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 194 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 193 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 193 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 192 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 192 transition count 226
Applied a total of 47 rules in 28 ms. Remains 192 /217 variables (removed 25) and now considering 226/251 (removed 25) transitions.
// Phase 1: matrix 226 rows 192 cols
[2024-05-22 23:41:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:41:51] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 23:41:51] [INFO ] Invariant cache hit.
[2024-05-22 23:41:51] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-22 23:41:51] [INFO ] Invariant cache hit.
[2024-05-22 23:41:51] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/217 places, 226/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 192/217 places, 226/251 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s49 1)), p2:(OR (EQ s139 0) (EQ s153 1)), p1:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1416 steps with 3 reset in 11 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-08 finished in 576 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)&&(G((p1||X(p0)))||F(p2))))'
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 207 transition count 240
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 207 transition count 240
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 203 transition count 234
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 203 transition count 234
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 199 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 199 transition count 230
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 196 transition count 227
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 196 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 195 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 195 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 194 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 194 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 193 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 193 transition count 223
Applied a total of 48 rules in 22 ms. Remains 193 /217 variables (removed 24) and now considering 223/251 (removed 28) transitions.
// Phase 1: matrix 223 rows 193 cols
[2024-05-22 23:41:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:41:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 23:41:52] [INFO ] Invariant cache hit.
[2024-05-22 23:41:52] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-22 23:41:52] [INFO ] Invariant cache hit.
[2024-05-22 23:41:52] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/217 places, 223/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 193/217 places, 223/251 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s176 0) (EQ s81 1)), p0:(OR (EQ s49 0) (EQ s151 1)), p1:(EQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 382 edges and 193 vertex of which 186 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Computed a total of 36 stabilizing places and 36 stable transitions
Detected a total of 36/193 stabilizing places and 36/223 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-09 finished in 920 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 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Graph (complete) has 423 edges and 217 vertex of which 209 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 208 transition count 211
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 174 transition count 211
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 69 place count 174 transition count 179
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 133 place count 142 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 138 transition count 174
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 138 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 135 transition count 170
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 135 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 133 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 133 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 132 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 132 transition count 166
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 263 place count 77 transition count 111
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 273 place count 67 transition count 92
Iterating global reduction 2 with 10 rules applied. Total rules applied 283 place count 67 transition count 92
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 293 place count 57 transition count 80
Iterating global reduction 2 with 10 rules applied. Total rules applied 303 place count 57 transition count 80
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 313 place count 47 transition count 61
Iterating global reduction 2 with 10 rules applied. Total rules applied 323 place count 47 transition count 61
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 333 place count 37 transition count 50
Iterating global reduction 2 with 10 rules applied. Total rules applied 343 place count 37 transition count 50
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 353 place count 27 transition count 31
Iterating global reduction 2 with 10 rules applied. Total rules applied 363 place count 27 transition count 31
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 373 place count 17 transition count 20
Iterating global reduction 2 with 10 rules applied. Total rules applied 383 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 385 place count 15 transition count 17
Iterating global reduction 2 with 2 rules applied. Total rules applied 387 place count 15 transition count 17
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 388 place count 14 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 14 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 14 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 394 place count 11 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 10 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 395 place count 10 transition count 10
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 399 place count 8 transition count 10
Applied a total of 399 rules in 40 ms. Remains 8 /217 variables (removed 209) and now considering 10/251 (removed 241) transitions.
[2024-05-22 23:41:52] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 8 cols
[2024-05-22 23:41:52] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:41:52] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 23:41:52] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2024-05-22 23:41:52] [INFO ] Invariant cache hit.
[2024-05-22 23:41:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:41:53] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 23:41:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:41:53] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2024-05-22 23:41:53] [INFO ] Invariant cache hit.
[2024-05-22 23:41:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/217 places, 10/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 8/217 places, 10/251 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s7 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 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-10 finished in 162 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 U X(p1)))))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 251
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 200 transition count 236
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 200 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 195 transition count 229
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 195 transition count 229
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 190 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 190 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 186 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 186 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 184 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 184 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 182 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 180 transition count 212
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 180 transition count 212
Applied a total of 71 rules in 28 ms. Remains 180 /217 variables (removed 37) and now considering 212/251 (removed 39) transitions.
// Phase 1: matrix 212 rows 180 cols
[2024-05-22 23:41:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:41:53] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 23:41:53] [INFO ] Invariant cache hit.
[2024-05-22 23:41:53] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-22 23:41:53] [INFO ] Invariant cache hit.
[2024-05-22 23:41:53] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/217 places, 212/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 180/217 places, 212/251 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s121 0) (EQ s113 1)), p1:(EQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6487 steps with 47 reset in 29 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-11 finished in 505 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))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 251
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 201 transition count 237
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 201 transition count 237
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 196 transition count 230
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 196 transition count 230
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 191 transition count 225
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 191 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 187 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 187 transition count 221
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 185 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 185 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 183 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 183 transition count 215
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 181 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 181 transition count 213
Applied a total of 69 rules in 20 ms. Remains 181 /217 variables (removed 36) and now considering 213/251 (removed 38) transitions.
// Phase 1: matrix 213 rows 181 cols
[2024-05-22 23:41:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:41:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 23:41:53] [INFO ] Invariant cache hit.
[2024-05-22 23:41:53] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-22 23:41:53] [INFO ] Invariant cache hit.
[2024-05-22 23:41:53] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/217 places, 213/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 181/217 places, 213/251 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s31 0) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 366 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-12 finished in 685 ms.
All properties solved by simple procedures.
Total runtime 6896 ms.

BK_STOP 1716421315336

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-11b"
export BK_EXAMINATION="LTLCardinality"
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-11b, examination is LTLCardinality"
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-171631151500282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11b.tgz
mv DiscoveryGPU-PT-11b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;