fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048875300364
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for DiscoveryGPU-PT-14a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
698.815 22791.00 30432.00 250.00 TTTTFFFTFTFFFTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K 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 2.9K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.5K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 18:02 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 50K 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-14a-00
FORMULA_NAME DiscoveryGPU-PT-14a-01
FORMULA_NAME DiscoveryGPU-PT-14a-02
FORMULA_NAME DiscoveryGPU-PT-14a-03
FORMULA_NAME DiscoveryGPU-PT-14a-04
FORMULA_NAME DiscoveryGPU-PT-14a-05
FORMULA_NAME DiscoveryGPU-PT-14a-06
FORMULA_NAME DiscoveryGPU-PT-14a-07
FORMULA_NAME DiscoveryGPU-PT-14a-08
FORMULA_NAME DiscoveryGPU-PT-14a-09
FORMULA_NAME DiscoveryGPU-PT-14a-10
FORMULA_NAME DiscoveryGPU-PT-14a-11
FORMULA_NAME DiscoveryGPU-PT-14a-12
FORMULA_NAME DiscoveryGPU-PT-14a-13
FORMULA_NAME DiscoveryGPU-PT-14a-14
FORMULA_NAME DiscoveryGPU-PT-14a-15

=== Now, execution of the tool begins

BK_START 1620580966192

Running Version 0
[2021-05-09 17:22:47] [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 17:22:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:22:48] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-09 17:22:48] [INFO ] Transformed 143 places.
[2021-05-09 17:22:48] [INFO ] Transformed 197 transitions.
[2021-05-09 17:22:48] [INFO ] Found NUPN structural information;
[2021-05-09 17:22:48] [INFO ] Parsed PT model containing 143 places and 197 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 17:22:48] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-14a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 133 transition count 187
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 133 transition count 187
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 125 transition count 179
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 125 transition count 179
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 119 transition count 167
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 119 transition count 167
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 119 transition count 159
Applied a total of 56 rules in 36 ms. Remains 119 /143 variables (removed 24) and now considering 159/197 (removed 38) transitions.
// Phase 1: matrix 159 rows 119 cols
[2021-05-09 17:22:48] [INFO ] Computed 2 place invariants in 12 ms
[2021-05-09 17:22:48] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 159 rows 119 cols
[2021-05-09 17:22:48] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 17:22:48] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-09 17:22:48] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [118]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 328 ms to find 1 implicit places.
// Phase 1: matrix 159 rows 118 cols
[2021-05-09 17:22:48] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:22:48] [INFO ] Dead Transitions using invariants and state equation in 180 ms returned []
Starting structural reductions, iteration 1 : 118/143 places, 159/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 118 cols
[2021-05-09 17:22:48] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-09 17:22:48] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 2 iterations. Remains : 118/143 places, 159/197 transitions.
[2021-05-09 17:22:48] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 17:22:48] [INFO ] Flatten gal took : 36 ms
FORMULA DiscoveryGPU-PT-14a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 17:22:48] [INFO ] Flatten gal took : 15 ms
[2021-05-09 17:22:48] [INFO ] Input system was already deterministic with 159 transitions.
Finished random walk after 1446 steps, including 9 resets, run visited all 8 properties in 15 ms. (steps per millisecond=96 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 159/159 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 131 edges and 116 vertex of which 52 / 116 are part of one of the 26 SCC in 2 ms
Free SCC test removed 26 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 28 rules applied. Total rules applied 28 place count 90 transition count 132
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 80 place count 64 transition count 106
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 57 transition count 92
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 57 transition count 92
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 101 place count 50 transition count 78
Iterating global reduction 2 with 7 rules applied. Total rules applied 108 place count 50 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 114 place count 44 transition count 66
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 44 transition count 66
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 126 place count 38 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 132 place count 38 transition count 60
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 148 place count 30 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 152 place count 26 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 26 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 24 transition count 38
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 24 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 162 place count 22 transition count 36
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 22 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 2 with 2 rules applied. Total rules applied 166 place count 21 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 20 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 20 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 19 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 19 transition count 32
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 19 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 19 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 18 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 18 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 17 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 16 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 15 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 14 transition count 25
Applied a total of 179 rules in 33 ms. Remains 14 /118 variables (removed 104) and now considering 25/159 (removed 134) transitions.
[2021-05-09 17:22:49] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
// Phase 1: matrix 19 rows 14 cols
[2021-05-09 17:22:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:22:49] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 17:22:49] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
// Phase 1: matrix 19 rows 14 cols
[2021-05-09 17:22:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:22:49] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 17:22:49] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:22:49] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
// Phase 1: matrix 19 rows 14 cols
[2021-05-09 17:22:49] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 17:22:49] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/118 places, 25/159 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s10 1)), p1:(AND (NEQ s3 1) (EQ s5 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 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-04 finished in 334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 159/159 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 138 edges and 116 vertex of which 56 / 116 are part of one of the 28 SCC in 0 ms
Free SCC test removed 28 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 30 rules applied. Total rules applied 30 place count 88 transition count 130
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 86 place count 60 transition count 102
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 95 place count 51 transition count 84
Iterating global reduction 2 with 9 rules applied. Total rules applied 104 place count 51 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 105 place count 51 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 50 transition count 83
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 116 place count 40 transition count 63
Iterating global reduction 4 with 10 rules applied. Total rules applied 126 place count 40 transition count 63
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 136 place count 30 transition count 43
Iterating global reduction 4 with 10 rules applied. Total rules applied 146 place count 30 transition count 43
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 156 place count 20 transition count 32
Iterating global reduction 4 with 10 rules applied. Total rules applied 166 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 19 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 19 transition count 31
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 180 place count 13 transition count 25
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 11 transition count 21
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 11 transition count 21
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 9 transition count 15
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 190 place count 7 transition count 13
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 6 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 5 transition count 10
Applied a total of 195 rules in 20 ms. Remains 5 /118 variables (removed 113) and now considering 10/159 (removed 149) transitions.
[2021-05-09 17:22:49] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 17:22:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:22:49] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 17:22:49] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 17:22:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:22:49] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-09 17:22:49] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:22:49] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 17:22:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:22:49] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/118 places, 10/159 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-05 finished in 88 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X((p1 U p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 159/159 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 111 transition count 152
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 111 transition count 152
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 107 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 107 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 104 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 104 transition count 145
Applied a total of 28 rules in 11 ms. Remains 104 /118 variables (removed 14) and now considering 145/159 (removed 14) transitions.
// Phase 1: matrix 145 rows 104 cols
[2021-05-09 17:22:49] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:22:49] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 145 rows 104 cols
[2021-05-09 17:22:49] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-09 17:22:49] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 17:22:49] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 145 rows 104 cols
[2021-05-09 17:22:49] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:22:49] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/118 places, 145/159 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s0 0) (EQ s81 1)), p1:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 354 ms.
Product exploration explored 100000 steps with 33333 reset in 254 ms.
Graph (complete) has 287 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 191 ms.
Product exploration explored 100000 steps with 33333 reset in 304 ms.
[2021-05-09 17:22:51] [INFO ] Flatten gal took : 12 ms
[2021-05-09 17:22:51] [INFO ] Flatten gal took : 7 ms
[2021-05-09 17:22:51] [INFO ] Time to serialize gal into /tmp/LTL18141567759696561704.gal : 5 ms
[2021-05-09 17:22:51] [INFO ] Time to serialize properties into /tmp/LTL4620825668482913822.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/LTL18141567759696561704.gal, -t, CGAL, -LTL, /tmp/LTL4620825668482913822.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/LTL18141567759696561704.gal -t CGAL -LTL /tmp/LTL4620825668482913822.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(p4==0)")U("((p0==0)||(p113==1))")))&&("((p0==0)||(p113==1))")))))
Formula 0 simplified : !XF("((p0==0)||(p113==1))" & X("(p4==0)" U "((p0==0)||(p113==1))"))
Detected timeout of ITS tools.
[2021-05-09 17:23:06] [INFO ] Flatten gal took : 7 ms
[2021-05-09 17:23:06] [INFO ] Applying decomposition
[2021-05-09 17:23:06] [INFO ] Flatten gal took : 20 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/graph15916468171072781997.txt, -o, /tmp/graph15916468171072781997.bin, -w, /tmp/graph15916468171072781997.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/graph15916468171072781997.bin, -l, -1, -v, -w, /tmp/graph15916468171072781997.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 17:23:06] [INFO ] Decomposing Gal with order
[2021-05-09 17:23:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 17:23:06] [INFO ] Removed a total of 78 redundant transitions.
[2021-05-09 17:23:06] [INFO ] Flatten gal took : 34 ms
[2021-05-09 17:23:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 8 ms.
[2021-05-09 17:23:06] [INFO ] Time to serialize gal into /tmp/LTL7275337222998685248.gal : 4 ms
[2021-05-09 17:23:06] [INFO ] Time to serialize properties into /tmp/LTL11555996162310918759.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/LTL7275337222998685248.gal, -t, CGAL, -LTL, /tmp/LTL11555996162310918759.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/LTL7275337222998685248.gal -t CGAL -LTL /tmp/LTL11555996162310918759.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(i7.u0.p4==0)")U("((u1.p0==0)||(i12.u22.p113==1))")))&&("((u1.p0==0)||(i12.u22.p113==1))")))))
Formula 0 simplified : !XF("((u1.p0==0)||(i12.u22.p113==1))" & X("(i7.u0.p4==0)" U "((u1.p0==0)||(i12.u22.p113==1))"))
Reverse transition relation is NOT exact ! Due to transitions t34, t38, t42, t44, t46, t48, t50, t53, t55, t57, t61, t63, u17.t156, i1.u2.t148, i2.u6.t146, i3.u8.t153, i4.u10.t145, i5.u12.t155, i6.u14.t144, i7.t52, i7.u0.t149, i7.u16.t59, i9.u18.t143, i10.u4.t152, i11.u20.t157, i12.u22.t5, i12.u22.t150, i12.u23.t142, i13.u25.t158, i14.u27.t141, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/30/105
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
107 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,1.08197,38552,1,0,44671,9390,1050,107601,232,49564,35801
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-14a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DiscoveryGPU-PT-14a-09 finished in 18126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 159/159 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 112 transition count 153
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 112 transition count 153
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 108 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 108 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 105 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 105 transition count 146
Applied a total of 26 rules in 6 ms. Remains 105 /118 variables (removed 13) and now considering 146/159 (removed 13) transitions.
// Phase 1: matrix 146 rows 105 cols
[2021-05-09 17:23:07] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 146 rows 105 cols
[2021-05-09 17:23:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:23:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 146 rows 105 cols
[2021-05-09 17:23:07] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:23:07] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/118 places, 146/159 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14a-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (NEQ s83 0) (NEQ s91 1)), p0:(AND (NEQ s83 0) (NEQ s91 1) (NEQ s77 0) (NEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-12 finished in 313 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 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 159/159 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 137 edges and 116 vertex of which 56 / 116 are part of one of the 28 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 88 transition count 133
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 81 place count 63 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 62 transition count 104
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 90 place count 54 transition count 88
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 54 transition count 88
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 99 place count 54 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 53 transition count 87
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 109 place count 44 transition count 69
Iterating global reduction 5 with 9 rules applied. Total rules applied 118 place count 44 transition count 69
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 119 place count 44 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 120 place count 43 transition count 68
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 130 place count 33 transition count 48
Iterating global reduction 7 with 10 rules applied. Total rules applied 140 place count 33 transition count 48
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 150 place count 23 transition count 36
Iterating global reduction 7 with 10 rules applied. Total rules applied 160 place count 23 transition count 36
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 162 place count 21 transition count 33
Iterating global reduction 7 with 2 rules applied. Total rules applied 164 place count 21 transition count 33
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 165 place count 20 transition count 32
Iterating global reduction 7 with 1 rules applied. Total rules applied 166 place count 20 transition count 32
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 176 place count 15 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 177 place count 14 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 14 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 179 place count 13 transition count 22
Iterating global reduction 7 with 1 rules applied. Total rules applied 180 place count 13 transition count 22
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 181 place count 12 transition count 21
Iterating global reduction 7 with 1 rules applied. Total rules applied 182 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 183 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 184 place count 11 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 185 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 9 transition count 17
Applied a total of 186 rules in 14 ms. Remains 9 /118 variables (removed 109) and now considering 17/159 (removed 142) transitions.
[2021-05-09 17:23:07] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:23:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 17:23:07] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:23:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:23:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 17:23:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:23:07] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:23:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 17:23:07] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/118 places, 17/159 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s6 0) (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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-14 finished in 96 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620580988983

--------------------
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-14a"
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-14a, 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-162048875300364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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