fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r229-tall-167856413300451
Last Updated
May 14, 2023

About the Execution of ITS-Tools for LeafsetExtension-PT-S08C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
338.800 11294.00 17346.00 1425.00 FTFTTFFFTFFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r229-tall-167856413300451.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is LeafsetExtension-PT-S08C2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413300451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 647K Mar 5 18:22 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 LeafsetExtension-PT-S08C2-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679489545815

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C2
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 12:52:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 12:52:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:52:27] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-22 12:52:27] [INFO ] Transformed 462 places.
[2023-03-22 12:52:27] [INFO ] Transformed 409 transitions.
[2023-03-22 12:52:27] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 386 transition count 409
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 133 place count 329 transition count 352
Iterating global reduction 1 with 57 rules applied. Total rules applied 190 place count 329 transition count 352
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 227 place count 292 transition count 315
Iterating global reduction 1 with 37 rules applied. Total rules applied 264 place count 292 transition count 315
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 297 place count 259 transition count 282
Iterating global reduction 1 with 33 rules applied. Total rules applied 330 place count 259 transition count 282
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 336 place count 253 transition count 282
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 340 place count 249 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 249 transition count 278
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 348 place count 245 transition count 274
Iterating global reduction 2 with 4 rules applied. Total rules applied 352 place count 245 transition count 274
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 354 place count 243 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 356 place count 243 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 358 place count 241 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 360 place count 241 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 361 place count 240 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 362 place count 240 transition count 269
Applied a total of 362 rules in 99 ms. Remains 240 /462 variables (removed 222) and now considering 269/409 (removed 140) transitions.
[2023-03-22 12:52:27] [INFO ] Flow matrix only has 268 transitions (discarded 1 similar events)
// Phase 1: matrix 268 rows 240 cols
[2023-03-22 12:52:27] [INFO ] Computed 26 place invariants in 26 ms
[2023-03-22 12:52:28] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2023-03-22 12:52:28] [INFO ] Flow matrix only has 268 transitions (discarded 1 similar events)
[2023-03-22 12:52:28] [INFO ] Invariant cache hit.
[2023-03-22 12:52:29] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
[2023-03-22 12:52:29] [INFO ] Flow matrix only has 268 transitions (discarded 1 similar events)
[2023-03-22 12:52:29] [INFO ] Invariant cache hit.
[2023-03-22 12:52:29] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/462 places, 269/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1987 ms. Remains : 240/462 places, 269/409 transitions.
Support contains 41 out of 240 places after structural reductions.
[2023-03-22 12:52:29] [INFO ] Flatten gal took : 44 ms
[2023-03-22 12:52:29] [INFO ] Flatten gal took : 18 ms
[2023-03-22 12:52:29] [INFO ] Input system was already deterministic with 269 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-22 12:52:31] [INFO ] Flow matrix only has 268 transitions (discarded 1 similar events)
[2023-03-22 12:52:31] [INFO ] Invariant cache hit.
[2023-03-22 12:52:31] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 12:52:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 12:52:31] [INFO ] [Nat]Absence check using 1 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 12:52:31] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 240 stabilizing places and 269 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 240 transition count 269
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 269/269 transitions.
Graph (complete) has 622 edges and 240 vertex of which 229 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 229 transition count 232
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 194 transition count 232
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 71 place count 194 transition count 216
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 103 place count 178 transition count 216
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 111 place count 170 transition count 208
Iterating global reduction 2 with 8 rules applied. Total rules applied 119 place count 170 transition count 208
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 126 place count 163 transition count 201
Iterating global reduction 2 with 7 rules applied. Total rules applied 133 place count 163 transition count 201
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 161 place count 149 transition count 187
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 171 place count 139 transition count 177
Iterating global reduction 2 with 10 rules applied. Total rules applied 181 place count 139 transition count 177
Applied a total of 181 rules in 48 ms. Remains 139 /240 variables (removed 101) and now considering 177/269 (removed 92) transitions.
[2023-03-22 12:52:31] [INFO ] Flow matrix only has 168 transitions (discarded 9 similar events)
// Phase 1: matrix 168 rows 139 cols
[2023-03-22 12:52:31] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-22 12:52:31] [INFO ] Implicit Places using invariants in 102 ms returned [13, 25, 28, 42, 45, 50, 57, 59, 64, 70, 73, 80, 83, 88, 95, 98, 106, 109, 115, 122]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 105 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/240 places, 177/269 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 119 transition count 165
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 107 transition count 165
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 77 place count 54 transition count 112
Iterating global reduction 0 with 53 rules applied. Total rules applied 130 place count 54 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 46 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 46 transition count 104
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 0 with 12 rules applied. Total rules applied 158 place count 40 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 160 place count 38 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 162 place count 38 transition count 96
Applied a total of 162 rules in 14 ms. Remains 38 /119 variables (removed 81) and now considering 96/177 (removed 81) transitions.
[2023-03-22 12:52:31] [INFO ] Flow matrix only has 44 transitions (discarded 52 similar events)
// Phase 1: matrix 44 rows 38 cols
[2023-03-22 12:52:31] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 12:52:31] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 12:52:31] [INFO ] Flow matrix only has 44 transitions (discarded 52 similar events)
[2023-03-22 12:52:31] [INFO ] Invariant cache hit.
[2023-03-22 12:52:32] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/240 places, 96/269 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 38/240 places, 96/269 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT s8 s13) (GT s24 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-02 finished in 470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&(p1||G(p2))))))'
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 269/269 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 232 transition count 269
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 29 place count 211 transition count 248
Iterating global reduction 1 with 21 rules applied. Total rules applied 50 place count 211 transition count 248
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 210 transition count 248
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 70 place count 191 transition count 229
Iterating global reduction 2 with 19 rules applied. Total rules applied 89 place count 191 transition count 229
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 190 transition count 229
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 110 place count 170 transition count 209
Iterating global reduction 3 with 20 rules applied. Total rules applied 130 place count 170 transition count 209
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 3 with 9 rules applied. Total rules applied 139 place count 161 transition count 209
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 150 place count 150 transition count 198
Iterating global reduction 4 with 11 rules applied. Total rules applied 161 place count 150 transition count 198
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 172 place count 139 transition count 187
Iterating global reduction 4 with 11 rules applied. Total rules applied 183 place count 139 transition count 187
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 197 place count 125 transition count 173
Iterating global reduction 4 with 14 rules applied. Total rules applied 211 place count 125 transition count 173
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 224 place count 112 transition count 160
Iterating global reduction 4 with 13 rules applied. Total rules applied 237 place count 112 transition count 160
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 273 place count 76 transition count 124
Iterating global reduction 4 with 36 rules applied. Total rules applied 309 place count 76 transition count 124
Applied a total of 309 rules in 31 ms. Remains 76 /240 variables (removed 164) and now considering 124/269 (removed 145) transitions.
[2023-03-22 12:52:32] [INFO ] Flow matrix only has 74 transitions (discarded 50 similar events)
// Phase 1: matrix 74 rows 76 cols
[2023-03-22 12:52:32] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-22 12:52:32] [INFO ] Implicit Places using invariants in 59 ms returned [19, 23, 27, 31, 33, 36, 42, 47, 51, 66]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 61 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/240 places, 124/269 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 52 transition count 110
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 52 transition count 110
Applied a total of 28 rules in 2 ms. Remains 52 /66 variables (removed 14) and now considering 110/124 (removed 14) transitions.
[2023-03-22 12:52:32] [INFO ] Flow matrix only has 55 transitions (discarded 55 similar events)
// Phase 1: matrix 55 rows 52 cols
[2023-03-22 12:52:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 12:52:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-22 12:52:32] [INFO ] Flow matrix only has 55 transitions (discarded 55 similar events)
[2023-03-22 12:52:32] [INFO ] Invariant cache hit.
[2023-03-22 12:52:32] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/240 places, 110/269 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 52/240 places, 110/269 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 4}, { cond=(OR p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s41 s23), p2:(AND (LEQ s24 s37) (LEQ 1 s39)), p0:(LEQ s24 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5624 reset in 213 ms.
Product exploration explored 100000 steps with 5617 reset in 141 ms.
Computed a total of 52 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-03 finished in 1173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 269/269 transitions.
Graph (complete) has 622 edges and 240 vertex of which 230 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 230 transition count 233
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 196 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 195 transition count 232
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 71 place count 195 transition count 217
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 101 place count 180 transition count 217
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 111 place count 170 transition count 207
Iterating global reduction 3 with 10 rules applied. Total rules applied 121 place count 170 transition count 207
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 128 place count 163 transition count 200
Iterating global reduction 3 with 7 rules applied. Total rules applied 135 place count 163 transition count 200
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 163 place count 149 transition count 186
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 171 place count 141 transition count 178
Iterating global reduction 3 with 8 rules applied. Total rules applied 179 place count 141 transition count 178
Applied a total of 179 rules in 36 ms. Remains 141 /240 variables (removed 99) and now considering 178/269 (removed 91) transitions.
[2023-03-22 12:52:33] [INFO ] Flow matrix only has 169 transitions (discarded 9 similar events)
// Phase 1: matrix 169 rows 141 cols
[2023-03-22 12:52:33] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-22 12:52:33] [INFO ] Implicit Places using invariants in 95 ms returned [13, 25, 28, 33, 40, 43, 48, 55, 57, 62, 68, 81, 84, 89, 97, 100, 109, 112, 117, 124]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 96 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/240 places, 178/269 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 2 place count 120 transition count 165
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 108 transition count 165
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 79 place count 55 transition count 112
Iterating global reduction 2 with 53 rules applied. Total rules applied 132 place count 55 transition count 112
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 139 place count 48 transition count 105
Iterating global reduction 2 with 7 rules applied. Total rules applied 146 place count 48 transition count 105
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 2 with 12 rules applied. Total rules applied 158 place count 42 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 40 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 40 transition count 97
Applied a total of 162 rules in 19 ms. Remains 40 /121 variables (removed 81) and now considering 97/178 (removed 81) transitions.
[2023-03-22 12:52:33] [INFO ] Flow matrix only has 48 transitions (discarded 49 similar events)
// Phase 1: matrix 48 rows 40 cols
[2023-03-22 12:52:33] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 12:52:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 12:52:33] [INFO ] Flow matrix only has 48 transitions (discarded 49 similar events)
[2023-03-22 12:52:33] [INFO ] Invariant cache hit.
[2023-03-22 12:52:33] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/240 places, 97/269 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 227 ms. Remains : 40/240 places, 97/269 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s26 s21), p1:(LEQ s35 s7)], 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 20 steps with 1 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-06 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(p1||X(p1))))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 269/269 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 231 transition count 269
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 33 place count 207 transition count 245
Iterating global reduction 1 with 24 rules applied. Total rules applied 57 place count 207 transition count 245
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 206 transition count 245
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 78 place count 186 transition count 225
Iterating global reduction 2 with 20 rules applied. Total rules applied 98 place count 186 transition count 225
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 185 transition count 225
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 121 place count 163 transition count 203
Iterating global reduction 3 with 22 rules applied. Total rules applied 143 place count 163 transition count 203
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 3 with 9 rules applied. Total rules applied 152 place count 154 transition count 203
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 163 place count 143 transition count 192
Iterating global reduction 4 with 11 rules applied. Total rules applied 174 place count 143 transition count 192
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 184 place count 133 transition count 182
Iterating global reduction 4 with 10 rules applied. Total rules applied 194 place count 133 transition count 182
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 207 place count 120 transition count 169
Iterating global reduction 4 with 13 rules applied. Total rules applied 220 place count 120 transition count 169
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 232 place count 108 transition count 157
Iterating global reduction 4 with 12 rules applied. Total rules applied 244 place count 108 transition count 157
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 275 place count 77 transition count 126
Iterating global reduction 4 with 31 rules applied. Total rules applied 306 place count 77 transition count 126
Applied a total of 306 rules in 22 ms. Remains 77 /240 variables (removed 163) and now considering 126/269 (removed 143) transitions.
[2023-03-22 12:52:33] [INFO ] Flow matrix only has 80 transitions (discarded 46 similar events)
// Phase 1: matrix 80 rows 77 cols
[2023-03-22 12:52:33] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-22 12:52:33] [INFO ] Implicit Places using invariants in 48 ms returned [19, 23, 27, 31, 33, 37, 45, 49, 59, 63, 67]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 50 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/240 places, 126/269 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 46 transition count 106
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 46 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 45 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 45 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 44 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 44 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 43 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 43 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 42 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 42 transition count 102
Applied a total of 48 rules in 2 ms. Remains 42 /66 variables (removed 24) and now considering 102/126 (removed 24) transitions.
[2023-03-22 12:52:33] [INFO ] Flow matrix only has 47 transitions (discarded 55 similar events)
// Phase 1: matrix 47 rows 42 cols
[2023-03-22 12:52:33] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 12:52:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 12:52:33] [INFO ] Flow matrix only has 47 transitions (discarded 55 similar events)
[2023-03-22 12:52:33] [INFO ] Invariant cache hit.
[2023-03-22 12:52:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/240 places, 102/269 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 42/240 places, 102/269 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(GT 2 s37), p1:(LEQ 1 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-10 finished in 306 ms.
All properties solved by simple procedures.
Total runtime 6821 ms.

BK_STOP 1679489557109

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LeafsetExtension-PT-S08C2"
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-5348"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S08C2, 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 r229-tall-167856413300451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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