About the Execution of ITS-Tools for DBSingleClientW-PT-d1m10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
328.592 | 21794.00 | 28795.00 | 2625.20 | FFFTFFFTTFTTFFFT | 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.r101-tall-167814475200284.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 DBSingleClientW-PT-d1m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475200284
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 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 432K 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 DBSingleClientW-PT-d1m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678246190302
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 03:29:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 03:29:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:29:52] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-08 03:29:52] [INFO ] Transformed 1440 places.
[2023-03-08 03:29:52] [INFO ] Transformed 672 transitions.
[2023-03-08 03:29:52] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 429
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 429
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 279 place count 246 transition count 411
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 341 place count 184 transition count 349
Iterating global reduction 2 with 62 rules applied. Total rules applied 403 place count 184 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 405 place count 184 transition count 347
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 437 place count 152 transition count 296
Iterating global reduction 3 with 32 rules applied. Total rules applied 469 place count 152 transition count 296
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 501 place count 152 transition count 264
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 507 place count 146 transition count 256
Iterating global reduction 4 with 6 rules applied. Total rules applied 513 place count 146 transition count 256
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 517 place count 142 transition count 252
Iterating global reduction 4 with 4 rules applied. Total rules applied 521 place count 142 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 522 place count 142 transition count 251
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 525 place count 139 transition count 248
Iterating global reduction 5 with 3 rules applied. Total rules applied 528 place count 139 transition count 248
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 529 place count 138 transition count 246
Iterating global reduction 5 with 1 rules applied. Total rules applied 530 place count 138 transition count 246
Applied a total of 530 rules in 69 ms. Remains 138 /347 variables (removed 209) and now considering 246/672 (removed 426) transitions.
// Phase 1: matrix 246 rows 138 cols
[2023-03-08 03:29:52] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-08 03:29:52] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-08 03:29:52] [INFO ] Invariant cache hit.
[2023-03-08 03:29:52] [INFO ] State equation strengthened by 125 read => feed constraints.
[2023-03-08 03:29:53] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-08 03:29:53] [INFO ] Invariant cache hit.
[2023-03-08 03:29:53] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/347 places, 246/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 138/347 places, 246/672 transitions.
Support contains 28 out of 138 places after structural reductions.
[2023-03-08 03:29:53] [INFO ] Flatten gal took : 41 ms
[2023-03-08 03:29:53] [INFO ] Flatten gal took : 19 ms
[2023-03-08 03:29:53] [INFO ] Input system was already deterministic with 246 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-08 03:29:54] [INFO ] Invariant cache hit.
[2023-03-08 03:29:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 03:29:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 03:29:55] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:13
[2023-03-08 03:29:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 03:29:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 03:29:56] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-08 03:29:56] [INFO ] State equation strengthened by 125 read => feed constraints.
[2023-03-08 03:29:56] [INFO ] After 476ms SMT Verify possible using 125 Read/Feed constraints in natural domain returned unsat :3 sat :13
[2023-03-08 03:29:57] [INFO ] After 1113ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 775 ms.
[2023-03-08 03:29:58] [INFO ] After 2754ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 91 ms.
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 246/246 transitions.
Graph (complete) has 472 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 137 transition count 241
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 15 place count 128 transition count 209
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 128 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 128 transition count 206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 32 place count 123 transition count 201
Iterating global reduction 2 with 5 rules applied. Total rules applied 37 place count 123 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 123 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 42 place count 120 transition count 193
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 120 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 48 place count 120 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 119 transition count 189
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 119 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 118 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 118 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 54 place count 118 transition count 186
Applied a total of 54 rules in 47 ms. Remains 118 /138 variables (removed 20) and now considering 186/246 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 118/138 places, 186/246 transitions.
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 935 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 984 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Finished probabilistic random walk after 51355 steps, run visited all 12 properties in 222 ms. (steps per millisecond=231 )
Probabilistic random walk after 51355 steps, saw 21984 distinct states, run finished after 223 ms. (steps per millisecond=230 ) properties seen :12
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 24 stable transitions
Graph (complete) has 521 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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' '!(G(F(p0)))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 183
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 120 transition count 179
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 109 transition count 168
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 109 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 68 place count 109 transition count 162
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 99 transition count 146
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 99 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 99 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 98 place count 93 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 93 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 108 place count 93 transition count 122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 90 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 90 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 89 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 89 transition count 117
Applied a total of 117 rules in 31 ms. Remains 89 /138 variables (removed 49) and now considering 117/246 (removed 129) transitions.
// Phase 1: matrix 117 rows 89 cols
[2023-03-08 03:29:59] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 03:29:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-08 03:29:59] [INFO ] Invariant cache hit.
[2023-03-08 03:29:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 03:30:00] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-08 03:30:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:30:00] [INFO ] Invariant cache hit.
[2023-03-08 03:30:00] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/138 places, 117/246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 615 ms. Remains : 89/138 places, 117/246 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-00 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:(OR (AND (GEQ s1 1) (GEQ s84 1)) (AND (GEQ s1 1) (GEQ s80 1)) (AND (GEQ s1 1) (GEQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-00 finished in 880 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||X(p0)))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 119 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 119 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 119 transition count 171
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 107 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 107 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 70 place count 107 transition count 153
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 81 place count 96 transition count 135
Iterating global reduction 2 with 11 rules applied. Total rules applied 92 place count 96 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 96 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 90 transition count 115
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 90 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 90 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 113 place count 87 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 87 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 86 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 86 transition count 107
Applied a total of 120 rules in 14 ms. Remains 86 /138 variables (removed 52) and now considering 107/246 (removed 139) transitions.
// Phase 1: matrix 107 rows 86 cols
[2023-03-08 03:30:00] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:30:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 03:30:00] [INFO ] Invariant cache hit.
[2023-03-08 03:30:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-08 03:30:00] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-08 03:30:00] [INFO ] Invariant cache hit.
[2023-03-08 03:30:00] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/138 places, 107/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 86/138 places, 107/246 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-02 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: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s73 1))], 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 DBSingleClientW-PT-d1m10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-02 finished in 456 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' '!((G(p0)||X(X(F(p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 119 transition count 176
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 119 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 119 transition count 174
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 108 transition count 163
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 108 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 108 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 98 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 98 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 98 transition count 136
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 98 place count 92 transition count 121
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 92 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 92 transition count 120
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 109 place count 88 transition count 116
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 88 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 116 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 87 transition count 112
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 87 transition count 112
Applied a total of 118 rules in 10 ms. Remains 87 /138 variables (removed 51) and now considering 112/246 (removed 134) transitions.
// Phase 1: matrix 112 rows 87 cols
[2023-03-08 03:30:00] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:30:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 03:30:01] [INFO ] Invariant cache hit.
[2023-03-08 03:30:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 03:30:01] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-08 03:30:01] [INFO ] Invariant cache hit.
[2023-03-08 03:30:01] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/138 places, 112/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 87/138 places, 112/246 transitions.
Stuttering acceptance computed with spot in 484 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s77 1)), p0:(AND (GEQ s1 1) (GEQ s36 1))], 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 264 ms.
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 297 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 501 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-03 finished in 1687 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||(G((p1 U p2)) U p2))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 121 transition count 183
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 121 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 121 transition count 181
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 111 transition count 171
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 111 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 111 transition count 165
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 102 transition count 150
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 102 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 85 place count 102 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 98 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 98 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 97 place count 98 transition count 135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 96 transition count 133
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 96 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 103 place count 96 transition count 131
Applied a total of 103 rules in 36 ms. Remains 96 /138 variables (removed 42) and now considering 131/246 (removed 115) transitions.
// Phase 1: matrix 131 rows 96 cols
[2023-03-08 03:30:02] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:30:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 03:30:02] [INFO ] Invariant cache hit.
[2023-03-08 03:30:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-08 03:30:02] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 03:30:02] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 03:30:02] [INFO ] Invariant cache hit.
[2023-03-08 03:30:02] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/138 places, 131/246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 96/138 places, 131/246 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p2:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-06 finished in 374 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(F((G(p1)||p0))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 177
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 120 transition count 175
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 110 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 110 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 63 place count 110 transition count 160
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 72 place count 101 transition count 145
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 101 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 101 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 96 transition count 132
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 96 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 96 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 100 place count 92 transition count 127
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 92 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 107 place count 92 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 91 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 91 transition count 123
Applied a total of 109 rules in 12 ms. Remains 91 /138 variables (removed 47) and now considering 123/246 (removed 123) transitions.
// Phase 1: matrix 123 rows 91 cols
[2023-03-08 03:30:03] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 03:30:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 03:30:03] [INFO ] Invariant cache hit.
[2023-03-08 03:30:03] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-08 03:30:03] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-08 03:30:03] [INFO ] Invariant cache hit.
[2023-03-08 03:30:03] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/138 places, 123/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 91/138 places, 123/246 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s60 1)), p0:(OR (LT s1 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 314 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-08 finished in 816 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' '!(G(F(((G(p1) U p2)&&p0))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 120 transition count 181
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 109 transition count 170
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 109 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 109 transition count 166
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 74 place count 99 transition count 150
Iterating global reduction 2 with 10 rules applied. Total rules applied 84 place count 99 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 90 place count 99 transition count 144
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 93 transition count 129
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 93 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 93 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 107 place count 89 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 89 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 114 place count 89 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 115 place count 88 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 88 transition count 120
Applied a total of 116 rules in 18 ms. Remains 88 /138 variables (removed 50) and now considering 120/246 (removed 126) transitions.
// Phase 1: matrix 120 rows 88 cols
[2023-03-08 03:30:03] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:30:03] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 03:30:03] [INFO ] Invariant cache hit.
[2023-03-08 03:30:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 03:30:04] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-08 03:30:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:30:04] [INFO ] Invariant cache hit.
[2023-03-08 03:30:04] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/138 places, 120/246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 88/138 places, 120/246 transitions.
Stuttering acceptance computed with spot in 1115 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s80 1)), p2:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s1 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-12 finished in 1384 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' '!((G(p0)||X(p1)))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 173
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 120 transition count 171
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 109 transition count 160
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 109 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 109 transition count 156
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 75 place count 98 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 86 place count 98 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 91 place count 98 transition count 133
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 98 place count 91 transition count 116
Iterating global reduction 3 with 7 rules applied. Total rules applied 105 place count 91 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 91 transition count 114
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 87 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 87 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 118 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 86 transition count 106
Applied a total of 120 rules in 5 ms. Remains 86 /138 variables (removed 52) and now considering 106/246 (removed 140) transitions.
// Phase 1: matrix 106 rows 86 cols
[2023-03-08 03:30:05] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:30:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 03:30:05] [INFO ] Invariant cache hit.
[2023-03-08 03:30:05] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-08 03:30:05] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-08 03:30:05] [INFO ] Invariant cache hit.
[2023-03-08 03:30:05] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/138 places, 106/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 86/138 places, 106/246 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s77 1)), p0:(OR (LT s1 1) (LT s40 1))], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 10 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-13 finished in 345 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 177
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 120 transition count 175
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 109 transition count 164
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 109 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 109 transition count 158
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 101 transition count 144
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 101 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 101 transition count 140
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 91 place count 96 transition count 133
Iterating global reduction 3 with 5 rules applied. Total rules applied 96 place count 96 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 96 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 93 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 93 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 107 place count 93 transition count 125
Applied a total of 107 rules in 23 ms. Remains 93 /138 variables (removed 45) and now considering 125/246 (removed 121) transitions.
// Phase 1: matrix 125 rows 93 cols
[2023-03-08 03:30:05] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:30:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 03:30:05] [INFO ] Invariant cache hit.
[2023-03-08 03:30:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 03:30:05] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-08 03:30:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 03:30:05] [INFO ] Invariant cache hit.
[2023-03-08 03:30:05] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/138 places, 125/246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 93/138 places, 125/246 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p1:(AND (GEQ s7 1) (GEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-14 finished in 373 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) U X(!p1)))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 246/246 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 119 transition count 172
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 119 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 119 transition count 170
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 107 transition count 158
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 107 transition count 158
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 69 place count 107 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 78 place count 98 transition count 138
Iterating global reduction 2 with 9 rules applied. Total rules applied 87 place count 98 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 98 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 93 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 93 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 90 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 90 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 110 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 111 place count 89 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 89 transition count 113
Applied a total of 112 rules in 11 ms. Remains 89 /138 variables (removed 49) and now considering 113/246 (removed 133) transitions.
// Phase 1: matrix 113 rows 89 cols
[2023-03-08 03:30:05] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:30:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 03:30:06] [INFO ] Invariant cache hit.
[2023-03-08 03:30:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 03:30:06] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-08 03:30:06] [INFO ] Invariant cache hit.
[2023-03-08 03:30:06] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/138 places, 113/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 89/138 places, 113/246 transitions.
Stuttering acceptance computed with spot in 129 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s34 1)), p1:(AND (GEQ s1 1) (GEQ s74 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 303 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-15 finished in 860 ms.
All properties solved by simple procedures.
Total runtime 15080 ms.
BK_STOP 1678246212096
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="DBSingleClientW-PT-d1m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475200284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m10.tgz
mv DBSingleClientW-PT-d1m10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;