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-162048875300348.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-13a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875300348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 18:01 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 46K 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-13a-00
FORMULA_NAME DiscoveryGPU-PT-13a-01
FORMULA_NAME DiscoveryGPU-PT-13a-02
FORMULA_NAME DiscoveryGPU-PT-13a-03
FORMULA_NAME DiscoveryGPU-PT-13a-04
FORMULA_NAME DiscoveryGPU-PT-13a-05
FORMULA_NAME DiscoveryGPU-PT-13a-06
FORMULA_NAME DiscoveryGPU-PT-13a-07
FORMULA_NAME DiscoveryGPU-PT-13a-08
FORMULA_NAME DiscoveryGPU-PT-13a-09
FORMULA_NAME DiscoveryGPU-PT-13a-10
FORMULA_NAME DiscoveryGPU-PT-13a-11
FORMULA_NAME DiscoveryGPU-PT-13a-12
FORMULA_NAME DiscoveryGPU-PT-13a-13
FORMULA_NAME DiscoveryGPU-PT-13a-14
FORMULA_NAME DiscoveryGPU-PT-13a-15

=== Now, execution of the tool begins

BK_START 1620579231968

Running Version 0
[2021-05-09 16:53:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 16:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:53:53] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-09 16:53:53] [INFO ] Transformed 133 places.
[2021-05-09 16:53:53] [INFO ] Transformed 183 transitions.
[2021-05-09 16:53:53] [INFO ] Found NUPN structural information;
[2021-05-09 16:53:53] [INFO ] Parsed PT model containing 133 places and 183 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 16:53:53] [INFO ] Initial state test concluded for 4 properties.
FORMULA DiscoveryGPU-PT-13a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 124 transition count 174
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 124 transition count 174
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 119 transition count 169
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 119 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 116 transition count 163
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 116 transition count 163
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 116 transition count 153
Applied a total of 44 rules in 31 ms. Remains 116 /133 variables (removed 17) and now considering 153/183 (removed 30) transitions.
// Phase 1: matrix 153 rows 116 cols
[2021-05-09 16:53:53] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 16:53:53] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 153 rows 116 cols
[2021-05-09 16:53:53] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:53:53] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 16:53:54] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 116 cols
[2021-05-09 16:53:54] [INFO ] Computed 2 place invariants in 11 ms
[2021-05-09 16:53:54] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 116/133 places, 153/183 transitions.
[2021-05-09 16:53:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 16:53:54] [INFO ] Flatten gal took : 41 ms
FORMULA DiscoveryGPU-PT-13a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:53:54] [INFO ] Flatten gal took : 18 ms
[2021-05-09 16:53:54] [INFO ] Input system was already deterministic with 153 transitions.
Finished random walk after 389 steps, including 2 resets, run visited all 16 properties in 8 ms. (steps per millisecond=48 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 116/116 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 132 edges and 113 vertex of which 50 / 113 are part of one of the 25 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 88 transition count 121
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 91 place count 57 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 56 transition count 95
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 101 place count 47 transition count 77
Iterating global reduction 3 with 9 rules applied. Total rules applied 110 place count 47 transition count 77
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 47 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 46 transition count 76
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 122 place count 36 transition count 56
Iterating global reduction 5 with 10 rules applied. Total rules applied 132 place count 36 transition count 56
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 133 place count 36 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 134 place count 35 transition count 55
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 144 place count 25 transition count 35
Iterating global reduction 7 with 10 rules applied. Total rules applied 154 place count 25 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 7 with 1 rules applied. Total rules applied 155 place count 25 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 156 place count 24 transition count 34
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 167 place count 13 transition count 20
Iterating global reduction 9 with 11 rules applied. Total rules applied 178 place count 13 transition count 20
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 181 place count 10 transition count 15
Iterating global reduction 9 with 3 rules applied. Total rules applied 184 place count 10 transition count 15
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 186 place count 8 transition count 12
Iterating global reduction 9 with 2 rules applied. Total rules applied 188 place count 8 transition count 12
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 189 place count 7 transition count 11
Iterating global reduction 9 with 1 rules applied. Total rules applied 190 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 192 place count 6 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 193 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 194 place count 5 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 195 place count 4 transition count 8
Applied a total of 195 rules in 25 ms. Remains 4 /116 variables (removed 112) and now considering 8/153 (removed 145) transitions.
[2021-05-09 16:53:54] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 16:53:54] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:53:54] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 16:53:54] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 16:53:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:53:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:53:54] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-09 16:53:54] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:53:54] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 16:53:54] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:53:54] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/116 places, 8/153 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-01 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:(EQ s1 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 0 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-01 finished in 275 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 116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 116/116 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 132 edges and 113 vertex of which 52 / 113 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 87 transition count 123
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 87 place count 58 transition count 97
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 94 place count 51 transition count 83
Iterating global reduction 2 with 7 rules applied. Total rules applied 101 place count 51 transition count 83
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 102 place count 51 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 50 transition count 82
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 111 place count 42 transition count 66
Iterating global reduction 4 with 8 rules applied. Total rules applied 119 place count 42 transition count 66
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 127 place count 34 transition count 50
Iterating global reduction 4 with 8 rules applied. Total rules applied 135 place count 34 transition count 50
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 143 place count 26 transition count 41
Iterating global reduction 4 with 8 rules applied. Total rules applied 151 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 25 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 25 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 167 place count 18 transition count 33
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 16 transition count 29
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 16 transition count 29
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 173 place count 14 transition count 23
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 14 transition count 23
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 177 place count 12 transition count 21
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 11 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 9 transition count 17
Applied a total of 183 rules in 16 ms. Remains 9 /116 variables (removed 107) and now considering 17/153 (removed 136) transitions.
[2021-05-09 16:53:54] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 16:53:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:53:54] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 16:53:54] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 16:53:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:53:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:53:54] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-09 16:53:54] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:53:54] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 16:53:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:53:54] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/116 places, 17/153 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-03 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:(OR (NEQ s6 0) (NEQ s2 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 44 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-03 finished in 109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&X(G(p1))) U (p2&&X(p3))))], workingDir=/home/mcc/execution]
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 116/116 places, 153/153 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 146
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 146
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 103 transition count 140
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 101 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 101 transition count 138
Applied a total of 30 rules in 12 ms. Remains 101 /116 variables (removed 15) and now considering 138/153 (removed 15) transitions.
// Phase 1: matrix 138 rows 101 cols
[2021-05-09 16:53:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:53:54] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 138 rows 101 cols
[2021-05-09 16:53:54] [INFO ] Computed 2 place invariants in 8 ms
[2021-05-09 16:53:54] [INFO ] State equation strengthened by 93 read => feed constraints.
[2021-05-09 16:53:55] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 101 cols
[2021-05-09 16:53:55] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:53:55] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/116 places, 138/153 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-13a-04 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) p0 (NOT p3) p1), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p1))), acceptance={0} source=4 dest: 1}, { cond=(OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p3) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s41 0) (EQ s57 1)), p0:(OR (EQ s80 0) (EQ s11 1)), p1:(OR (EQ s13 0) (EQ s56 1)), p3:(AND (NEQ s100 0) (NEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 431 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Graph (complete) has 315 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p2, p0, p1, (NOT p3)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Applying partial POR strategy [false, true, true, true, false]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (NOT p3)]
Support contains 8 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 101/101 places, 138/138 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 101 /101 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 16:53:57] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 138 rows 101 cols
[2021-05-09 16:53:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:53:57] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 138/138 transitions.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Product exploration explored 100000 steps with 50000 reset in 275 ms.
[2021-05-09 16:53:57] [INFO ] Flatten gal took : 8 ms
[2021-05-09 16:53:57] [INFO ] Flatten gal took : 8 ms
[2021-05-09 16:53:57] [INFO ] Time to serialize gal into /tmp/LTL15063617125332577676.gal : 3 ms
[2021-05-09 16:53:57] [INFO ] Time to serialize properties into /tmp/LTL5065070330907314116.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/LTL15063617125332577676.gal, -t, CGAL, -LTL, /tmp/LTL5065070330907314116.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/LTL15063617125332577676.gal -t CGAL -LTL /tmp/LTL5065070330907314116.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X(G("((p13==0)||(p73==1))")))&&("((p106==0)||(p11==1))"))U((X("((p132!=0)&&(p29!=1))"))&&("((p50==0)||(p74==1))"))))
Formula 0 simplified : !(("((p106==0)||(p11==1))" & XG"((p13==0)||(p73==1))") U ("((p50==0)||(p74==1))" & X"((p132!=0)&&(p29!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t14, t34, t38, t40, t42, t44, t46, t48, t49, t53, t55, t59, t61, t136, t137, t138, t139, t141, t142, t143, t144, t145, t146, t148, t149, t150, t151, t152, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/110/28/138
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1175 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,11.7784,250564,1,0,193,1.1309e+06,345,128,3204,1.58111e+06,310
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-13a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-13a-04 finished in 16149 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 116/116 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 125 edges and 113 vertex of which 48 / 113 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 89 transition count 126
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 54 rules applied. Total rules applied 83 place count 63 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 59 transition count 98
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 53 transition count 86
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 53 transition count 86
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 53 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 52 transition count 85
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 108 place count 45 transition count 71
Iterating global reduction 5 with 7 rules applied. Total rules applied 115 place count 45 transition count 71
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 45 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 117 place count 44 transition count 70
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 124 place count 37 transition count 56
Iterating global reduction 7 with 7 rules applied. Total rules applied 131 place count 37 transition count 56
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 138 place count 30 transition count 47
Iterating global reduction 7 with 7 rules applied. Total rules applied 145 place count 30 transition count 47
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 147 place count 28 transition count 44
Iterating global reduction 7 with 2 rules applied. Total rules applied 149 place count 28 transition count 44
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 150 place count 27 transition count 43
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 27 transition count 43
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 161 place count 22 transition count 38
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 162 place count 21 transition count 36
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 21 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 165 place count 20 transition count 36
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 166 place count 19 transition count 33
Iterating global reduction 7 with 1 rules applied. Total rules applied 167 place count 19 transition count 33
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 168 place count 18 transition count 32
Iterating global reduction 7 with 1 rules applied. Total rules applied 169 place count 18 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 18 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 171 place count 17 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 16 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 173 place count 15 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 174 place count 14 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 175 place count 13 transition count 26
Applied a total of 175 rules in 22 ms. Remains 13 /116 variables (removed 103) and now considering 26/153 (removed 127) transitions.
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 13 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:54:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 13 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:54:11] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2021-05-09 16:54:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 13 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/116 places, 26/153 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s1 0) (NEQ s10 1)), p0:(OR (EQ s7 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-05 finished in 231 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 116/116 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 131 edges and 113 vertex of which 52 / 113 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 87 transition count 124
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 85 place count 59 transition count 98
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 52 transition count 84
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 52 transition count 84
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 100 place count 52 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 51 transition count 83
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 109 place count 43 transition count 67
Iterating global reduction 4 with 8 rules applied. Total rules applied 117 place count 43 transition count 67
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 118 place count 43 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 119 place count 42 transition count 66
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 128 place count 33 transition count 48
Iterating global reduction 6 with 9 rules applied. Total rules applied 137 place count 33 transition count 48
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 146 place count 24 transition count 37
Iterating global reduction 6 with 9 rules applied. Total rules applied 155 place count 24 transition count 37
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 157 place count 22 transition count 34
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 22 transition count 34
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 21 transition count 33
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 21 transition count 33
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 171 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 15 transition count 26
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 15 transition count 26
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 14 transition count 23
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 13 transition count 22
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 13 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 178 place count 13 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 180 place count 11 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 10 transition count 18
Applied a total of 181 rules in 13 ms. Remains 10 /116 variables (removed 106) and now considering 18/153 (removed 135) transitions.
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:54:11] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-09 16:54:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/116 places, 18/153 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-06 finished in 115 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 2 out of 116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 116/116 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 131 edges and 113 vertex of which 52 / 113 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 87 transition count 122
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 89 place count 57 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 49 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 49 transition count 80
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 106 place count 49 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 48 transition count 79
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 116 place count 39 transition count 61
Iterating global reduction 4 with 9 rules applied. Total rules applied 125 place count 39 transition count 61
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 133 place count 31 transition count 45
Iterating global reduction 4 with 8 rules applied. Total rules applied 141 place count 31 transition count 45
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 149 place count 23 transition count 36
Iterating global reduction 4 with 8 rules applied. Total rules applied 157 place count 23 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 22 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 22 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 169 place count 17 transition count 30
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 171 place count 15 transition count 26
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 15 transition count 26
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 14 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 13 transition count 22
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 13 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 12 transition count 22
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 180 place count 11 transition count 19
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 11 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 182 place count 10 transition count 18
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 10 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 10 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 9 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 8 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 7 transition count 14
Applied a total of 187 rules in 10 ms. Remains 7 /116 variables (removed 109) and now considering 14/153 (removed 139) transitions.
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:54:11] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-09 16:54:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:54:11] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 16:54:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/116 places, 14/153 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-07 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:(OR (EQ s4 0) (EQ s2 1)), p1:(OR (NEQ s2 0) (NEQ s4 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 171 steps with 4 reset in 11 ms.
FORMULA DiscoveryGPU-PT-13a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-07 finished in 181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((X((p2 U p3))||p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 116/116 places, 153/153 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 146
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 106 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 106 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 104 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 104 transition count 141
Applied a total of 24 rules in 5 ms. Remains 104 /116 variables (removed 12) and now considering 141/153 (removed 12) transitions.
// Phase 1: matrix 141 rows 104 cols
[2021-05-09 16:54:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 141 rows 104 cols
[2021-05-09 16:54:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:54:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2021-05-09 16:54:11] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 180 ms to find 1 implicit places.
// Phase 1: matrix 141 rows 103 cols
[2021-05-09 16:54:11] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:54:11] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 103/116 places, 141/153 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 103 cols
[2021-05-09 16:54:11] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:54:11] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 2 iterations. Remains : 103/116 places, 141/153 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-13a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (EQ s67 0) (EQ s87 1) (EQ s32 0)), p1:(OR (EQ s79 0) (EQ s48 1)), p3:(AND (OR (EQ s87 0) (EQ s67 1)) (OR (EQ s79 0) (EQ s48 1))), p2:(OR (EQ s87 0) (EQ s67 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 185 ms.
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Graph (complete) has 275 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), p1, p3, p2]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 5 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 103/103 places, 141/141 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 141
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 27 place count 103 transition count 165
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 95 transition count 149
Deduced a syphon composed of 27 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 95 transition count 149
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 80 transition count 119
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 80 transition count 119
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 73 transition count 112
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 73 transition count 112
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 66 transition count 98
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 66 transition count 98
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 115 place count 52 transition count 77
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 129 place count 52 transition count 77
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 129 rules in 9 ms. Remains 52 /103 variables (removed 51) and now considering 77/141 (removed 64) transitions.
[2021-05-09 16:54:13] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 16:54:13] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
// Phase 1: matrix 69 rows 52 cols
[2021-05-09 16:54:13] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:54:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/103 places, 77/141 transitions.
Product exploration explored 100000 steps with 33333 reset in 151 ms.
Product exploration explored 100000 steps with 33333 reset in 162 ms.
[2021-05-09 16:54:13] [INFO ] Flatten gal took : 7 ms
[2021-05-09 16:54:13] [INFO ] Flatten gal took : 7 ms
[2021-05-09 16:54:13] [INFO ] Time to serialize gal into /tmp/LTL731432269788808930.gal : 3 ms
[2021-05-09 16:54:13] [INFO ] Time to serialize properties into /tmp/LTL12707032995974936382.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/LTL731432269788808930.gal, -t, CGAL, -LTL, /tmp/LTL12707032995974936382.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/LTL731432269788808930.gal -t CGAL -LTL /tmp/LTL12707032995974936382.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(("((p103==0)||(p61==1))")||(X(("((p113==0)||(p86==1))")U("(((p113==0)||(p86==1))&&((p103==0)||(p61==1)))")))))||("(((p86==0)&&(p113==1))&&(p42==0))"))))
Formula 0 simplified : !X("(((p86==0)&&(p113==1))&&(p42==0))" | X("((p103==0)||(p61==1))" | X("((p113==0)||(p86==1))" U "(((p113==0)||(p86==1))&&((p103==0)||(p61==1)))")))
Detected timeout of ITS tools.
[2021-05-09 16:54:28] [INFO ] Flatten gal took : 6 ms
[2021-05-09 16:54:28] [INFO ] Applying decomposition
[2021-05-09 16:54:28] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2676305481629448572.txt, -o, /tmp/graph2676305481629448572.bin, -w, /tmp/graph2676305481629448572.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2676305481629448572.bin, -l, -1, -v, -w, /tmp/graph2676305481629448572.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:54:28] [INFO ] Decomposing Gal with order
[2021-05-09 16:54:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:54:28] [INFO ] Removed a total of 73 redundant transitions.
[2021-05-09 16:54:28] [INFO ] Flatten gal took : 37 ms
[2021-05-09 16:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 6 ms.
[2021-05-09 16:54:28] [INFO ] Time to serialize gal into /tmp/LTL1647040072818239118.gal : 3 ms
[2021-05-09 16:54:28] [INFO ] Time to serialize properties into /tmp/LTL11982595226473300362.ltl : 1 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/LTL1647040072818239118.gal, -t, CGAL, -LTL, /tmp/LTL11982595226473300362.ltl, -c, -stutter-deadlock], 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/LTL1647040072818239118.gal -t CGAL -LTL /tmp/LTL11982595226473300362.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(("((i10.u22.p103==0)||(i6.u13.p61==1))")||(X(("((i10.u22.p113==0)||(i14.i0.u18.p86==1))")U("(((i10.u22.p113==0)||(i14.i0.u18.p86==1))&&((i10.u22.p103==0)||(i6.u13.p61==1)))")))))||("(((i14.i0.u18.p86==0)&&(i10.u22.p113==1))&&(i4.u8.p42==0))"))))
Formula 0 simplified : !X("(((i14.i0.u18.p86==0)&&(i10.u22.p113==1))&&(i4.u8.p42==0))" | X("((i10.u22.p103==0)||(i6.u13.p61==1))" | X("((i10.u22.p113==0)||(i14.i0.u18.p86==1))" U "(((i10.u22.p113==0)||(i14.i0.u18.p86==1))&&((i10.u22.p103==0)||(i6.u13.p61==1)))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6479372103678213333
[2021-05-09 16:54:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6479372103678213333
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6479372103678213333]
Compilation finished in 594 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6479372103678213333]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X((X(((LTLAPp1==true) U (LTLAPp2==true)))||(LTLAPp0==true)))||(LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6479372103678213333]
LTSmin run took 196 ms.
FORMULA DiscoveryGPU-PT-13a-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13a-12 finished in 33050 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 116/116 places, 153/153 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 108 transition count 145
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 108 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 103 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 101 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 101 transition count 138
Applied a total of 30 rules in 3 ms. Remains 101 /116 variables (removed 15) and now considering 138/153 (removed 15) transitions.
// Phase 1: matrix 138 rows 101 cols
[2021-05-09 16:54:44] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:54:44] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 138 rows 101 cols
[2021-05-09 16:54:44] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:54:44] [INFO ] State equation strengthened by 94 read => feed constraints.
[2021-05-09 16:54:44] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
// Phase 1: matrix 138 rows 100 cols
[2021-05-09 16:54:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:54:44] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 100/116 places, 138/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 100 cols
[2021-05-09 16:54:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:54:44] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 100/116 places, 138/153 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s41 0) (NEQ s25 1)), p1:(AND (NEQ s41 0) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-14 finished in 355 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620579285736

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-13a"
export BK_EXAMINATION="LTLCardinality"
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-13a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875300348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;