Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 9.9K Apr 29 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 647K May 10 09:34 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 1652791824730

Running Version 202205111006
[2022-05-17 12:50:25] [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]
[2022-05-17 12:50:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 12:50:26] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2022-05-17 12:50:26] [INFO ] Transformed 462 places.
[2022-05-17 12:50:26] [INFO ] Transformed 409 transitions.
[2022-05-17 12:50:26] [INFO ] Parsed PT model containing 462 places and 409 transitions in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 383 transition count 409
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 137 place count 325 transition count 351
Iterating global reduction 1 with 58 rules applied. Total rules applied 195 place count 325 transition count 351
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 232 place count 288 transition count 314
Iterating global reduction 1 with 37 rules applied. Total rules applied 269 place count 288 transition count 314
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 304 place count 253 transition count 279
Iterating global reduction 1 with 35 rules applied. Total rules applied 339 place count 253 transition count 279
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 345 place count 247 transition count 279
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 349 place count 243 transition count 275
Iterating global reduction 2 with 4 rules applied. Total rules applied 353 place count 243 transition count 275
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 357 place count 239 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 361 place count 239 transition count 271
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 364 place count 236 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 367 place count 236 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 370 place count 233 transition count 265
Iterating global reduction 2 with 3 rules applied. Total rules applied 373 place count 233 transition count 265
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 379 place count 227 transition count 259
Iterating global reduction 2 with 6 rules applied. Total rules applied 385 place count 227 transition count 259
Applied a total of 385 rules in 110 ms. Remains 227 /462 variables (removed 235) and now considering 259/409 (removed 150) transitions.
[2022-05-17 12:50:26] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
// Phase 1: matrix 254 rows 227 cols
[2022-05-17 12:50:26] [INFO ] Computed 25 place invariants in 25 ms
[2022-05-17 12:50:26] [INFO ] Implicit Places using invariants in 270 ms returned [24, 49, 73, 81, 103, 128, 160, 207]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 304 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 219/462 places, 259/409 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 203 transition count 243
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 203 transition count 243
Applied a total of 32 rules in 12 ms. Remains 203 /219 variables (removed 16) and now considering 243/259 (removed 16) transitions.
[2022-05-17 12:50:26] [INFO ] Flow matrix only has 235 transitions (discarded 8 similar events)
// Phase 1: matrix 235 rows 203 cols
[2022-05-17 12:50:26] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 12:50:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-17 12:50:26] [INFO ] Flow matrix only has 235 transitions (discarded 8 similar events)
// Phase 1: matrix 235 rows 203 cols
[2022-05-17 12:50:26] [INFO ] Computed 17 place invariants in 16 ms
[2022-05-17 12:50:26] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 203/462 places, 243/409 transitions.
Finished structural reductions, in 2 iterations. Remains : 203/462 places, 243/409 transitions.
Support contains 37 out of 203 places after structural reductions.
[2022-05-17 12:50:27] [INFO ] Flatten gal took : 44 ms
[2022-05-17 12:50:27] [INFO ] Flatten gal took : 20 ms
[2022-05-17 12:50:27] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 30 out of 203 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 532 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 12:50:27] [INFO ] Flow matrix only has 235 transitions (discarded 8 similar events)
// Phase 1: matrix 235 rows 203 cols
[2022-05-17 12:50:27] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 12:50:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 12:50:27] [INFO ] [Real]Absence check using 1 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-17 12:50:27] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 7 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 203 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 203 transition count 243
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-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(F(G(p0)))))))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 243/243 transitions.
Graph (complete) has 495 edges and 203 vertex of which 196 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 196 transition count 206
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 160 transition count 206
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 73 place count 160 transition count 190
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 105 place count 144 transition count 190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 117 place count 132 transition count 178
Iterating global reduction 2 with 12 rules applied. Total rules applied 129 place count 132 transition count 178
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 135 place count 126 transition count 172
Iterating global reduction 2 with 6 rules applied. Total rules applied 141 place count 126 transition count 172
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 125 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 142 place count 125 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 124 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 123 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 123 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 122 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 122 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 120 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 120 transition count 167
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 222 place count 85 transition count 132
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 232 place count 75 transition count 122
Iterating global reduction 3 with 10 rules applied. Total rules applied 242 place count 75 transition count 122
Applied a total of 242 rules in 49 ms. Remains 75 /203 variables (removed 128) and now considering 122/243 (removed 121) transitions.
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
// Phase 1: matrix 106 rows 75 cols
[2022-05-17 12:50:28] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants in 80 ms returned [2, 11, 16, 22, 26, 31, 33, 39, 41, 47, 51, 53, 55]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 81 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/203 places, 122/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 52 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 52 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 43 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 43 transition count 103
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 34 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 34 transition count 94
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 68 place count 28 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 26 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 26 transition count 86
Applied a total of 72 rules in 9 ms. Remains 26 /62 variables (removed 36) and now considering 86/122 (removed 36) transitions.
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 25 transitions (discarded 61 similar events)
// Phase 1: matrix 25 rows 26 cols
[2022-05-17 12:50:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 25 transitions (discarded 61 similar events)
// Phase 1: matrix 25 rows 26 cols
[2022-05-17 12:50:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/203 places, 86/243 transitions.
Finished structural reductions, in 2 iterations. Remains : 26/203 places, 86/243 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s12)], 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 8 steps with 0 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-01 finished in 418 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(F(p0))))||G(p1)))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 243/243 transitions.
Graph (complete) has 495 edges and 203 vertex of which 197 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 197 transition count 208
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 163 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 162 transition count 207
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 162 transition count 192
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 147 transition count 192
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 113 place count 135 transition count 180
Iterating global reduction 3 with 12 rules applied. Total rules applied 125 place count 135 transition count 180
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 130 transition count 175
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 130 transition count 175
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 129 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 136 place count 129 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 128 transition count 174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 127 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 127 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 126 transition count 172
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 126 transition count 172
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 124 transition count 170
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 124 transition count 170
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 218 place count 88 transition count 134
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 228 place count 78 transition count 124
Iterating global reduction 4 with 10 rules applied. Total rules applied 238 place count 78 transition count 124
Applied a total of 238 rules in 34 ms. Remains 78 /203 variables (removed 125) and now considering 124/243 (removed 119) transitions.
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 107 transitions (discarded 17 similar events)
// Phase 1: matrix 107 rows 78 cols
[2022-05-17 12:50:28] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants in 69 ms returned [2, 11, 17, 23, 26, 31, 33, 39, 41, 47, 51, 58]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 72 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/203 places, 124/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 58 transition count 116
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 58 transition count 116
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 51 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 51 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 44 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 44 transition count 102
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 0 with 16 rules applied. Total rules applied 60 place count 36 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 34 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 34 transition count 92
Applied a total of 64 rules in 9 ms. Remains 34 /66 variables (removed 32) and now considering 92/124 (removed 32) transitions.
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 38 transitions (discarded 54 similar events)
// Phase 1: matrix 38 rows 34 cols
[2022-05-17 12:50:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 38 transitions (discarded 54 similar events)
// Phase 1: matrix 38 rows 34 cols
[2022-05-17 12:50:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/203 places, 92/243 transitions.
Finished structural reductions, in 2 iterations. Remains : 34/203 places, 92/243 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s28 s25), p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 2 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-02 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U G((G(p1) U p1)))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 243/243 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 243
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 28 place count 175 transition count 221
Iterating global reduction 1 with 22 rules applied. Total rules applied 50 place count 175 transition count 221
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 158 transition count 204
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 158 transition count 204
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 157 transition count 204
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 101 place count 141 transition count 188
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 141 transition count 188
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 126 place count 132 transition count 188
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 147 place count 111 transition count 167
Iterating global reduction 3 with 21 rules applied. Total rules applied 168 place count 111 transition count 167
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 178 place count 101 transition count 157
Iterating global reduction 3 with 10 rules applied. Total rules applied 188 place count 101 transition count 157
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 198 place count 91 transition count 147
Iterating global reduction 3 with 10 rules applied. Total rules applied 208 place count 91 transition count 147
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 219 place count 80 transition count 136
Iterating global reduction 3 with 11 rules applied. Total rules applied 230 place count 80 transition count 136
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 247 place count 63 transition count 119
Iterating global reduction 3 with 17 rules applied. Total rules applied 264 place count 63 transition count 119
Applied a total of 264 rules in 19 ms. Remains 63 /203 variables (removed 140) and now considering 119/243 (removed 124) transitions.
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 69 transitions (discarded 50 similar events)
// Phase 1: matrix 69 rows 63 cols
[2022-05-17 12:50:28] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants in 39 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/203 places, 119/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 115
Applied a total of 8 rules in 2 ms. Remains 58 /62 variables (removed 4) and now considering 115/119 (removed 4) transitions.
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 64 transitions (discarded 51 similar events)
// Phase 1: matrix 64 rows 58 cols
[2022-05-17 12:50:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-17 12:50:28] [INFO ] Flow matrix only has 64 transitions (discarded 51 similar events)
// Phase 1: matrix 64 rows 58 cols
[2022-05-17 12:50:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 12:50:28] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/203 places, 115/243 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/203 places, 115/243 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s41), p0:(AND (LEQ s22 s36) (LEQ 1 s41))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30063 steps with 7550 reset in 204 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-03 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 243/243 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 243
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 29 place count 174 transition count 220
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 174 transition count 220
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 156 transition count 202
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 156 transition count 202
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 154 transition count 202
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 107 place count 137 transition count 185
Iterating global reduction 2 with 17 rules applied. Total rules applied 124 place count 137 transition count 185
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 132 place count 129 transition count 185
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 153 place count 108 transition count 164
Iterating global reduction 3 with 21 rules applied. Total rules applied 174 place count 108 transition count 164
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 184 place count 98 transition count 154
Iterating global reduction 3 with 10 rules applied. Total rules applied 194 place count 98 transition count 154
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 204 place count 88 transition count 144
Iterating global reduction 3 with 10 rules applied. Total rules applied 214 place count 88 transition count 144
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 226 place count 76 transition count 132
Iterating global reduction 3 with 12 rules applied. Total rules applied 238 place count 76 transition count 132
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 253 place count 61 transition count 117
Iterating global reduction 3 with 15 rules applied. Total rules applied 268 place count 61 transition count 117
Applied a total of 268 rules in 14 ms. Remains 61 /203 variables (removed 142) and now considering 117/243 (removed 126) transitions.
[2022-05-17 12:50:29] [INFO ] Flow matrix only has 66 transitions (discarded 51 similar events)
// Phase 1: matrix 66 rows 61 cols
[2022-05-17 12:50:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 12:50:29] [INFO ] Implicit Places using invariants in 45 ms returned [21, 28, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/203 places, 117/243 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 51 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 51 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 50 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 50 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 49 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 49 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 48 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 48 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 47 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 47 transition count 106
Applied a total of 22 rules in 1 ms. Remains 47 /58 variables (removed 11) and now considering 106/117 (removed 11) transitions.
[2022-05-17 12:50:29] [INFO ] Flow matrix only has 51 transitions (discarded 55 similar events)
// Phase 1: matrix 51 rows 47 cols
[2022-05-17 12:50:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:50:29] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-17 12:50:29] [INFO ] Flow matrix only has 51 transitions (discarded 55 similar events)
// Phase 1: matrix 51 rows 47 cols
[2022-05-17 12:50:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:50:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 47/203 places, 106/243 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/203 places, 106/243 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s23 s31)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 47 stabilizing places and 106 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 106
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 : [p0, (X p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-06 finished in 784 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 243/243 transitions.
Graph (complete) has 495 edges and 203 vertex of which 197 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 197 transition count 208
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 163 transition count 208
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 69 place count 163 transition count 192
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 101 place count 147 transition count 192
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 113 place count 135 transition count 180
Iterating global reduction 2 with 12 rules applied. Total rules applied 125 place count 135 transition count 180
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 131 place count 129 transition count 174
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 129 transition count 174
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 128 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 128 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 127 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 126 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 126 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 125 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 125 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 123 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 123 transition count 169
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 218 place count 88 transition count 134
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 227 place count 79 transition count 125
Iterating global reduction 3 with 9 rules applied. Total rules applied 236 place count 79 transition count 125
Applied a total of 236 rules in 30 ms. Remains 79 /203 variables (removed 124) and now considering 125/243 (removed 118) transitions.
[2022-05-17 12:50:30] [INFO ] Flow matrix only has 108 transitions (discarded 17 similar events)
// Phase 1: matrix 108 rows 79 cols
[2022-05-17 12:50:30] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 12:50:30] [INFO ] Implicit Places using invariants in 55 ms returned [14, 19, 25, 28, 33, 35, 41, 51, 55, 57, 59]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 56 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/203 places, 125/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 117
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 53 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 53 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 46 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 46 transition count 103
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 0 with 16 rules applied. Total rules applied 60 place count 38 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 36 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 36 transition count 93
Applied a total of 64 rules in 6 ms. Remains 36 /68 variables (removed 32) and now considering 93/125 (removed 32) transitions.
[2022-05-17 12:50:30] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
// Phase 1: matrix 39 rows 36 cols
[2022-05-17 12:50:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 12:50:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-17 12:50:30] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
// Phase 1: matrix 39 rows 36 cols
[2022-05-17 12:50:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 12:50:30] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/203 places, 93/243 transitions.
Finished structural reductions, in 2 iterations. Remains : 36/203 places, 93/243 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-07 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:(LEQ s23 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10982 reset in 133 ms.
Product exploration explored 100000 steps with 11018 reset in 144 ms.
Computed a total of 36 stabilizing places and 93 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 36 transition count 93
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-07 finished in 687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||p1)))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 243/243 transitions.
Graph (complete) has 495 edges and 203 vertex of which 197 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 197 transition count 210
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 165 transition count 210
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 65 place count 165 transition count 192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 101 place count 147 transition count 192
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 113 place count 135 transition count 180
Iterating global reduction 2 with 12 rules applied. Total rules applied 125 place count 135 transition count 180
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 130 transition count 175
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 130 transition count 175
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 129 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 136 place count 129 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 128 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 127 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 127 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 126 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 126 transition count 172
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 124 transition count 170
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 124 transition count 170
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 212 place count 91 transition count 137
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 221 place count 82 transition count 128
Iterating global reduction 3 with 9 rules applied. Total rules applied 230 place count 82 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 231 place count 81 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 81 transition count 127
Applied a total of 232 rules in 35 ms. Remains 81 /203 variables (removed 122) and now considering 127/243 (removed 116) transitions.
[2022-05-17 12:50:30] [INFO ] Flow matrix only has 110 transitions (discarded 17 similar events)
// Phase 1: matrix 110 rows 81 cols
[2022-05-17 12:50:30] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 12:50:30] [INFO ] Implicit Places using invariants in 65 ms returned [2, 11, 16, 22, 34, 36, 47, 53, 57, 59, 61]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 76 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/203 places, 127/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 55 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 55 transition count 112
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 48 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 48 transition count 105
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 0 with 16 rules applied. Total rules applied 60 place count 40 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 38 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 38 transition count 95
Applied a total of 64 rules in 7 ms. Remains 38 /70 variables (removed 32) and now considering 95/127 (removed 32) transitions.
[2022-05-17 12:50:30] [INFO ] Flow matrix only has 41 transitions (discarded 54 similar events)
// Phase 1: matrix 41 rows 38 cols
[2022-05-17 12:50:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 12:50:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-17 12:50:30] [INFO ] Flow matrix only has 41 transitions (discarded 54 similar events)
// Phase 1: matrix 41 rows 38 cols
[2022-05-17 12:50:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 12:50:30] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/203 places, 95/243 transitions.
Finished structural reductions, in 2 iterations. Remains : 38/203 places, 95/243 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(GT 1 s25), p1:(LEQ s17 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1901 steps with 197 reset in 5 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-09 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 243/243 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 243
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 28 place count 175 transition count 221
Iterating global reduction 1 with 22 rules applied. Total rules applied 50 place count 175 transition count 221
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 157 transition count 203
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 157 transition count 203
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 156 transition count 203
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 105 place count 138 transition count 185
Iterating global reduction 2 with 18 rules applied. Total rules applied 123 place count 138 transition count 185
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 128 transition count 185
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 156 place count 105 transition count 162
Iterating global reduction 3 with 23 rules applied. Total rules applied 179 place count 105 transition count 162
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 190 place count 94 transition count 151
Iterating global reduction 3 with 11 rules applied. Total rules applied 201 place count 94 transition count 151
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 212 place count 83 transition count 140
Iterating global reduction 3 with 11 rules applied. Total rules applied 223 place count 83 transition count 140
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 235 place count 71 transition count 128
Iterating global reduction 3 with 12 rules applied. Total rules applied 247 place count 71 transition count 128
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 266 place count 52 transition count 109
Iterating global reduction 3 with 19 rules applied. Total rules applied 285 place count 52 transition count 109
Applied a total of 285 rules in 17 ms. Remains 52 /203 variables (removed 151) and now considering 109/243 (removed 134) transitions.
[2022-05-17 12:50:31] [INFO ] Flow matrix only has 56 transitions (discarded 53 similar events)
// Phase 1: matrix 56 rows 52 cols
[2022-05-17 12:50:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 12:50:31] [INFO ] Implicit Places using invariants in 39 ms returned [22, 29, 40]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/203 places, 109/243 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 43 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 43 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 42 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 42 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 41 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 41 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 40 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 40 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 39 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 39 transition count 99
Applied a total of 20 rules in 9 ms. Remains 39 /49 variables (removed 10) and now considering 99/109 (removed 10) transitions.
[2022-05-17 12:50:31] [INFO ] Flow matrix only has 41 transitions (discarded 58 similar events)
// Phase 1: matrix 41 rows 39 cols
[2022-05-17 12:50:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 12:50:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-17 12:50:31] [INFO ] Flow matrix only has 41 transitions (discarded 58 similar events)
// Phase 1: matrix 41 rows 39 cols
[2022-05-17 12:50:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 12:50:31] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/203 places, 99/243 transitions.
Finished structural reductions, in 2 iterations. Remains : 39/203 places, 99/243 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s24 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 39 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 99
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-13 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 243/243 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 243
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 29 place count 174 transition count 220
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 174 transition count 220
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 156 transition count 202
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 156 transition count 202
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 154 transition count 202
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 108 place count 136 transition count 184
Iterating global reduction 2 with 18 rules applied. Total rules applied 126 place count 136 transition count 184
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 135 place count 127 transition count 184
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 157 place count 105 transition count 162
Iterating global reduction 3 with 22 rules applied. Total rules applied 179 place count 105 transition count 162
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 190 place count 94 transition count 151
Iterating global reduction 3 with 11 rules applied. Total rules applied 201 place count 94 transition count 151
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 212 place count 83 transition count 140
Iterating global reduction 3 with 11 rules applied. Total rules applied 223 place count 83 transition count 140
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 236 place count 70 transition count 127
Iterating global reduction 3 with 13 rules applied. Total rules applied 249 place count 70 transition count 127
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 266 place count 53 transition count 110
Iterating global reduction 3 with 17 rules applied. Total rules applied 283 place count 53 transition count 110
Applied a total of 283 rules in 9 ms. Remains 53 /203 variables (removed 150) and now considering 110/243 (removed 133) transitions.
[2022-05-17 12:50:31] [INFO ] Flow matrix only has 56 transitions (discarded 54 similar events)
// Phase 1: matrix 56 rows 53 cols
[2022-05-17 12:50:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 12:50:31] [INFO ] Implicit Places using invariants in 58 ms returned [21, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/203 places, 110/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 47 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 47 transition count 106
Applied a total of 8 rules in 1 ms. Remains 47 /51 variables (removed 4) and now considering 106/110 (removed 4) transitions.
[2022-05-17 12:50:31] [INFO ] Flow matrix only has 51 transitions (discarded 55 similar events)
// Phase 1: matrix 51 rows 47 cols
[2022-05-17 12:50:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:50:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2022-05-17 12:50:31] [INFO ] Flow matrix only has 51 transitions (discarded 55 similar events)
// Phase 1: matrix 51 rows 47 cols
[2022-05-17 12:50:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:50:31] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 47/203 places, 106/243 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/203 places, 106/243 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s24 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-14 finished in 318 ms.
All properties solved by simple procedures.
Total runtime 6107 ms.

BK_STOP 1652791832335

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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-4028"
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 r132-tall-165271820900451"
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 ;