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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 02:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 02:05 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 111K 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-15b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716421699996

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-15b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:48:21] [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:48:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:48:21] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-22 23:48:21] [INFO ] Transformed 436 places.
[2024-05-22 23:48:21] [INFO ] Transformed 464 transitions.
[2024-05-22 23:48:21] [INFO ] Found NUPN structural information;
[2024-05-22 23:48:21] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 406 transition count 464
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 104 place count 332 transition count 390
Iterating global reduction 1 with 74 rules applied. Total rules applied 178 place count 332 transition count 390
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 194 place count 316 transition count 374
Iterating global reduction 1 with 16 rules applied. Total rules applied 210 place count 316 transition count 374
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 223 place count 303 transition count 361
Iterating global reduction 1 with 13 rules applied. Total rules applied 236 place count 303 transition count 361
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 245 place count 294 transition count 352
Iterating global reduction 1 with 9 rules applied. Total rules applied 254 place count 294 transition count 352
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 262 place count 286 transition count 336
Iterating global reduction 1 with 8 rules applied. Total rules applied 270 place count 286 transition count 336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 277 place count 279 transition count 329
Iterating global reduction 1 with 7 rules applied. Total rules applied 284 place count 279 transition count 329
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 290 place count 273 transition count 323
Iterating global reduction 1 with 6 rules applied. Total rules applied 296 place count 273 transition count 323
Applied a total of 296 rules in 128 ms. Remains 273 /436 variables (removed 163) and now considering 323/464 (removed 141) transitions.
// Phase 1: matrix 323 rows 273 cols
[2024-05-22 23:48:22] [INFO ] Computed 2 invariants in 23 ms
[2024-05-22 23:48:22] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-22 23:48:22] [INFO ] Invariant cache hit.
[2024-05-22 23:48:22] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-22 23:48:22] [INFO ] Invariant cache hit.
[2024-05-22 23:48:22] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/436 places, 323/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 273/436 places, 323/464 transitions.
Support contains 34 out of 273 places after structural reductions.
[2024-05-22 23:48:23] [INFO ] Flatten gal took : 53 ms
[2024-05-22 23:48:23] [INFO ] Flatten gal took : 19 ms
[2024-05-22 23:48:23] [INFO ] Input system was already deterministic with 323 transitions.
Support contains 33 out of 273 places (down from 34) after GAL structural reductions.
Finished random walk after 7251 steps, including 15 resets, run visited all 31 properties in 201 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 550 edges and 273 vertex of which 271 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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((p1 U (p2||G(p1))))&&p0))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 313
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 258 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 258 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 253 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 249 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 249 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 246 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 246 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 245 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 245 transition count 290
Applied a total of 56 rules in 39 ms. Remains 245 /273 variables (removed 28) and now considering 290/323 (removed 33) transitions.
// Phase 1: matrix 290 rows 245 cols
[2024-05-22 23:48:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:48:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 23:48:24] [INFO ] Invariant cache hit.
[2024-05-22 23:48:24] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-22 23:48:24] [INFO ] Invariant cache hit.
[2024-05-22 23:48:24] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/273 places, 290/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 245/273 places, 290/323 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 306 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s70 0) (NEQ s64 1) (OR (EQ s165 0) (EQ s64 0))), p2:(NEQ s202 1), p1:(NEQ s64 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 291 ms.
Product exploration explored 100000 steps with 25000 reset in 159 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 499 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/245 stabilizing places and 47/290 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Finished Best-First random walk after 1392 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=464 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 195 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 245 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 290/290 transitions.
Applied a total of 0 rules in 9 ms. Remains 245 /245 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2024-05-22 23:48:26] [INFO ] Invariant cache hit.
[2024-05-22 23:48:26] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 23:48:26] [INFO ] Invariant cache hit.
[2024-05-22 23:48:26] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-22 23:48:26] [INFO ] Invariant cache hit.
[2024-05-22 23:48:26] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 245/245 places, 290/290 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 499 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/245 stabilizing places and 47/290 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Finished Best-First random walk after 390 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=195 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Product exploration explored 100000 steps with 25000 reset in 140 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 290/290 transitions.
Graph (complete) has 499 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 244 transition count 289
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 32 place count 244 transition count 289
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 78 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 243 transition count 288
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 243 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 242 transition count 287
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 242 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 241 transition count 285
Deduced a syphon composed of 77 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 240 transition count 284
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 240 transition count 284
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 119 place count 240 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 237 transition count 295
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 237 transition count 295
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 156 place count 237 transition count 357
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 170 place count 223 transition count 329
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 184 place count 223 transition count 329
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 226 place count 181 transition count 259
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 268 place count 181 transition count 259
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 308 place count 141 transition count 193
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 348 place count 141 transition count 193
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 361 place count 128 transition count 180
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 374 place count 128 transition count 180
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 400 place count 102 transition count 141
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 426 place count 102 transition count 141
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 477 place count 51 transition count 64
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 528 place count 51 transition count 64
Deduced a syphon composed of 32 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 533 place count 51 transition count 59
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 535 place count 49 transition count 57
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 537 place count 49 transition count 57
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 537 rules in 115 ms. Remains 49 /245 variables (removed 196) and now considering 57/290 (removed 233) transitions.
[2024-05-22 23:48:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:48:28] [INFO ] Flow matrix only has 55 transitions (discarded 2 similar events)
// Phase 1: matrix 55 rows 49 cols
[2024-05-22 23:48:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:48:28] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/245 places, 57/290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 49/245 places, 57/290 transitions.
Built C files in :
/tmp/ltsmin4184379321872680591
[2024-05-22 23:48:28] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4184379321872680591
Running compilation step : cd /tmp/ltsmin4184379321872680591;'/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 576 ms.
Running link step : cd /tmp/ltsmin4184379321872680591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4184379321872680591;'/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/stateBased1548395844014994279.hoa' '--buchi-type=spotba'
LTSmin run took 203 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-01 finished in 5343 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 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 245 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 245 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 241 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 240 transition count 284
Applied a total of 66 rules in 43 ms. Remains 240 /273 variables (removed 33) and now considering 284/323 (removed 39) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 23:48:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:48:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 23:48:29] [INFO ] Invariant cache hit.
[2024-05-22 23:48:29] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-22 23:48:29] [INFO ] Invariant cache hit.
[2024-05-22 23:48:29] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/273 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 240/273 places, 284/323 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-02 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 s213 1) (EQ s239 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 570 reset in 191 ms.
Stack based approach found an accepted trace after 295 steps with 2 reset with depth 119 and stack size 119 in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-02 finished in 679 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((p1||X(X(X(F(p0)))))))))'
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 251 transition count 297
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 251 transition count 297
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 247 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 247 transition count 292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 244 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 243 transition count 288
Applied a total of 60 rules in 36 ms. Remains 243 /273 variables (removed 30) and now considering 288/323 (removed 35) transitions.
// Phase 1: matrix 288 rows 243 cols
[2024-05-22 23:48:29] [INFO ] Computed 2 invariants in 9 ms
[2024-05-22 23:48:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 23:48:29] [INFO ] Invariant cache hit.
[2024-05-22 23:48:30] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-22 23:48:30] [INFO ] Invariant cache hit.
[2024-05-22 23:48:30] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/273 places, 288/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 243/273 places, 288/323 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=5, aps=[p1:(EQ s81 0), p0:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Product exploration explored 100000 steps with 33333 reset in 145 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 495 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-15b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-03 finished in 998 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)))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Graph (complete) has 550 edges and 273 vertex of which 271 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 270 transition count 282
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 232 transition count 282
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 77 place count 232 transition count 236
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 169 place count 186 transition count 236
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 179 transition count 228
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 179 transition count 228
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 189 place count 173 transition count 221
Iterating global reduction 2 with 6 rules applied. Total rules applied 195 place count 173 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 168 transition count 212
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 168 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 164 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 164 transition count 208
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 339 place count 101 transition count 145
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 352 place count 88 transition count 119
Iterating global reduction 2 with 13 rules applied. Total rules applied 365 place count 88 transition count 119
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 378 place count 75 transition count 106
Iterating global reduction 2 with 13 rules applied. Total rules applied 391 place count 75 transition count 106
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 404 place count 62 transition count 80
Iterating global reduction 2 with 13 rules applied. Total rules applied 417 place count 62 transition count 80
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 430 place count 49 transition count 67
Iterating global reduction 2 with 13 rules applied. Total rules applied 443 place count 49 transition count 67
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 456 place count 36 transition count 41
Iterating global reduction 2 with 13 rules applied. Total rules applied 469 place count 36 transition count 41
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 481 place count 24 transition count 29
Iterating global reduction 2 with 12 rules applied. Total rules applied 493 place count 24 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 494 place count 24 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 495 place count 24 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 497 place count 22 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 499 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 500 place count 20 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 500 place count 20 transition count 22
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 506 place count 17 transition count 22
Applied a total of 506 rules in 45 ms. Remains 17 /273 variables (removed 256) and now considering 22/323 (removed 301) transitions.
[2024-05-22 23:48:30] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 17 cols
[2024-05-22 23:48:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:48:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 23:48:30] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 23:48:30] [INFO ] Invariant cache hit.
[2024-05-22 23:48:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:48:30] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-22 23:48:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:48:30] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 23:48:30] [INFO ] Invariant cache hit.
[2024-05-22 23:48:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/273 places, 22/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 17/273 places, 22/323 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s16 0) (EQ s8 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 584 reset in 219 ms.
Product exploration explored 100000 steps with 585 reset in 161 ms.
Computed a total of 15 stabilizing places and 17 stable transitions
Computed a total of 15 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished Best-First random walk after 2630 steps, including 4 resets, run visited all 1 properties in 4 ms. (steps per millisecond=657 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-22 23:48:31] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 23:48:31] [INFO ] Invariant cache hit.
[2024-05-22 23:48:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 23:48:32] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 23:48:32] [INFO ] Invariant cache hit.
[2024-05-22 23:48:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:48:32] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-22 23:48:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:48:32] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 23:48:32] [INFO ] Invariant cache hit.
[2024-05-22 23:48:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 17/17 places, 22/22 transitions.
Computed a total of 15 stabilizing places and 17 stable transitions
Computed a total of 15 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4539 steps, including 26 resets, run visited all 1 properties in 14 ms. (steps per millisecond=324 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 577 reset in 97 ms.
Product exploration explored 100000 steps with 581 reset in 106 ms.
Built C files in :
/tmp/ltsmin2543591979902434690
[2024-05-22 23:48:32] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-22 23:48:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:48:32] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-22 23:48:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:48:32] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-22 23:48:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:48:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2543591979902434690
Running compilation step : cd /tmp/ltsmin2543591979902434690;'/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 102 ms.
Running link step : cd /tmp/ltsmin2543591979902434690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2543591979902434690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13930451654260023445.hoa' '--buchi-type=spotba'
LTSmin run took 6159 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-04 finished in 8272 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((p0||X(G(p1)))))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 313
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 258 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 258 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 253 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 249 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 249 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 246 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 246 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 245 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 245 transition count 290
Applied a total of 56 rules in 22 ms. Remains 245 /273 variables (removed 28) and now considering 290/323 (removed 33) transitions.
// Phase 1: matrix 290 rows 245 cols
[2024-05-22 23:48:39] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 23:48:39] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 23:48:39] [INFO ] Invariant cache hit.
[2024-05-22 23:48:39] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-22 23:48:39] [INFO ] Invariant cache hit.
[2024-05-22 23:48:39] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/273 places, 290/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 245/273 places, 290/323 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s39 0), p0:(EQ s81 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1996 steps with 3 reset in 8 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-06 finished in 606 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)&&(p1 U p2))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 313
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 258 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 258 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 253 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 249 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 249 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 246 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 246 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 245 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 245 transition count 290
Applied a total of 56 rules in 18 ms. Remains 245 /273 variables (removed 28) and now considering 290/323 (removed 33) transitions.
// Phase 1: matrix 290 rows 245 cols
[2024-05-22 23:48:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:48:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 23:48:39] [INFO ] Invariant cache hit.
[2024-05-22 23:48:40] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-22 23:48:40] [INFO ] Invariant cache hit.
[2024-05-22 23:48:40] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/273 places, 290/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 245/273 places, 290/323 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-07 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 p0 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s156 0), p2:(EQ s206 1), p1:(EQ s53 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-15b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-07 finished in 541 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||(p1&&G(p2))))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 245 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 245 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 241 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 240 transition count 284
Applied a total of 66 rules in 21 ms. Remains 240 /273 variables (removed 33) and now considering 284/323 (removed 39) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 23:48:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:48:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 23:48:40] [INFO ] Invariant cache hit.
[2024-05-22 23:48:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-22 23:48:40] [INFO ] Invariant cache hit.
[2024-05-22 23:48:40] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/273 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 240/273 places, 284/323 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s221 1), p1:(OR (EQ s115 0) (EQ s239 0)), p2:(OR (NEQ s101 1) (NEQ s239 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 247 reset in 195 ms.
Stack based approach found an accepted trace after 60062 steps with 147 reset with depth 197 and stack size 197 in 125 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-08 finished in 812 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&&X((G(p1)&&(p0 U (p2||G(p0)))))))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 313
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 313
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 257 transition count 305
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 257 transition count 305
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 251 transition count 296
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 251 transition count 296
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 246 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 246 transition count 290
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 242 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 242 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 241 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 241 transition count 285
Applied a total of 64 rules in 23 ms. Remains 241 /273 variables (removed 32) and now considering 285/323 (removed 38) transitions.
// Phase 1: matrix 285 rows 241 cols
[2024-05-22 23:48:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:48:41] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 23:48:41] [INFO ] Invariant cache hit.
[2024-05-22 23:48:41] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-22 23:48:41] [INFO ] Invariant cache hit.
[2024-05-22 23:48:41] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/273 places, 285/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 241/273 places, 285/323 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=p1, acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s221 1), p1:(EQ s71 0), p2:(NEQ s172 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 209 reset in 184 ms.
Product exploration explored 100000 steps with 207 reset in 197 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 490 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND p0 p1) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 154 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-22 23:48:42] [INFO ] Invariant cache hit.
[2024-05-22 23:48:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:48:42] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:48:42] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-22 23:48:42] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 285/285 transitions.
Graph (complete) has 490 edges and 241 vertex of which 240 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
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 240 transition count 240
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 74 place count 211 transition count 240
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 74 place count 211 transition count 177
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 200 place count 148 transition count 177
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 296 place count 100 transition count 129
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (complete) has 195 edges and 100 vertex of which 15 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.0 ms
Discarding 85 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 29 rules applied. Total rules applied 325 place count 15 transition count 101
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 411 place count 15 transition count 15
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 413 place count 15 transition count 15
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 415 place count 15 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 416 place count 14 transition count 12
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 8 rules applied. Total rules applied 424 place count 12 transition count 6
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 430 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 430 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 434 place count 4 transition count 4
Applied a total of 434 rules in 18 ms. Remains 4 /241 variables (removed 237) and now considering 4/285 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 4/241 places, 4/285 transitions.
Finished random walk after 7 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND p0 p1) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p1 p2)))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 15 factoid took 564 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 285/285 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-22 23:48:44] [INFO ] Invariant cache hit.
[2024-05-22 23:48:44] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-22 23:48:44] [INFO ] Invariant cache hit.
[2024-05-22 23:48:44] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-22 23:48:44] [INFO ] Invariant cache hit.
[2024-05-22 23:48:44] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 241/241 places, 285/285 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 490 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND p0 p1) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 173 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Finished Best-First random walk after 2426 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=808 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (OR (AND p0 p1) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p1 p2)))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 15 factoid took 566 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 207 reset in 187 ms.
Product exploration explored 100000 steps with 208 reset in 228 ms.
Built C files in :
/tmp/ltsmin5417881261406165430
[2024-05-22 23:48:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5417881261406165430
Running compilation step : cd /tmp/ltsmin5417881261406165430;'/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 405 ms.
Running link step : cd /tmp/ltsmin5417881261406165430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5417881261406165430;'/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/stateBased2996670102452940905.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-09 finished in 6364 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||G(F(p1))))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Graph (complete) has 550 edges and 273 vertex of which 271 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 270 transition count 281
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 231 transition count 281
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 79 place count 231 transition count 236
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 169 place count 186 transition count 236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 181 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 181 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 177 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 177 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 190 place count 174 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 193 place count 174 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 196 place count 171 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 199 place count 171 transition count 217
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 329 place count 106 transition count 152
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 341 place count 94 transition count 128
Iterating global reduction 2 with 12 rules applied. Total rules applied 353 place count 94 transition count 128
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 365 place count 82 transition count 116
Iterating global reduction 2 with 12 rules applied. Total rules applied 377 place count 82 transition count 116
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 389 place count 70 transition count 92
Iterating global reduction 2 with 12 rules applied. Total rules applied 401 place count 70 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 413 place count 58 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 425 place count 58 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 437 place count 46 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 449 place count 46 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 461 place count 34 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 473 place count 34 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 474 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 476 place count 32 transition count 42
Applied a total of 476 rules in 34 ms. Remains 32 /273 variables (removed 241) and now considering 42/323 (removed 281) transitions.
[2024-05-22 23:48:47] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 32 cols
[2024-05-22 23:48:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:48:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:48:47] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 23:48:47] [INFO ] Invariant cache hit.
[2024-05-22 23:48:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:48:47] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-22 23:48:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:48:47] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 23:48:47] [INFO ] Invariant cache hit.
[2024-05-22 23:48:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/273 places, 42/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 32/273 places, 42/323 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s29 1)), p1:(AND (EQ s12 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 398 steps with 3 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-10 finished in 244 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)&&X(F((G(p1)&&X(p2))))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 314
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 258 transition count 307
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 258 transition count 307
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 253 transition count 299
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 248 transition count 293
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 248 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 244 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 243 transition count 288
Applied a total of 60 rules in 36 ms. Remains 243 /273 variables (removed 30) and now considering 288/323 (removed 35) transitions.
// Phase 1: matrix 288 rows 243 cols
[2024-05-22 23:48:47] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 23:48:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 23:48:47] [INFO ] Invariant cache hit.
[2024-05-22 23:48:48] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-22 23:48:48] [INFO ] Invariant cache hit.
[2024-05-22 23:48:48] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/273 places, 288/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 243/273 places, 288/323 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s242 1)), p1:(OR (EQ s59 0) (EQ s242 0)), p2:(EQ s151 0)], 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]]
Product exploration explored 100000 steps with 509 reset in 192 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-11 finished in 846 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)||G(p1)) U p2))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Graph (complete) has 550 edges and 273 vertex of which 271 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 270 transition count 283
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 233 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 232 transition count 282
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 77 place count 232 transition count 236
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 169 place count 186 transition count 236
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 176 place count 179 transition count 228
Iterating global reduction 3 with 7 rules applied. Total rules applied 183 place count 179 transition count 228
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 189 place count 173 transition count 221
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 173 transition count 221
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 200 place count 168 transition count 212
Iterating global reduction 3 with 5 rules applied. Total rules applied 205 place count 168 transition count 212
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 209 place count 164 transition count 208
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 164 transition count 208
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 337 place count 102 transition count 146
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 349 place count 90 transition count 122
Iterating global reduction 3 with 12 rules applied. Total rules applied 361 place count 90 transition count 122
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 373 place count 78 transition count 110
Iterating global reduction 3 with 12 rules applied. Total rules applied 385 place count 78 transition count 110
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 397 place count 66 transition count 86
Iterating global reduction 3 with 12 rules applied. Total rules applied 409 place count 66 transition count 86
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 421 place count 54 transition count 74
Iterating global reduction 3 with 12 rules applied. Total rules applied 433 place count 54 transition count 74
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 444 place count 43 transition count 52
Iterating global reduction 3 with 11 rules applied. Total rules applied 455 place count 43 transition count 52
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 466 place count 32 transition count 41
Iterating global reduction 3 with 11 rules applied. Total rules applied 477 place count 32 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 478 place count 32 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 32 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 481 place count 30 transition count 38
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 483 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 484 place count 28 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 484 place count 28 transition count 33
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 492 place count 24 transition count 33
Applied a total of 492 rules in 37 ms. Remains 24 /273 variables (removed 249) and now considering 33/323 (removed 290) transitions.
[2024-05-22 23:48:48] [INFO ] Flow matrix only has 30 transitions (discarded 3 similar events)
// Phase 1: matrix 30 rows 24 cols
[2024-05-22 23:48:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:48:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 23:48:48] [INFO ] Flow matrix only has 30 transitions (discarded 3 similar events)
[2024-05-22 23:48:48] [INFO ] Invariant cache hit.
[2024-05-22 23:48:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:48:48] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-22 23:48:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:48:48] [INFO ] Flow matrix only has 30 transitions (discarded 3 similar events)
[2024-05-22 23:48:48] [INFO ] Invariant cache hit.
[2024-05-22 23:48:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/273 places, 33/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 24/273 places, 33/323 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s8 1) (EQ s12 1) (EQ s23 1)), p0:(EQ s17 1), p1:(AND (EQ s12 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-12 finished in 266 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(G(p0))||G((p1 U X(X(p0)))))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 314
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 259 transition count 307
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 259 transition count 307
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 253 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 253 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 248 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 248 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 244 transition count 288
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 244 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 243 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 243 transition count 287
Applied a total of 60 rules in 33 ms. Remains 243 /273 variables (removed 30) and now considering 287/323 (removed 36) transitions.
// Phase 1: matrix 287 rows 243 cols
[2024-05-22 23:48:48] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:48:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 23:48:48] [INFO ] Invariant cache hit.
[2024-05-22 23:48:49] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-22 23:48:49] [INFO ] Invariant cache hit.
[2024-05-22 23:48:49] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/273 places, 287/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 243/273 places, 287/323 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 0}]], initial=7, aps=[p1:(EQ s115 1), p0:(AND (EQ s39 1) (EQ s242 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 445 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-13 finished in 767 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(p1)&&p0)))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 245 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 245 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 241 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 240 transition count 284
Applied a total of 66 rules in 31 ms. Remains 240 /273 variables (removed 33) and now considering 284/323 (removed 39) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 23:48:49] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:48:49] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 23:48:49] [INFO ] Invariant cache hit.
[2024-05-22 23:48:49] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-22 23:48:49] [INFO ] Invariant cache hit.
[2024-05-22 23:48:49] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/273 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 240/273 places, 284/323 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1 1), p0:(AND (EQ s194 1) (EQ s236 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-15b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-14 finished in 535 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 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 245 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 245 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 241 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 240 transition count 284
Applied a total of 66 rules in 22 ms. Remains 240 /273 variables (removed 33) and now considering 284/323 (removed 39) transitions.
[2024-05-22 23:48:50] [INFO ] Invariant cache hit.
[2024-05-22 23:48:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 23:48:50] [INFO ] Invariant cache hit.
[2024-05-22 23:48:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-22 23:48:50] [INFO ] Invariant cache hit.
[2024-05-22 23:48:50] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/273 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 240/273 places, 284/323 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-15 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 s139 1) (EQ s236 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 591 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-15 finished in 448 ms.
All properties solved by simple procedures.
Total runtime 28992 ms.

BK_STOP 1716421731677

--------------------
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//
++ 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 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-15b"
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-15b, 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-171631151600323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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