Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 6.1K Apr 29 12:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 12:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 65K May 10 09:34 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 GPUForwardProgress-PT-12b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652722798078

Running Version 202205111006
[2022-05-16 17:40:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 17:40:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:40:00] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2022-05-16 17:40:00] [INFO ] Transformed 264 places.
[2022-05-16 17:40:00] [INFO ] Transformed 277 transitions.
[2022-05-16 17:40:00] [INFO ] Found NUPN structural information;
[2022-05-16 17:40:00] [INFO ] Parsed PT model containing 264 places and 277 transitions in 450 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 277/277 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 277
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 240 transition count 254
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 240 transition count 254
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 230 transition count 244
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 230 transition count 244
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 230 transition count 235
Applied a total of 76 rules in 138 ms. Remains 230 /264 variables (removed 34) and now considering 235/277 (removed 42) transitions.
// Phase 1: matrix 235 rows 230 cols
[2022-05-16 17:40:01] [INFO ] Computed 13 place invariants in 34 ms
[2022-05-16 17:40:01] [INFO ] Implicit Places using invariants in 562 ms returned []
// Phase 1: matrix 235 rows 230 cols
[2022-05-16 17:40:01] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-16 17:40:01] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
// Phase 1: matrix 235 rows 230 cols
[2022-05-16 17:40:02] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 17:40:02] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/264 places, 235/277 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/264 places, 235/277 transitions.
Support contains 34 out of 230 places after structural reductions.
[2022-05-16 17:40:02] [INFO ] Flatten gal took : 70 ms
[2022-05-16 17:40:02] [INFO ] Flatten gal took : 30 ms
[2022-05-16 17:40:02] [INFO ] Input system was already deterministic with 235 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 29) seen :23
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 235 rows 230 cols
[2022-05-16 17:40:03] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:03] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 10 ms returned sat
[2022-05-16 17:40:03] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 17:40:03] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 10 ms returned sat
[2022-05-16 17:40:04] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-05-16 17:40:04] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 178 ms.
[2022-05-16 17:40:04] [INFO ] After 808ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 5 properties in 12 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 352 edges and 230 vertex of which 214 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.12 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&F(G(!p0))))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Graph (trivial) has 189 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 346 edges and 225 vertex of which 209 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 208 transition count 119
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 102 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 101 transition count 115
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 219 place count 101 transition count 88
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 273 place count 74 transition count 88
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 285 place count 62 transition count 76
Iterating global reduction 3 with 12 rules applied. Total rules applied 297 place count 62 transition count 76
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 371 place count 25 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 372 place count 25 transition count 38
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 382 place count 15 transition count 19
Iterating global reduction 4 with 10 rules applied. Total rules applied 392 place count 15 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 396 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 12 transition count 17
Applied a total of 397 rules in 44 ms. Remains 12 /230 variables (removed 218) and now considering 17/235 (removed 218) transitions.
[2022-05-16 17:40:05] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 17:40:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-16 17:40:05] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 17:40:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:40:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:40:05] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-16 17:40:05] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-16 17:40:05] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 17:40:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:05] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/230 places, 17/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/230 places, 17/235 transitions.
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s6 1), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 2 reset in 3 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-01 finished in 737 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(p0)||G(p1))))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 222 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 222 transition count 227
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 218 transition count 223
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 218 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 218 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 217 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 217 transition count 219
Applied a total of 29 rules in 41 ms. Remains 217 /230 variables (removed 13) and now considering 219/235 (removed 16) transitions.
// Phase 1: matrix 219 rows 217 cols
[2022-05-16 17:40:05] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 17:40:05] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 219 rows 217 cols
[2022-05-16 17:40:05] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:06] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 217 cols
[2022-05-16 17:40:06] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 17:40:06] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 217/230 places, 219/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 217/230 places, 219/235 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(EQ s67 1), p1:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-02 finished in 959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(X(p1))||(p2 U p1))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Graph (trivial) has 193 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 346 edges and 225 vertex of which 209 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 208 transition count 117
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 112 rules applied. Total rules applied 222 place count 100 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 99 transition count 113
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 223 place count 99 transition count 87
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 275 place count 73 transition count 87
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 287 place count 61 transition count 75
Iterating global reduction 3 with 12 rules applied. Total rules applied 299 place count 61 transition count 75
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 373 place count 24 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 374 place count 24 transition count 37
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 384 place count 14 transition count 18
Iterating global reduction 4 with 10 rules applied. Total rules applied 394 place count 14 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 396 place count 13 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 12 transition count 16
Applied a total of 397 rules in 35 ms. Remains 12 /230 variables (removed 218) and now considering 16/235 (removed 219) transitions.
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 17:40:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:40:06] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 17:40:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:40:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:40:06] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 17:40:06] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 17:40:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:40:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/230 places, 16/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/230 places, 16/235 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s8 0), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-03 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 217 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 216 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 216 transition count 218
Applied a total of 31 rules in 32 ms. Remains 216 /230 variables (removed 14) and now considering 218/235 (removed 17) transitions.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:07] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:07] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:07] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:07] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:07] [INFO ] Computed 13 place invariants in 6 ms
[2022-05-16 17:40:07] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/230 places, 218/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 216/230 places, 218/235 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-05 finished in 861 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(p0))))))'
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Graph (trivial) has 194 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 346 edges and 225 vertex of which 209 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 208 transition count 115
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 98 transition count 112
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 225 place count 98 transition count 85
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 279 place count 71 transition count 85
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 291 place count 59 transition count 73
Iterating global reduction 2 with 12 rules applied. Total rules applied 303 place count 59 transition count 73
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 379 place count 21 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 380 place count 21 transition count 34
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 391 place count 10 transition count 13
Iterating global reduction 3 with 11 rules applied. Total rules applied 402 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 404 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 405 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 406 place count 8 transition count 11
Applied a total of 406 rules in 25 ms. Remains 8 /230 variables (removed 222) and now considering 11/235 (removed 224) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 17:40:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:07] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 17:40:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:40:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 17:40:07] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 17:40:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:07] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/230 places, 11/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/230 places, 11/235 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-06 finished in 158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 217 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 216 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 216 transition count 218
Applied a total of 31 rules in 20 ms. Remains 216 /230 variables (removed 14) and now considering 218/235 (removed 17) transitions.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:08] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:08] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:08] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 17:40:08] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:08] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:08] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/230 places, 218/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 216/230 places, 218/235 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s71 0), p1:(OR (EQ s168 0) (EQ s203 0) (EQ s214 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 876 ms.
Product exploration explored 100000 steps with 50000 reset in 498 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.6 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-07 finished in 2149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0)) U p2))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Graph (trivial) has 189 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 346 edges and 225 vertex of which 209 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 208 transition count 120
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 108 rules applied. Total rules applied 215 place count 103 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 216 place count 102 transition count 117
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 216 place count 102 transition count 90
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 270 place count 75 transition count 90
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 281 place count 64 transition count 79
Iterating global reduction 3 with 11 rules applied. Total rules applied 292 place count 64 transition count 79
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 364 place count 28 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 28 transition count 42
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 375 place count 18 transition count 23
Iterating global reduction 4 with 10 rules applied. Total rules applied 385 place count 18 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 389 place count 16 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 390 place count 16 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 391 place count 15 transition count 21
Applied a total of 391 rules in 29 ms. Remains 15 /230 variables (removed 215) and now considering 21/235 (removed 214) transitions.
[2022-05-16 17:40:10] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 17:40:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:40:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-16 17:40:10] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 17:40:10] [INFO ] Computed 0 place invariants in 12 ms
[2022-05-16 17:40:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:40:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 17:40:10] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-16 17:40:10] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 17:40:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/230 places, 21/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/230 places, 21/235 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s10 1), p0:(AND (EQ s3 1) (EQ s7 1)), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-08 finished in 292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 222 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 222 transition count 227
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 219 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 219 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 219 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 218 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 218 transition count 221
Applied a total of 26 rules in 17 ms. Remains 218 /230 variables (removed 12) and now considering 221/235 (removed 14) transitions.
// Phase 1: matrix 221 rows 218 cols
[2022-05-16 17:40:10] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:10] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 221 rows 218 cols
[2022-05-16 17:40:10] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:10] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 218 cols
[2022-05-16 17:40:10] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:11] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 218/230 places, 221/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 218/230 places, 221/235 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s143 1) (AND (EQ s76 1) (EQ s57 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-09 finished in 796 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 217 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 216 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 216 transition count 218
Applied a total of 31 rules in 22 ms. Remains 216 /230 variables (removed 14) and now considering 218/235 (removed 17) transitions.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:11] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:11] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:11] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 17:40:11] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:11] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:11] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/230 places, 218/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 216/230 places, 218/235 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s100 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-10 finished in 961 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1) U (X(G(p0))&&F(!p1)))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 217 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 216 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 216 transition count 218
Applied a total of 31 rules in 20 ms. Remains 216 /230 variables (removed 14) and now considering 218/235 (removed 17) transitions.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:12] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 17:40:12] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:12] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:12] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:12] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 17:40:12] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/230 places, 218/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 216/230 places, 218/235 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s72 1), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1702 reset in 158 ms.
Product exploration explored 100000 steps with 1686 reset in 400 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/216 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 772 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
Finished random walk after 370 steps, including 3 resets, run visited all 6 properties in 8 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 14 factoid took 945 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:16] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:16] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-16 17:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:40:16] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-05-16 17:40:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:40:16] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-16 17:40:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:40:16] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-16 17:40:16] [INFO ] Computed and/alt/rep : 212/278/212 causal constraints (skipped 5 transitions) in 15 ms.
[2022-05-16 17:40:17] [INFO ] Added : 157 causal constraints over 32 iterations in 623 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:17] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:17] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-16 17:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:40:17] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-16 17:40:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:40:17] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-16 17:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:40:17] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2022-05-16 17:40:17] [INFO ] Computed and/alt/rep : 212/278/212 causal constraints (skipped 5 transitions) in 22 ms.
[2022-05-16 17:40:18] [INFO ] Added : 188 causal constraints over 38 iterations in 716 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:18] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:18] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:18] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:18] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 216/216 places, 218/218 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/216 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 718 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
Finished random walk after 271 steps, including 2 resets, run visited all 6 properties in 4 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 14 factoid took 799 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:21] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:21] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 6 ms returned sat
[2022-05-16 17:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:40:21] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2022-05-16 17:40:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:40:21] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-16 17:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:40:21] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-16 17:40:21] [INFO ] Computed and/alt/rep : 212/278/212 causal constraints (skipped 5 transitions) in 18 ms.
[2022-05-16 17:40:22] [INFO ] Added : 157 causal constraints over 32 iterations in 605 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:40:22] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:22] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-16 17:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:40:22] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-05-16 17:40:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:40:22] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-16 17:40:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:40:22] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-16 17:40:22] [INFO ] Computed and/alt/rep : 212/278/212 causal constraints (skipped 5 transitions) in 18 ms.
[2022-05-16 17:40:23] [INFO ] Added : 188 causal constraints over 38 iterations in 750 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
Product exploration explored 100000 steps with 1695 reset in 143 ms.
Product exploration explored 100000 steps with 1688 reset in 236 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), p1, true]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Graph (trivial) has 176 edges and 216 vertex of which 6 / 216 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 329 edges and 211 vertex of which 195 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 195 transition count 209
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 99 place count 195 transition count 211
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 113 place count 195 transition count 211
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 184 place count 124 transition count 140
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 255 place count 124 transition count 140
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 266 place count 113 transition count 129
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 277 place count 113 transition count 129
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 316 place count 113 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 318 place count 113 transition count 128
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 347 place count 84 transition count 98
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 376 place count 84 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 84 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 378 place count 83 transition count 97
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 83 transition count 97
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 391 place count 83 transition count 133
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 414 place count 60 transition count 87
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 437 place count 60 transition count 87
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 469 place count 28 transition count 33
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 501 place count 28 transition count 33
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 501 rules in 65 ms. Remains 28 /216 variables (removed 188) and now considering 33/218 (removed 185) transitions.
[2022-05-16 17:40:24] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 33 rows 28 cols
[2022-05-16 17:40:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/216 places, 33/218 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/216 places, 33/218 transitions.
Stuttering criterion allowed to conclude after 105 steps with 11 reset in 2 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-11 finished in 12443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(F(p0))))))'
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Graph (trivial) has 195 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 346 edges and 225 vertex of which 209 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 208 transition count 114
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 227 place count 97 transition count 111
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 227 place count 97 transition count 84
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 281 place count 70 transition count 84
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 293 place count 58 transition count 72
Iterating global reduction 2 with 12 rules applied. Total rules applied 305 place count 58 transition count 72
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 381 place count 20 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 382 place count 20 transition count 33
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 394 place count 8 transition count 10
Iterating global reduction 3 with 12 rules applied. Total rules applied 406 place count 8 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 408 place count 7 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 409 place count 6 transition count 8
Applied a total of 409 rules in 17 ms. Remains 6 /230 variables (removed 224) and now considering 8/235 (removed 227) transitions.
// Phase 1: matrix 8 rows 6 cols
[2022-05-16 17:40:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:24] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-16 17:40:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:40:24] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-16 17:40:24] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-16 17:40:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/230 places, 8/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/230 places, 8/235 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-12 finished in 204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)&&G(p2)&&X((X(p3) U p4))))))'
Support contains 7 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 223 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 223 transition count 228
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 221 transition count 226
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 221 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 221 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 220 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 220 transition count 224
Applied a total of 21 rules in 23 ms. Remains 220 /230 variables (removed 10) and now considering 224/235 (removed 11) transitions.
// Phase 1: matrix 224 rows 220 cols
[2022-05-16 17:40:24] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:25] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 224 rows 220 cols
[2022-05-16 17:40:25] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:40:25] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 220 cols
[2022-05-16 17:40:25] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:40:25] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/230 places, 224/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 220/230 places, 224/235 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p4) (NOT p2)), (NOT p1), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p4) p2) (AND p0 (NOT p4) p2)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p4) p2) (AND p0 (NOT p4) p2) (AND (NOT p4) p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s22 1) (EQ s207 1) (EQ s218 1)), p2:(AND (EQ s159 1) (EQ s207 1) (EQ s218 1)), p0:(EQ s23 1), p4:(NEQ s74 1), p3:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-13 finished in 868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 235/235 transitions.
Graph (trivial) has 193 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 346 edges and 225 vertex of which 209 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 208 transition count 116
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 113 rules applied. Total rules applied 224 place count 99 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 225 place count 98 transition count 112
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 225 place count 98 transition count 85
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 279 place count 71 transition count 85
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 291 place count 59 transition count 73
Iterating global reduction 3 with 12 rules applied. Total rules applied 303 place count 59 transition count 73
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 379 place count 21 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 380 place count 21 transition count 34
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 391 place count 10 transition count 13
Iterating global reduction 4 with 11 rules applied. Total rules applied 402 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 404 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 405 place count 8 transition count 11
Applied a total of 405 rules in 22 ms. Remains 8 /230 variables (removed 222) and now considering 11/235 (removed 224) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 17:40:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:40:25] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 17:40:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:40:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:40:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-16 17:40:25] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 17:40:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:40:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/230 places, 11/235 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/230 places, 11/235 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-14 finished in 229 ms.
All properties solved by simple procedures.
Total runtime 25737 ms.

BK_STOP 1652722826072

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="GPUForwardProgress-PT-12b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-12b, 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 r096-smll-165260576100340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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