Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875100253.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
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 r083-tall-162048875100253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 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-00
FORMULA_NAME DiscoveryGPU-PT-07a-01
FORMULA_NAME DiscoveryGPU-PT-07a-02
FORMULA_NAME DiscoveryGPU-PT-07a-03
FORMULA_NAME DiscoveryGPU-PT-07a-04
FORMULA_NAME DiscoveryGPU-PT-07a-05
FORMULA_NAME DiscoveryGPU-PT-07a-06
FORMULA_NAME DiscoveryGPU-PT-07a-07
FORMULA_NAME DiscoveryGPU-PT-07a-08
FORMULA_NAME DiscoveryGPU-PT-07a-09
FORMULA_NAME DiscoveryGPU-PT-07a-10
FORMULA_NAME DiscoveryGPU-PT-07a-11
FORMULA_NAME DiscoveryGPU-PT-07a-12
FORMULA_NAME DiscoveryGPU-PT-07a-13
FORMULA_NAME DiscoveryGPU-PT-07a-14
FORMULA_NAME DiscoveryGPU-PT-07a-15

=== Now, execution of the tool begins

BK_START 1620572109016

Running Version 0
[2021-05-09 14:55:10] [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]
[2021-05-09 14:55:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:55:10] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-09 14:55:10] [INFO ] Transformed 73 places.
[2021-05-09 14:55:10] [INFO ] Transformed 99 transitions.
[2021-05-09 14:55:10] [INFO ] Found NUPN structural information;
[2021-05-09 14:55:10] [INFO ] Parsed PT model containing 73 places and 99 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:55:10] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-07a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 73 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 69 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 69 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 67 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 67 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 65 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 65 transition count 89
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 65 transition count 84
Applied a total of 21 rules in 22 ms. Remains 65 /73 variables (removed 8) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 65 cols
[2021-05-09 14:55:10] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 14:55:10] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 84 rows 65 cols
[2021-05-09 14:55:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:10] [INFO ] State equation strengthened by 54 read => feed constraints.
[2021-05-09 14:55:10] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 65 cols
[2021-05-09 14:55:10] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 14:55:10] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/73 places, 84/99 transitions.
[2021-05-09 14:55:11] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 14:55:11] [INFO ] Flatten gal took : 27 ms
FORMULA DiscoveryGPU-PT-07a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:55:11] [INFO ] Flatten gal took : 10 ms
[2021-05-09 14:55:11] [INFO ] Input system was already deterministic with 84 transitions.
Finished random walk after 447 steps, including 6 resets, run visited all 27 properties in 8 ms. (steps per millisecond=55 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 71 edges and 62 vertex of which 28 / 62 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 48 transition count 66
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 51 place count 31 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 27 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 27 transition count 44
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 27 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 26 transition count 43
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 65 place count 22 transition count 35
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 22 transition count 35
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 22 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 71 place count 21 transition count 34
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 76 place count 16 transition count 24
Iterating global reduction 6 with 5 rules applied. Total rules applied 81 place count 16 transition count 24
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 86 place count 11 transition count 17
Iterating global reduction 6 with 5 rules applied. Total rules applied 91 place count 11 transition count 17
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 93 place count 9 transition count 14
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 96 place count 8 transition count 13
Iterating global reduction 6 with 1 rules applied. Total rules applied 97 place count 8 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 6 with 2 rules applied. Total rules applied 99 place count 7 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 100 place count 7 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 101 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 102 place count 5 transition count 9
Applied a total of 102 rules in 34 ms. Remains 5 /65 variables (removed 60) and now considering 9/84 (removed 75) transitions.
[2021-05-09 14:55:11] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 14:55:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:55:11] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 14:55:11] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 14:55:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:55:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:55:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-09 14:55:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:55:11] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 14:55:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:55:11] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 9/84 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ 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 5 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-00 finished in 257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 65 transition count 79
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 10 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 56 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 54 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 54 transition count 73
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 0 with 2 rules applied. Total rules applied 24 place count 53 transition count 72
Applied a total of 24 rules in 11 ms. Remains 53 /65 variables (removed 12) and now considering 72/84 (removed 12) transitions.
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:11] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 14:55:11] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:11] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2021-05-09 14:55:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:11] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/65 places, 72/84 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-07a-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p2:(AND (NEQ s44 0) (NEQ s52 0)), p0:(OR (NEQ s4 1) (NEQ s51 1)), p1:(AND (OR (NEQ s19 1) (NEQ s51 1)) (OR (NEQ s4 1) (NEQ s51 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-01 finished in 279 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 59 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 59 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 58 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 58 transition count 77
Applied a total of 14 rules in 5 ms. Remains 58 /65 variables (removed 7) and now considering 77/84 (removed 7) transitions.
// Phase 1: matrix 77 rows 58 cols
[2021-05-09 14:55:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:11] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 77 rows 58 cols
[2021-05-09 14:55:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:11] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-09 14:55:11] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 78 ms to find 1 implicit places.
// Phase 1: matrix 77 rows 57 cols
[2021-05-09 14:55:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:11] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 57/65 places, 77/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 57 cols
[2021-05-09 14:55:11] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-09 14:55:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/65 places, 77/84 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-07a-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s11 1), p1:(AND (EQ s31 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], 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-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-02 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 65 transition count 79
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 10 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 56 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 54 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 54 transition count 73
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 0 with 2 rules applied. Total rules applied 24 place count 53 transition count 72
Applied a total of 24 rules in 11 ms. Remains 53 /65 variables (removed 12) and now considering 72/84 (removed 12) transitions.
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:12] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 79 ms to find 1 implicit places.
[2021-05-09 14:55:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 52 cols
[2021-05-09 14:55:12] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 14:55:12] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 52/65 places, 72/84 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 38 transition count 58
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 32 transition count 46
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 32 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 28 transition count 38
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 28 transition count 38
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 24 transition count 34
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 24 transition count 34
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 20 transition count 26
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 20 transition count 26
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 16 transition count 22
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 16 transition count 22
Applied a total of 72 rules in 10 ms. Remains 16 /52 variables (removed 36) and now considering 22/72 (removed 50) transitions.
[2021-05-09 14:55:12] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 16 cols
[2021-05-09 14:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-09 14:55:12] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 16 cols
[2021-05-09 14:55:12] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:12] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/65 places, 22/84 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s11 0), p1:(OR (NEQ s7 1) (NEQ s15 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 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-03 finished in 279 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 65 transition count 79
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 10 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 56 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 54 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 54 transition count 73
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 0 with 2 rules applied. Total rules applied 24 place count 53 transition count 72
Applied a total of 24 rules in 9 ms. Remains 53 /65 variables (removed 12) and now considering 72/84 (removed 12) transitions.
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:12] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 79 ms to find 1 implicit places.
[2021-05-09 14:55:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 52 cols
[2021-05-09 14:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 52/65 places, 72/84 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 38 transition count 58
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 32 transition count 46
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 32 transition count 46
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 27 transition count 36
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 27 transition count 36
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 22 transition count 31
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 22 transition count 31
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 17 transition count 21
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 17 transition count 21
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 12 transition count 16
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 12 transition count 16
Applied a total of 80 rules in 7 ms. Remains 12 /52 variables (removed 40) and now considering 16/72 (removed 56) transitions.
[2021-05-09 14:55:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2021-05-09 14:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-09 14:55:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2021-05-09 14:55:12] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:12] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/65 places, 16/84 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-04 finished in 210 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 57 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 57 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 56 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 56 transition count 75
Applied a total of 18 rules in 5 ms. Remains 56 /65 variables (removed 9) and now considering 75/84 (removed 9) transitions.
// Phase 1: matrix 75 rows 56 cols
[2021-05-09 14:55:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 75 rows 56 cols
[2021-05-09 14:55:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:12] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:12] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
// Phase 1: matrix 75 rows 55 cols
[2021-05-09 14:55:12] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 55/65 places, 75/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 55 /55 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 55 cols
[2021-05-09 14:55:12] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/65 places, 75/84 transitions.
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s32 1) (NEQ s54 1)), p1:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Graph (complete) has 147 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 52 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
[2021-05-09 14:55:13] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:55:13] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:55:13] [INFO ] Time to serialize gal into /tmp/LTL9301402740789204648.gal : 2 ms
[2021-05-09 14:55:13] [INFO ] Time to serialize properties into /tmp/LTL6536715991191468373.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9301402740789204648.gal, -t, CGAL, -LTL, /tmp/LTL6536715991191468373.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9301402740789204648.gal -t CGAL -LTL /tmp/LTL6536715991191468373.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("(p13!=1)"))&&("((p40!=1)||(p71!=1))"))))
Formula 0 simplified : !F("((p40!=1)||(p71!=1))" & X"(p13!=1)")
Reverse transition relation is NOT exact ! Due to transitions t14, t17, t21, t23, t25, t26, t30, t32, t74, t75, t77, t78, t79, t81, t82, t83, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/59/16/75
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
42 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.443385,30568,1,0,113,75153,181,72,1693,92014,168
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-07a-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-07a-05 finished in 1787 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F((X((!p0 U p2))||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 57 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 57 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 55 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 55 transition count 74
Applied a total of 20 rules in 5 ms. Remains 55 /65 variables (removed 10) and now considering 74/84 (removed 10) transitions.
// Phase 1: matrix 74 rows 55 cols
[2021-05-09 14:55:14] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:14] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2021-05-09 14:55:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:14] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 97 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 54 cols
[2021-05-09 14:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 54/65 places, 74/84 transitions.
Applied a total of 0 rules in 11 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 54 cols
[2021-05-09 14:55:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/65 places, 74/84 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-07a-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s53 1)), p1:(OR (EQ s51 0) (EQ s53 0) (EQ s29 1)), p2:(AND (OR (NEQ s13 1) (NEQ s53 1)) (OR (EQ s51 0) (EQ s53 0) (EQ s29 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2587 reset in 216 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 0 ms.
FORMULA DiscoveryGPU-PT-07a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-06 finished in 517 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(F(p1)&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 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 8 place count 61 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 57 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 57 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 55 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 55 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 54 transition count 73
Applied a total of 22 rules in 11 ms. Remains 54 /65 variables (removed 11) and now considering 73/84 (removed 11) transitions.
// Phase 1: matrix 73 rows 54 cols
[2021-05-09 14:55:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:14] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 73 rows 54 cols
[2021-05-09 14:55:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
[2021-05-09 14:55:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 73 rows 53 cols
[2021-05-09 14:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 53/65 places, 73/84 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 41 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 37 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 37 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 34 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 34 transition count 47
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 31 transition count 44
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 31 transition count 44
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 28 transition count 38
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 28 transition count 38
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 25 transition count 35
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 25 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 25 transition count 35
Applied a total of 57 rules in 17 ms. Remains 25 /53 variables (removed 28) and now considering 35/73 (removed 38) transitions.
[2021-05-09 14:55:14] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 25 cols
[2021-05-09 14:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:15] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-09 14:55:15] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 25 cols
[2021-05-09 14:55:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:15] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-09 14:55:15] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 25/65 places, 35/84 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s2 1), p2:(NEQ s17 1), p0:(AND (NEQ s9 0) (NEQ s24 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-08 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 57 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 57 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 55 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 55 transition count 74
Applied a total of 20 rules in 2 ms. Remains 55 /65 variables (removed 10) and now considering 74/84 (removed 10) transitions.
// Phase 1: matrix 74 rows 55 cols
[2021-05-09 14:55:15] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:15] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2021-05-09 14:55:15] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:15] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:15] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 54 cols
[2021-05-09 14:55:15] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:15] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 54/65 places, 74/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 54 cols
[2021-05-09 14:55:15] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:15] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/65 places, 74/84 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Graph (complete) has 146 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 74/74 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 54 transition count 74
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 74
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 15 rules applied. Total rules applied 16 place count 54 transition count 88
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 48 transition count 76
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 48 transition count 76
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 37 transition count 54
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 37 transition count 54
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 32 transition count 49
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 32 transition count 49
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 27 transition count 39
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 27 transition count 39
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 80 place count 17 transition count 24
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 17 transition count 24
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 90 rules in 14 ms. Remains 17 /54 variables (removed 37) and now considering 24/74 (removed 50) transitions.
[2021-05-09 14:55:16] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:55:16] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 17 cols
[2021-05-09 14:55:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:16] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/54 places, 24/74 transitions.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Product exploration explored 100000 steps with 50000 reset in 228 ms.
[2021-05-09 14:55:16] [INFO ] Flatten gal took : 4 ms
[2021-05-09 14:55:16] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:55:16] [INFO ] Time to serialize gal into /tmp/LTL169291976864077121.gal : 1 ms
[2021-05-09 14:55:16] [INFO ] Time to serialize properties into /tmp/LTL11470981542029832633.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL169291976864077121.gal, -t, CGAL, -LTL, /tmp/LTL11470981542029832633.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL169291976864077121.gal -t CGAL -LTL /tmp/LTL11470981542029832633.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p26!=1)"))))
Formula 0 simplified : !XF"(p26!=1)"
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t26, t28, t30, t32, t74, t75, t77, t78, t79, t81, t82, t83, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/59/15/74
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
63 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.650134,36052,1,0,110,103326,174,72,1657,129576,161
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-07a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-07a-09 finished in 2305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 65 transition count 79
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 10 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 56 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 54 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 54 transition count 73
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 0 with 2 rules applied. Total rules applied 24 place count 53 transition count 72
Applied a total of 24 rules in 6 ms. Remains 53 /65 variables (removed 12) and now considering 72/84 (removed 12) transitions.
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:17] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 72 rows 53 cols
[2021-05-09 14:55:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:17] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 62 ms to find 1 implicit places.
[2021-05-09 14:55:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 52 cols
[2021-05-09 14:55:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 52/65 places, 72/84 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 39 transition count 59
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 33 transition count 47
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 33 transition count 47
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 27 transition count 35
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 27 transition count 35
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 21 transition count 29
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 21 transition count 29
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 16 transition count 19
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 16 transition count 19
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 11 transition count 14
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 11 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 11 transition count 14
Applied a total of 83 rules in 4 ms. Remains 11 /52 variables (removed 41) and now considering 14/72 (removed 58) transitions.
[2021-05-09 14:55:17] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2021-05-09 14:55:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:17] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-09 14:55:17] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2021-05-09 14:55:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-09 14:55:17] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/65 places, 14/84 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-10 automaton TGBA [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:(AND (EQ s8 1) (EQ s10 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 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-10 finished in 189 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||(X(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 59 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 59 transition count 78
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 57 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 57 transition count 76
Applied a total of 16 rules in 2 ms. Remains 57 /65 variables (removed 8) and now considering 76/84 (removed 8) transitions.
// Phase 1: matrix 76 rows 57 cols
[2021-05-09 14:55:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:17] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 76 rows 57 cols
[2021-05-09 14:55:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:17] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-09 14:55:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
// Phase 1: matrix 76 rows 56 cols
[2021-05-09 14:55:17] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 56/65 places, 76/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 56 /56 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 56 cols
[2021-05-09 14:55:17] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 56/65 places, 76/84 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s13 1), p1:(AND (NEQ s25 0) (NEQ s55 0)), p2:(AND (EQ s25 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-12 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(X(X(F(p0)))))&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 57 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 57 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 55 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 55 transition count 74
Applied a total of 20 rules in 2 ms. Remains 55 /65 variables (removed 10) and now considering 74/84 (removed 10) transitions.
// Phase 1: matrix 74 rows 55 cols
[2021-05-09 14:55:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:17] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2021-05-09 14:55:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:55:18] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
// Phase 1: matrix 74 rows 54 cols
[2021-05-09 14:55:18] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 54/65 places, 74/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 54 cols
[2021-05-09 14:55:18] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:18] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/65 places, 74/84 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-07a-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(OR (NEQ s26 1) (NEQ s53 1)), p0:(AND (EQ s12 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 124 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-13 finished in 304 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 70 edges and 62 vertex of which 28 / 62 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 48 transition count 68
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 47 place count 33 transition count 54
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 30 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 30 transition count 48
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 30 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 29 transition count 47
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 26 transition count 41
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 26 transition count 41
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 62 place count 26 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 25 transition count 40
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 67 place count 21 transition count 32
Iterating global reduction 6 with 4 rules applied. Total rules applied 71 place count 21 transition count 32
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 75 place count 17 transition count 26
Iterating global reduction 6 with 4 rules applied. Total rules applied 79 place count 17 transition count 26
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 81 place count 15 transition count 23
Iterating global reduction 6 with 2 rules applied. Total rules applied 83 place count 15 transition count 23
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 84 place count 14 transition count 22
Iterating global reduction 6 with 1 rules applied. Total rules applied 85 place count 14 transition count 22
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 6 with 4 rules applied. Total rules applied 89 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 12 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 91 place count 11 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 92 place count 10 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 9 transition count 16
Applied a total of 93 rules in 7 ms. Remains 9 /65 variables (removed 56) and now considering 16/84 (removed 68) transitions.
[2021-05-09 14:55:18] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 14:55:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:55:18] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 14:55:18] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 14:55:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:55:18] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-09 14:55:18] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:55:18] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 14:55:18] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:55:18] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/65 places, 16/84 transitions.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s5 1), p0:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-14 finished in 64 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 84/84 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 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 8 place count 61 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 58 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 58 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 56 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 56 transition count 75
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 0 with 2 rules applied. Total rules applied 20 place count 55 transition count 74
Applied a total of 20 rules in 4 ms. Remains 55 /65 variables (removed 10) and now considering 74/84 (removed 10) transitions.
// Phase 1: matrix 74 rows 55 cols
[2021-05-09 14:55:18] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:55:18] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 74 rows 55 cols
[2021-05-09 14:55:18] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:55:18] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-09 14:55:18] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
[2021-05-09 14:55:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 54 cols
[2021-05-09 14:55:18] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 54/65 places, 74/84 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 41 transition count 61
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 36 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 36 transition count 51
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 31 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 31 transition count 41
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 26 transition count 36
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 26 transition count 36
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 21 transition count 26
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 21 transition count 26
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 16 transition count 21
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 16 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 77 place count 16 transition count 21
Applied a total of 77 rules in 3 ms. Remains 16 /54 variables (removed 38) and now considering 21/74 (removed 53) transitions.
[2021-05-09 14:55:18] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2021-05-09 14:55:18] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:55:18] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-09 14:55:18] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2021-05-09 14:55:18] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:55:18] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 14:55:18] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/65 places, 21/84 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s2 1), p1:(AND (EQ s1 1) (EQ s15 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-15 finished in 230 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620572119510

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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 r083-tall-162048875100253"
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 ;