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.r312-tall-165472282200420.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 FunctionPointer-PT-b002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282200420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.2K Jun 7 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Jun 7 17:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 391K Jun 6 12:11 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 FunctionPointer-PT-b002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654830342695

Running Version 202205111006
[2022-06-10 03:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-06-10 03:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 03:05:44] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2022-06-10 03:05:44] [INFO ] Transformed 306 places.
[2022-06-10 03:05:44] [INFO ] Transformed 840 transitions.
[2022-06-10 03:05:44] [INFO ] Parsed PT model containing 306 places and 840 transitions in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 189 transition count 524
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 524
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 96 place count 189 transition count 484
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 109 place count 176 transition count 458
Iterating global reduction 2 with 13 rules applied. Total rules applied 122 place count 176 transition count 458
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 134 place count 176 transition count 446
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 140 place count 170 transition count 434
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 170 transition count 434
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 164 transition count 410
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 164 transition count 410
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 164 place count 158 transition count 398
Iterating global reduction 3 with 6 rules applied. Total rules applied 170 place count 158 transition count 398
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 155 transition count 386
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 155 transition count 386
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 179 place count 152 transition count 374
Iterating global reduction 3 with 3 rules applied. Total rules applied 182 place count 152 transition count 374
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 150 transition count 370
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 150 transition count 370
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 148 transition count 366
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 148 transition count 366
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 146 transition count 362
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 146 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 144 transition count 358
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 144 transition count 358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 199 place count 143 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 143 transition count 356
Applied a total of 200 rules in 85 ms. Remains 143 /222 variables (removed 79) and now considering 356/648 (removed 292) transitions.
[2022-06-10 03:05:44] [INFO ] Flow matrix only has 244 transitions (discarded 112 similar events)
// Phase 1: matrix 244 rows 143 cols
[2022-06-10 03:05:44] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 03:05:44] [INFO ] Implicit Places using invariants in 236 ms returned []
[2022-06-10 03:05:44] [INFO ] Flow matrix only has 244 transitions (discarded 112 similar events)
// Phase 1: matrix 244 rows 143 cols
[2022-06-10 03:05:44] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 03:05:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-10 03:05:44] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2022-06-10 03:05:44] [INFO ] Flow matrix only has 244 transitions (discarded 112 similar events)
// Phase 1: matrix 244 rows 143 cols
[2022-06-10 03:05:44] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 03:05:45] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/222 places, 356/648 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/222 places, 356/648 transitions.
Support contains 17 out of 143 places after structural reductions.
[2022-06-10 03:05:45] [INFO ] Flatten gal took : 54 ms
[2022-06-10 03:05:45] [INFO ] Flatten gal took : 24 ms
[2022-06-10 03:05:45] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 16 out of 143 places (down from 17) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 12) seen :11
Finished Best-First random walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 356/356 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 336
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 136 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 130 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 130 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 125 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 125 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 111 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 111 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 107 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 107 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 104 transition count 252
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 104 transition count 252
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 101 transition count 246
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 100 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 98 transition count 240
Applied a total of 94 rules in 37 ms. Remains 98 /143 variables (removed 45) and now considering 240/356 (removed 116) transitions.
[2022-06-10 03:05:45] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 03:05:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-06-10 03:05:45] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 03:05:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 03:05:46] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-06-10 03:05:46] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 03:05:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:46] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/143 places, 240/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/143 places, 240/356 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s80 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-01 finished in 648 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(G(p0)))))&&F(!p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 356/356 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 336
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 136 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 131 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 131 transition count 320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 126 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 126 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 112 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 108 transition count 260
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 105 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 102 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 102 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 101 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 100 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 99 transition count 242
Applied a total of 92 rules in 24 ms. Remains 99 /143 variables (removed 44) and now considering 242/356 (removed 114) transitions.
[2022-06-10 03:05:46] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2022-06-10 03:05:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 03:05:46] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-06-10 03:05:46] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2022-06-10 03:05:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:46] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-10 03:05:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2022-06-10 03:05:46] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2022-06-10 03:05:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:46] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/143 places, 242/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/143 places, 242/356 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, p0, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 406 steps with 2 reset in 7 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-03 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 356/356 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 135 transition count 334
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 135 transition count 334
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 135 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 129 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 129 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 124 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 110 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 103 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 100 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 97 transition count 236
Applied a total of 98 rules in 27 ms. Remains 97 /143 variables (removed 46) and now considering 236/356 (removed 120) transitions.
[2022-06-10 03:05:47] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 03:05:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-06-10 03:05:47] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 03:05:47] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:05:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 03:05:47] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-06-10 03:05:47] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 03:05:47] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 03:05:47] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/143 places, 236/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/143 places, 236/356 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s68 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][false, false, false]]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-05 finished in 423 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 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 356/356 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 338
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 22 place count 136 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 131 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 131 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 127 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 127 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 123 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 123 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 119 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 119 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 116 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 113 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 113 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 111 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 106 transition count 258
Applied a total of 82 rules in 23 ms. Remains 106 /143 variables (removed 37) and now considering 258/356 (removed 98) transitions.
[2022-06-10 03:05:47] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 03:05:47] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 03:05:47] [INFO ] Implicit Places using invariants in 71 ms returned []
[2022-06-10 03:05:47] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 03:05:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 03:05:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:05:47] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2022-06-10 03:05:47] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 03:05:47] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 03:05:47] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/143 places, 258/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/143 places, 258/356 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s86 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][false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-09 finished in 417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 356/356 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 135 transition count 334
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 135 transition count 334
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 135 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 129 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 129 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 124 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 110 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 103 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 100 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 97 transition count 236
Applied a total of 98 rules in 24 ms. Remains 97 /143 variables (removed 46) and now considering 236/356 (removed 120) transitions.
[2022-06-10 03:05:47] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 03:05:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-06-10 03:05:47] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 03:05:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 03:05:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 03:05:48] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-06-10 03:05:48] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 03:05:48] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:05:48] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/143 places, 236/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/143 places, 236/356 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s0 1) (LT s18 1)), p0:(AND (GEQ s0 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 93 steps with 1 reset in 2 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-11 finished in 497 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 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 356/356 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 336
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 336
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 136 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 131 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 131 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 127 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 127 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 123 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 123 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 119 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 115 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 115 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 111 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 111 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 108 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 108 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 105 transition count 252
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 105 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 104 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 103 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 102 transition count 246
Applied a total of 88 rules in 28 ms. Remains 102 /143 variables (removed 41) and now considering 246/356 (removed 110) transitions.
[2022-06-10 03:05:48] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2022-06-10 03:05:48] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:05:48] [INFO ] Implicit Places using invariants in 78 ms returned []
[2022-06-10 03:05:48] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2022-06-10 03:05:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:05:48] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2022-06-10 03:05:48] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2022-06-10 03:05:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:48] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/143 places, 246/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/143 places, 246/356 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-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:(AND (GEQ s5 1) (GEQ s79 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][false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-13 finished in 463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(p0)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 356/356 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 338
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 22 place count 136 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 131 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 131 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 127 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 127 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 123 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 120 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 120 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 118 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 118 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 116 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 116 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 114 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 114 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 112 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 110 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 109 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 109 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 109 transition count 260
Applied a total of 80 rules in 68 ms. Remains 109 /143 variables (removed 34) and now considering 260/356 (removed 96) transitions.
[2022-06-10 03:05:48] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 109 cols
[2022-06-10 03:05:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-06-10 03:05:48] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 109 cols
[2022-06-10 03:05:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-10 03:05:49] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2022-06-10 03:05:49] [INFO ] Redundant transitions in 12 ms returned []
[2022-06-10 03:05:49] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 109 cols
[2022-06-10 03:05:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:49] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/143 places, 260/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/143 places, 260/356 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s78 1)) (OR (LT s1 1) (LT s90 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 542 reset in 260 ms.
Stack based approach found an accepted trace after 2169 steps with 8 reset with depth 207 and stack size 207 in 5 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-14 finished in 720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(!((G(X(p1))||p2) U X(p3)))&&p0)))))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 356/356 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 340
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 340
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 137 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 132 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 132 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 128 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 128 transition count 314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 124 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 121 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 121 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 118 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 118 transition count 286
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 115 transition count 278
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 112 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 109 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 106 transition count 260
Applied a total of 78 rules in 18 ms. Remains 106 /143 variables (removed 37) and now considering 260/356 (removed 96) transitions.
[2022-06-10 03:05:49] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 106 cols
[2022-06-10 03:05:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:49] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-06-10 03:05:49] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 106 cols
[2022-06-10 03:05:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-10 03:05:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2022-06-10 03:05:49] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 106 cols
[2022-06-10 03:05:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:05:49] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/143 places, 260/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/143 places, 260/356 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), p3, (AND p1 p3), p3, p3, (AND p1 p3), (AND p1 p3), (OR (AND (NOT p0) p1) (AND p1 p3))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p3), acceptance={0} source=4 dest: 2}], [{ cond=(AND p2 p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1 p3), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=6 dest: 8}], [{ cond=(AND p1 p3), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=7 dest: 6}, { cond=(AND p0 p1 p3), acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 p1), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1)), p2:(AND (GEQ s0 1) (GEQ s74 1)), p1:(AND (GEQ s0 1) (GEQ s16 1)), p3:(AND (GEQ s0 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-15 finished in 767 ms.
All properties solved by simple procedures.
Total runtime 6409 ms.

BK_STOP 1654830350349

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="FunctionPointer-PT-b002"
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-4028"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b002, 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 r312-tall-165472282200420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b002.tgz
mv FunctionPointer-PT-b002 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;