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.r078-tall-165260109700020.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 DiscoveryGPU-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109700020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.3K Apr 30 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 30 06:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 06:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 25K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652628850756

Running Version 202205111006
[2022-05-15 15:34:11] [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-15 15:34:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:34:12] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-05-15 15:34:12] [INFO ] Transformed 73 places.
[2022-05-15 15:34:12] [INFO ] Transformed 99 transitions.
[2022-05-15 15:34:12] [INFO ] Found NUPN structural information;
[2022-05-15 15:34:12] [INFO ] Parsed PT model containing 73 places and 99 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 70 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 70 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 68 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 68 transition count 94
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 17 place count 68 transition count 87
Applied a total of 17 rules in 24 ms. Remains 68 /73 variables (removed 5) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 68 cols
[2022-05-15 15:34:12] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 15:34:12] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 87 rows 68 cols
[2022-05-15 15:34:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:12] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-15 15:34:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 68 cols
[2022-05-15 15:34:12] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:12] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/73 places, 87/99 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/73 places, 87/99 transitions.
Support contains 29 out of 68 places after structural reductions.
[2022-05-15 15:34:12] [INFO ] Flatten gal took : 27 ms
[2022-05-15 15:34:12] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:34:12] [INFO ] Input system was already deterministic with 87 transitions.
Finished random walk after 415 steps, including 5 resets, run visited all 31 properties in 56 ms. (steps per millisecond=7 )
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 193 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(!(X(p0) U p1)))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 59 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 59 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 56 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 56 transition count 75
Applied a total of 24 rules in 8 ms. Remains 56 /68 variables (removed 12) and now considering 75/87 (removed 12) transitions.
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:13] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/68 places, 75/87 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/68 places, 75/87 transitions.
Stuttering acceptance computed with spot in 241 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s18 1), p0:(AND (EQ s4 1) (EQ s55 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 187 steps with 2 reset in 3 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-00 finished in 444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 55 transition count 74
Applied a total of 26 rules in 6 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:13] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/68 places, 74/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/68 places, 74/87 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s19 1) (EQ s53 1)) (AND (EQ s30 1) (EQ s53 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-01 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0)||X(p1)||p0))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 60 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 60 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 57 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 57 transition count 76
Applied a total of 22 rules in 11 ms. Remains 57 /68 variables (removed 11) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 57 cols
[2022-05-15 15:34:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 76 rows 57 cols
[2022-05-15 15:34:13] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:13] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/68 places, 76/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/68 places, 76/87 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s23 1) (EQ s55 1)), p1:(AND (EQ s32 1) (EQ s55 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-02 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U p0)&&p1)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Graph (complete) has 193 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 64 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 78
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 17 place count 53 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 53 transition count 72
Applied a total of 23 rules in 16 ms. Remains 53 /68 variables (removed 15) and now considering 72/87 (removed 15) transitions.
// Phase 1: matrix 72 rows 53 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 72 rows 53 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 15:34:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-15 15:34:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 53 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/68 places, 72/87 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/68 places, 72/87 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s44 1) (EQ s52 1)), p1:(EQ s37 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][true, true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-04 finished in 238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))&&((X(p0)||p1) U p2)) U p0))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 55 transition count 74
Applied a total of 26 rules in 9 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/68 places, 74/87 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/68 places, 74/87 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s54 1)), p2:(AND (EQ s44 1) (EQ s53 1)), p1:(EQ s25 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-05 finished in 315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&F(p1))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 59 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 59 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 56 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 56 transition count 75
Applied a total of 24 rules in 9 ms. Remains 56 /68 variables (removed 12) and now considering 75/87 (removed 12) transitions.
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/68 places, 75/87 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/68 places, 75/87 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s11 0) (EQ s55 0)), p0:(EQ s42 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 232 ms.
Product exploration explored 100000 steps with 33333 reset in 175 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 172 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-06 finished in 798 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(F(p1))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 55 transition count 74
Applied a total of 26 rules in 10 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:15] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:15] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:34:15] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 15:34:15] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/68 places, 74/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/68 places, 74/87 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), 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: 2}]], initial=1, aps=[p1:(AND (EQ s49 1) (EQ s53 1)), p0:(AND (EQ s45 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3147 reset in 142 ms.
Stack based approach found an accepted trace after 62 steps with 2 reset with depth 14 and stack size 14 in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-08 finished in 350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((X(p1)||X(F(p2))))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 55 transition count 74
Applied a total of 26 rules in 7 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:15] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:15] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 15:34:15] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:15] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/68 places, 74/87 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/68 places, 74/87 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(OR (EQ s16 0) (EQ s53 0)), p1:(AND (EQ s32 1) (EQ s54 1)), p0:(OR (EQ s41 0) (EQ s53 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 136 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 170 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p1) p0)
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-09 finished in 690 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(F(p0)))&&(G(X(p0))||p1))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 60 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 60 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 58 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 58 transition count 77
Applied a total of 20 rules in 8 ms. Remains 58 /68 variables (removed 10) and now considering 77/87 (removed 10) transitions.
// Phase 1: matrix 77 rows 58 cols
[2022-05-15 15:34:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:16] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 77 rows 58 cols
[2022-05-15 15:34:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:16] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 15:34:16] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/68 places, 77/87 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/68 places, 77/87 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s46 1) (EQ s25 0)), p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-10 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Graph (complete) has 193 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 70 edges and 61 vertex of which 50 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 56 edges and 50 vertex of which 28 / 50 are part of one of the 14 SCC in 3 ms
Free SCC test removed 14 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 36 transition count 64
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 33 place count 29 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 24 transition count 40
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 24 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 19 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 14 transition count 20
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 14 transition count 20
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 9 transition count 15
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 5 transition count 10
Applied a total of 80 rules in 15 ms. Remains 5 /68 variables (removed 63) and now considering 10/87 (removed 77) transitions.
[2022-05-15 15:34:16] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:34:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:16] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 15:34:16] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:34:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:16] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2022-05-15 15:34:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:16] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:34:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:16] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/68 places, 10/87 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/68 places, 10/87 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-11 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-11 finished in 116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(G(((F(p1)||p0)&&p2)))))&&X(p3)))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 60 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 60 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 78
Applied a total of 18 rules in 5 ms. Remains 59 /68 variables (removed 9) and now considering 78/87 (removed 9) transitions.
// Phase 1: matrix 78 rows 59 cols
[2022-05-15 15:34:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:16] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 78 rows 59 cols
[2022-05-15 15:34:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:16] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 15:34:16] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/68 places, 78/87 transitions.
Applied a total of 0 rules in 7 ms. Remains 58 /58 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/68 places, 78/87 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s42 1), p0:(OR (EQ s53 0) (EQ s57 0)), p2:(EQ s42 0), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-12 finished in 282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!G(p0) U (F(G(F((p1 U p2))))||p1))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 56 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 56 transition count 75
Applied a total of 24 rules in 5 ms. Remains 56 /68 variables (removed 12) and now considering 75/87 (removed 12) transitions.
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 56 cols
[2022-05-15 15:34:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:17] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/68 places, 75/87 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/68 places, 75/87 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s25 1) (EQ s55 1)), p2:(EQ s35 1), p0:(AND (EQ s32 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7387 reset in 123 ms.
Stack based approach found an accepted trace after 129 steps with 11 reset with depth 21 and stack size 21 in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-13 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(F(G(X(p0))))))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Graph (complete) has 193 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 64 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 60 transition count 79
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 55 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 55 transition count 74
Applied a total of 19 rules in 6 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2022-05-15 15:34:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:17] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/68 places, 74/87 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 40 transition count 60
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 35 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 35 transition count 50
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 30 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 30 transition count 40
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 25 transition count 35
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 25 transition count 35
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 20 transition count 25
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 20 transition count 25
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 15 transition count 20
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 15 transition count 20
Applied a total of 78 rules in 7 ms. Remains 15 /54 variables (removed 39) and now considering 20/74 (removed 54) transitions.
[2022-05-15 15:34:17] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2022-05-15 15:34:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-15 15:34:17] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2022-05-15 15:34:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/68 places, 20/87 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/68 places, 20/87 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s14 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 76 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-14 finished in 189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!(F(!(F(X(p1))||p2))&&p0) U p1))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Graph (complete) has 193 edges and 68 vertex of which 65 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 65 transition count 80
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 61 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 57 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 57 transition count 76
Applied a total of 17 rules in 5 ms. Remains 57 /68 variables (removed 11) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 57 cols
[2022-05-15 15:34:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 76 rows 57 cols
[2022-05-15 15:34:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:17] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/68 places, 76/87 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 42 transition count 62
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 38 transition count 54
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 38 transition count 54
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 34 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 34 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 30 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 30 transition count 42
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 26 transition count 34
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 26 transition count 34
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 22 transition count 30
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 22 transition count 30
Applied a total of 68 rules in 9 ms. Remains 22 /56 variables (removed 34) and now considering 30/76 (removed 46) transitions.
[2022-05-15 15:34:17] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 22 cols
[2022-05-15 15:34:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 15:34:17] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 22 cols
[2022-05-15 15:34:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:17] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-15 15:34:17] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/68 places, 30/87 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/68 places, 30/87 transitions.
Stuttering acceptance computed with spot in 99 ms :[p1, true, p1, (OR p2 p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s21 1)), p1:(EQ s14 1), p2:(AND (EQ s7 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-15 finished in 261 ms.
All properties solved by simple procedures.
Total runtime 6144 ms.

BK_STOP 1652628858078

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="DiscoveryGPU-PT-07a"
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 DiscoveryGPU-PT-07a, 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 r078-tall-165260109700020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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