Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625000167.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FunctionPointer-PT-b128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 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-b128-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716524774058

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 04:26:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 04:26:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:26:15] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-24 04:26:15] [INFO ] Transformed 306 places.
[2024-05-24 04:26:15] [INFO ] Transformed 840 transitions.
[2024-05-24 04:26:15] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 214 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 32 place count 190 transition count 522
Iterating global reduction 1 with 24 rules applied. Total rules applied 56 place count 190 transition count 522
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 100 place count 190 transition count 478
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 110 place count 180 transition count 458
Iterating global reduction 2 with 10 rules applied. Total rules applied 120 place count 180 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 132 place count 180 transition count 446
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 177 transition count 440
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 177 transition count 440
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 175 transition count 432
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 175 transition count 432
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 173 transition count 428
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 173 transition count 428
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 172 transition count 424
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 172 transition count 424
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 171 transition count 420
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 171 transition count 420
Applied a total of 150 rules in 73 ms. Remains 171 /222 variables (removed 51) and now considering 420/648 (removed 228) transitions.
[2024-05-24 04:26:17] [INFO ] Flow matrix only has 290 transitions (discarded 130 similar events)
// Phase 1: matrix 290 rows 171 cols
[2024-05-24 04:26:17] [INFO ] Computed 2 invariants in 22 ms
[2024-05-24 04:26:18] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-24 04:26:18] [INFO ] Flow matrix only has 290 transitions (discarded 130 similar events)
[2024-05-24 04:26:18] [INFO ] Invariant cache hit.
[2024-05-24 04:26:18] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-24 04:26:18] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2024-05-24 04:26:18] [INFO ] Flow matrix only has 290 transitions (discarded 130 similar events)
[2024-05-24 04:26:18] [INFO ] Invariant cache hit.
[2024-05-24 04:26:18] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 171/222 places, 420/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1249 ms. Remains : 171/222 places, 420/648 transitions.
Support contains 26 out of 171 places after structural reductions.
[2024-05-24 04:26:18] [INFO ] Flatten gal took : 57 ms
[2024-05-24 04:26:18] [INFO ] Flatten gal took : 33 ms
[2024-05-24 04:26:18] [INFO ] Input system was already deterministic with 420 transitions.
Incomplete random walk after 10090 steps, including 3 resets, run finished after 224 ms. (steps per millisecond=45 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 04:26:19] [INFO ] Flow matrix only has 290 transitions (discarded 130 similar events)
[2024-05-24 04:26:19] [INFO ] Invariant cache hit.
[2024-05-24 04:26:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:26:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 04:26:19] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-24 04:26:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-24 04:26:19] [INFO ] After 15ms SMT Verify possible using 61 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-24 04:26:19] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-24 04:26:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:26:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:26:19] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 04:26:19] [INFO ] After 14ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-24 04:26:19] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 04:26:19] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 420/420 transitions.
Graph (complete) has 683 edges and 171 vertex of which 145 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 145 transition count 372
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 136 transition count 350
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 136 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 136 transition count 348
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 129 transition count 332
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 129 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 123 transition count 316
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 123 transition count 316
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 117 transition count 296
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 117 transition count 296
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 113 place count 111 transition count 280
Iterating global reduction 2 with 6 rules applied. Total rules applied 119 place count 111 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 106 transition count 264
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 106 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 134 place count 101 transition count 250
Iterating global reduction 2 with 5 rules applied. Total rules applied 139 place count 101 transition count 250
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 144 place count 96 transition count 240
Iterating global reduction 2 with 5 rules applied. Total rules applied 149 place count 96 transition count 240
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 154 place count 91 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 91 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 163 place count 87 transition count 222
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 87 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 84 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 84 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 175 place count 82 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 82 transition count 212
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 82 transition count 208
Applied a total of 181 rules in 64 ms. Remains 82 /171 variables (removed 89) and now considering 208/420 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 82/171 places, 208/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 76 steps, run visited all 1 properties in 5 ms. (steps per millisecond=15 )
Probabilistic random walk after 76 steps, saw 60 distinct states, run finished after 5 ms. (steps per millisecond=15 ) properties seen :1
Parikh walk visited 0 properties in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA FunctionPointer-PT-b128-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 909 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 420
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 159 transition count 394
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 159 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 151 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 151 transition count 374
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 144 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 144 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 137 transition count 330
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 137 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 130 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 118 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 112 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 106 transition count 254
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 102 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 99 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 97 transition count 236
Applied a total of 148 rules in 26 ms. Remains 97 /171 variables (removed 74) and now considering 236/420 (removed 184) transitions.
[2024-05-24 04:26:19] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-24 04:26:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 04:26:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-24 04:26:20] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-24 04:26:20] [INFO ] Invariant cache hit.
[2024-05-24 04:26:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 04:26:20] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-24 04:26:20] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-24 04:26:20] [INFO ] Invariant cache hit.
[2024-05-24 04:26:20] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/171 places, 236/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 97/171 places, 236/420 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s7 0), p1:(GT 2 s34)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3527 steps with 179 reset in 49 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-00 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0)) U p1))))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Graph (complete) has 909 edges and 171 vertex of which 170 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 162 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 162 transition count 398
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 24 place count 155 transition count 382
Iterating global reduction 0 with 7 rules applied. Total rules applied 31 place count 155 transition count 382
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 37 place count 149 transition count 364
Iterating global reduction 0 with 6 rules applied. Total rules applied 43 place count 149 transition count 364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 49 place count 143 transition count 344
Iterating global reduction 0 with 6 rules applied. Total rules applied 55 place count 143 transition count 344
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 61 place count 137 transition count 328
Iterating global reduction 0 with 6 rules applied. Total rules applied 67 place count 137 transition count 328
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 72 place count 132 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 77 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 82 place count 127 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 87 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 92 place count 122 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 97 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 102 place count 117 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 107 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 110 place count 114 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 113 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 112 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 111 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 111 transition count 270
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 123 place count 111 transition count 266
Applied a total of 123 rules in 69 ms. Remains 111 /171 variables (removed 60) and now considering 266/420 (removed 154) transitions.
[2024-05-24 04:26:20] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
// Phase 1: matrix 181 rows 111 cols
[2024-05-24 04:26:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 04:26:20] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 04:26:20] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2024-05-24 04:26:20] [INFO ] Invariant cache hit.
[2024-05-24 04:26:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-24 04:26:20] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-24 04:26:20] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-24 04:26:20] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2024-05-24 04:26:20] [INFO ] Invariant cache hit.
[2024-05-24 04:26:20] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/171 places, 266/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 111/171 places, 266/420 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s102), p0:(LEQ s105 s87)], 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 1007 steps with 14 reset in 23 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-01 finished in 639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1&&(p2||X(F(p3)))))))'
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Graph (complete) has 909 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 163 transition count 406
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 163 transition count 406
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 17 place count 163 transition count 402
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 159 transition count 392
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 159 transition count 392
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 155 transition count 384
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 155 transition count 384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 152 transition count 374
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 152 transition count 374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 150 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 150 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 148 transition count 362
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 148 transition count 362
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 146 transition count 354
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 146 transition count 354
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 144 transition count 350
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 144 transition count 350
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 142 transition count 346
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 142 transition count 346
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 140 transition count 342
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 140 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 138 transition count 338
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 138 transition count 338
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 136 transition count 334
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 136 transition count 334
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 136 transition count 324
Applied a total of 81 rules in 62 ms. Remains 136 /171 variables (removed 35) and now considering 324/420 (removed 96) transitions.
[2024-05-24 04:26:21] [INFO ] Flow matrix only has 224 transitions (discarded 100 similar events)
// Phase 1: matrix 224 rows 136 cols
[2024-05-24 04:26:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:26:21] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-24 04:26:21] [INFO ] Flow matrix only has 224 transitions (discarded 100 similar events)
[2024-05-24 04:26:21] [INFO ] Invariant cache hit.
[2024-05-24 04:26:21] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-24 04:26:21] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-24 04:26:21] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 04:26:21] [INFO ] Flow matrix only has 224 transitions (discarded 100 similar events)
[2024-05-24 04:26:21] [INFO ] Invariant cache hit.
[2024-05-24 04:26:21] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/171 places, 324/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 136/171 places, 324/420 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p3), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LEQ s74 s111) (LEQ s40 s106)), p0:(LEQ 1 s122), p2:(LEQ s126 s108), p3:(LEQ s74 s111)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 490 steps with 5 reset in 8 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-02 finished in 735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X((X(p1) U G(p2))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 420
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 162 transition count 400
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 162 transition count 400
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 162 transition count 396
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 27 place count 156 transition count 382
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 156 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 151 transition count 368
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 151 transition count 368
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 146 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 146 transition count 352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 141 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 141 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 137 transition count 326
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 137 transition count 326
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 133 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 133 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 129 transition count 308
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 129 transition count 308
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 125 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 125 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 123 transition count 296
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 123 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 121 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 121 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 120 transition count 290
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 120 transition count 290
Applied a total of 105 rules in 32 ms. Remains 120 /171 variables (removed 51) and now considering 290/420 (removed 130) transitions.
[2024-05-24 04:26:21] [INFO ] Flow matrix only has 199 transitions (discarded 91 similar events)
// Phase 1: matrix 199 rows 120 cols
[2024-05-24 04:26:21] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 04:26:22] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-24 04:26:22] [INFO ] Flow matrix only has 199 transitions (discarded 91 similar events)
[2024-05-24 04:26:22] [INFO ] Invariant cache hit.
[2024-05-24 04:26:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-24 04:26:22] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-24 04:26:22] [INFO ] Flow matrix only has 199 transitions (discarded 91 similar events)
[2024-05-24 04:26:22] [INFO ] Invariant cache hit.
[2024-05-24 04:26:22] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/171 places, 290/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 120/171 places, 290/420 transitions.
Stuttering acceptance computed with spot in 374 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT s111 0), p2:(LEQ 1 s34), p1:(GT s95 s70)], 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 28 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-03 finished in 776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Graph (complete) has 909 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 159 transition count 394
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 23 place count 159 transition count 392
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 152 transition count 376
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 152 transition count 376
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 145 transition count 356
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 145 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 138 transition count 332
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 138 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 132 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 132 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 128 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 128 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 124 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 124 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 120 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 120 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 116 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 114 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 114 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 112 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 110 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 110 transition count 266
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 110 transition count 262
Applied a total of 125 rules in 58 ms. Remains 110 /171 variables (removed 61) and now considering 262/420 (removed 158) transitions.
[2024-05-24 04:26:22] [INFO ] Flow matrix only has 180 transitions (discarded 82 similar events)
// Phase 1: matrix 180 rows 110 cols
[2024-05-24 04:26:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:26:22] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 04:26:22] [INFO ] Flow matrix only has 180 transitions (discarded 82 similar events)
[2024-05-24 04:26:22] [INFO ] Invariant cache hit.
[2024-05-24 04:26:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 04:26:22] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-24 04:26:22] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 04:26:22] [INFO ] Flow matrix only has 180 transitions (discarded 82 similar events)
[2024-05-24 04:26:22] [INFO ] Invariant cache hit.
[2024-05-24 04:26:23] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/171 places, 262/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 395 ms. Remains : 110/171 places, 262/420 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-05 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 (GT 3 s90) (LEQ 1 s82))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 259 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-05 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 420
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 159 transition count 394
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 159 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 151 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 151 transition count 374
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 144 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 144 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 137 transition count 330
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 137 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 130 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 118 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 112 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 106 transition count 254
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 102 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 99 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 97 transition count 236
Applied a total of 148 rules in 25 ms. Remains 97 /171 variables (removed 74) and now considering 236/420 (removed 184) transitions.
[2024-05-24 04:26:23] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-24 04:26:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:26:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 04:26:23] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-24 04:26:23] [INFO ] Invariant cache hit.
[2024-05-24 04:26:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 04:26:23] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-24 04:26:23] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-24 04:26:23] [INFO ] Invariant cache hit.
[2024-05-24 04:26:23] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/171 places, 236/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 97/171 places, 236/420 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ 2 s96), p0:(LEQ s44 0)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b128-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLCardinality-09 finished in 982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 420
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 159 transition count 394
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 159 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 159 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 151 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 151 transition count 374
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 144 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 144 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 137 transition count 330
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 137 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 130 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 118 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 112 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 106 transition count 254
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 102 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 99 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 97 transition count 236
Applied a total of 148 rules in 20 ms. Remains 97 /171 variables (removed 74) and now considering 236/420 (removed 184) transitions.
[2024-05-24 04:26:24] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-24 04:26:24] [INFO ] Invariant cache hit.
[2024-05-24 04:26:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 04:26:24] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-24 04:26:24] [INFO ] Invariant cache hit.
[2024-05-24 04:26:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 04:26:24] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-24 04:26:24] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-24 04:26:24] [INFO ] Invariant cache hit.
[2024-05-24 04:26:24] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/171 places, 236/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 97/171 places, 236/420 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { 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=1, aps=[p1:(GT s58 s57), p0:(LEQ 2 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-12 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 420/420 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 160 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 160 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 160 transition count 394
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 153 transition count 380
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 153 transition count 380
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 147 transition count 362
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 141 transition count 342
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 141 transition count 342
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 135 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 130 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 126 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 126 transition count 300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 122 transition count 292
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 118 transition count 284
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 118 transition count 284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 115 transition count 278
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 112 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 112 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 110 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 110 transition count 268
Applied a total of 122 rules in 23 ms. Remains 110 /171 variables (removed 61) and now considering 268/420 (removed 152) transitions.
[2024-05-24 04:26:24] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 110 cols
[2024-05-24 04:26:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 04:26:24] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-24 04:26:24] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2024-05-24 04:26:24] [INFO ] Invariant cache hit.
[2024-05-24 04:26:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 04:26:25] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-24 04:26:25] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2024-05-24 04:26:25] [INFO ] Invariant cache hit.
[2024-05-24 04:26:25] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/171 places, 268/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 110/171 places, 268/420 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-15 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:(GT s78 s98)], 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 58 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-15 finished in 496 ms.
All properties solved by simple procedures.
Total runtime 9845 ms.

BK_STOP 1716524790594

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b128"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-b128, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625000167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b128.tgz
mv FunctionPointer-PT-b128 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;