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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.3K Jun 7 17:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 7 17:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 17:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 11K Jun 7 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Jun 7 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-b004-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654831554750

Running Version 202205111006
[2022-06-10 03:25:55] [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:25:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 03:25:56] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-06-10 03:25:56] [INFO ] Transformed 306 places.
[2022-06-10 03:25:56] [INFO ] Transformed 840 transitions.
[2022-06-10 03:25:56] [INFO ] Parsed PT model containing 306 places and 840 transitions in 237 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 7 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 508
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 508
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 96 place count 187 transition count 472
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 109 place count 174 transition count 446
Iterating global reduction 2 with 13 rules applied. Total rules applied 122 place count 174 transition count 446
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 169 transition count 436
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 169 transition count 436
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 165 transition count 420
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 165 transition count 420
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 161 transition count 412
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 161 transition count 412
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 158 transition count 400
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 158 transition count 400
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 155 transition count 388
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 155 transition count 388
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 152 transition count 382
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 152 transition count 382
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 150 transition count 378
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 150 transition count 378
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 148 transition count 374
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 148 transition count 374
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 176 place count 146 transition count 370
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 146 transition count 370
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 145 transition count 368
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 145 transition count 368
Applied a total of 180 rules in 85 ms. Remains 145 /222 variables (removed 77) and now considering 368/648 (removed 280) transitions.
[2022-06-10 03:25:56] [INFO ] Flow matrix only has 251 transitions (discarded 117 similar events)
// Phase 1: matrix 251 rows 145 cols
[2022-06-10 03:25:56] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-10 03:25:56] [INFO ] Implicit Places using invariants in 237 ms returned []
[2022-06-10 03:25:56] [INFO ] Flow matrix only has 251 transitions (discarded 117 similar events)
// Phase 1: matrix 251 rows 145 cols
[2022-06-10 03:25:56] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 03:25:56] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-10 03:25:56] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2022-06-10 03:25:56] [INFO ] Flow matrix only has 251 transitions (discarded 117 similar events)
// Phase 1: matrix 251 rows 145 cols
[2022-06-10 03:25:56] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 03:25:57] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/222 places, 368/648 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/222 places, 368/648 transitions.
Support contains 20 out of 145 places after structural reductions.
[2022-06-10 03:25:57] [INFO ] Flatten gal took : 65 ms
[2022-06-10 03:25:57] [INFO ] Flatten gal took : 24 ms
[2022-06-10 03:25:57] [INFO ] Input system was already deterministic with 368 transitions.
Support contains 19 out of 145 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-06-10 03:25:57] [INFO ] Flow matrix only has 251 transitions (discarded 117 similar events)
// Phase 1: matrix 251 rows 145 cols
[2022-06-10 03:25:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:25:57] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2022-06-10 03:25:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 03:25:57] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 03:25:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 03:25:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 03:25:57] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 03:25:57] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-10 03:25:58] [INFO ] After 51ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:25:58] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-10 03:25:58] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 137 transition count 346
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 137 transition count 346
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 137 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 131 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 131 transition count 326
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 131 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 127 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 127 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 123 transition count 296
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 120 transition count 288
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 120 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 117 transition count 282
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 114 transition count 276
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 111 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 108 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 107 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 107 transition count 262
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 107 transition count 258
Applied a total of 90 rules in 90 ms. Remains 107 /145 variables (removed 38) and now considering 258/368 (removed 110) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/145 places, 258/368 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1449067 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :{}
Probabilistic random walk after 1449067 steps, saw 927136 distinct states, run finished after 3002 ms. (steps per millisecond=482 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 03:26:01] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:26:01] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 03:26:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 03:26:01] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 03:26:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 03:26:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 03:26:01] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 03:26:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:26:01] [INFO ] After 36ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:26:01] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-10 03:26:01] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 258/258 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2022-06-10 03:26:01] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:26:01] [INFO ] Implicit Places using invariants in 111 ms returned []
[2022-06-10 03:26:01] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:26:01] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2022-06-10 03:26:01] [INFO ] Redundant transitions in 29 ms returned []
[2022-06-10 03:26:01] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:26:01] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 258/258 transitions.
Graph (trivial) has 148 edges and 107 vertex of which 18 / 107 are part of one of the 6 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions removed 30 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 95 transition count 150
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 87 transition count 150
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 17 place count 87 transition count 133
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 51 place count 70 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 65 transition count 128
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 65 transition count 128
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 71 place count 65 transition count 118
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 101 place count 50 transition count 103
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 108 place count 43 transition count 89
Iterating global reduction 3 with 7 rules applied. Total rules applied 115 place count 43 transition count 89
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 122 place count 36 transition count 75
Iterating global reduction 3 with 7 rules applied. Total rules applied 129 place count 36 transition count 75
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 136 place count 29 transition count 61
Iterating global reduction 3 with 7 rules applied. Total rules applied 143 place count 29 transition count 61
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 150 place count 29 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 150 place count 29 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 28 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 26 transition count 53
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 26 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 25 transition count 52
Applied a total of 158 rules in 58 ms. Remains 25 /107 variables (removed 82) and now considering 52/258 (removed 206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 25 cols
[2022-06-10 03:26:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 03:26:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 03:26:02] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 03:26:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 03:26:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 03:26:02] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 03:26:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 03:26:02] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:26:02] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-10 03:26:02] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:26:02] [INFO ] Flatten gal took : 4 ms
[2022-06-10 03:26:02] [INFO ] Flatten gal took : 7 ms
[2022-06-10 03:26:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5939116248569545096.gal : 8 ms
[2022-06-10 03:26:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6883569006675790940.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5306847554038887425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5939116248569545096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6883569006675790940.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6883569006675790940.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 15
Reachability property AtomicPropp7 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,721,0.013754,3708,2,85,8,561,6,0,152,286,0
Total reachable state count : 721

Verifying 1 reachability properties.
Reachability property AtomicPropp7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,16,0.014576,4132,2,35,8,561,7,0,165,286,0
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' '!(F(X(F((G(p0)||X(X(F(p1))))))))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 138 transition count 350
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 138 transition count 350
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 138 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 134 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 134 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 130 transition count 324
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 130 transition count 324
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 126 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 126 transition count 310
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 123 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 123 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 120 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 120 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 117 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 117 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 114 transition count 282
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 114 transition count 282
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 111 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 111 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 109 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 109 transition count 272
Applied a total of 76 rules in 22 ms. Remains 109 /145 variables (removed 36) and now considering 272/368 (removed 96) transitions.
[2022-06-10 03:26:02] [INFO ] Flow matrix only has 182 transitions (discarded 90 similar events)
// Phase 1: matrix 182 rows 109 cols
[2022-06-10 03:26:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-06-10 03:26:02] [INFO ] Flow matrix only has 182 transitions (discarded 90 similar events)
// Phase 1: matrix 182 rows 109 cols
[2022-06-10 03:26:02] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 03:26:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:26:02] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-06-10 03:26:02] [INFO ] Flow matrix only has 182 transitions (discarded 90 similar events)
// Phase 1: matrix 182 rows 109 cols
[2022-06-10 03:26:02] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 03:26:02] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/145 places, 272/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/145 places, 272/368 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (OR (LT s0 1) (LT s97 1)) (OR (LT s1 1) (LT s90 1))), p1:(AND (GEQ s0 1) (GEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 300 reset in 328 ms.
Stack based approach found an accepted trace after 14145 steps with 41 reset with depth 715 and stack size 714 in 49 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-00 finished in 1019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(G(p0)))||F(p1)))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 138 transition count 352
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 138 transition count 352
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 138 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 132 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 132 transition count 332
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 38 place count 132 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 128 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 128 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 125 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 125 transition count 302
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 122 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 122 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 119 transition count 286
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 119 transition count 286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 116 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 113 transition count 274
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 110 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 108 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 108 transition count 264
Applied a total of 86 rules in 24 ms. Remains 108 /145 variables (removed 37) and now considering 264/368 (removed 104) transitions.
[2022-06-10 03:26:03] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2022-06-10 03:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-06-10 03:26:03] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2022-06-10 03:26:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 03:26:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-10 03:26:03] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2022-06-10 03:26:03] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2022-06-10 03:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:03] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/145 places, 264/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/145 places, 264/368 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s75 1)), p0:(AND (GEQ s1 1) (GEQ s89 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 222 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-01 finished in 587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||p1))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 137 transition count 346
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 137 transition count 346
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 137 transition count 342
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 130 transition count 324
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 130 transition count 324
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 130 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 125 transition count 306
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 125 transition count 306
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 120 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 116 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 116 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 112 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 112 transition count 268
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 108 transition count 260
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 108 transition count 260
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 104 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 104 transition count 252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 100 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 99 transition count 242
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 99 transition count 242
Applied a total of 100 rules in 21 ms. Remains 99 /145 variables (removed 46) and now considering 242/368 (removed 126) transitions.
[2022-06-10 03:26:03] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2022-06-10 03:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:04] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-06-10 03:26:04] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2022-06-10 03:26:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-10 03:26:04] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2022-06-10 03:26:04] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2022-06-10 03:26:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:04] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/145 places, 242/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/145 places, 242/368 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ 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][false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-02 finished in 508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(G(p1))))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 137 transition count 346
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 137 transition count 346
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 137 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 131 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 131 transition count 326
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 131 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 127 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 127 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 123 transition count 296
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 120 transition count 288
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 120 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 117 transition count 282
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 114 transition count 276
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 111 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 108 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 107 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 107 transition count 262
Applied a total of 86 rules in 27 ms. Remains 107 /145 variables (removed 38) and now considering 262/368 (removed 106) transitions.
[2022-06-10 03:26:04] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2022-06-10 03:26:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:04] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-06-10 03:26:04] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2022-06-10 03:26:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:26:04] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2022-06-10 03:26:04] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2022-06-10 03:26:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:04] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/145 places, 262/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/145 places, 262/368 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}, { cond=p0, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 5}]], initial=6, aps=[p1:(AND (OR (LT s1 1) (LT s95 1)) (GEQ s0 1) (GEQ s31 1) (GEQ s0 1) (GEQ s48 1)), p0:(AND (GEQ s0 1) (GEQ s48 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-03 finished in 660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!p0)) U (p1 U X(p2)))))'
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 138 transition count 348
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 138 transition count 348
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 138 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 132 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 132 transition count 326
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 128 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 128 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 124 transition count 294
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 124 transition count 294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 120 transition count 282
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 120 transition count 282
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 116 transition count 274
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 116 transition count 274
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 112 transition count 266
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 112 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 108 transition count 258
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 104 transition count 250
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 104 transition count 250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 102 transition count 246
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 102 transition count 246
Applied a total of 96 rules in 20 ms. Remains 102 /145 variables (removed 43) and now considering 246/368 (removed 122) transitions.
[2022-06-10 03:26:05] [INFO ] Flow matrix only has 169 transitions (discarded 77 similar events)
// Phase 1: matrix 169 rows 102 cols
[2022-06-10 03:26:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-06-10 03:26:05] [INFO ] Flow matrix only has 169 transitions (discarded 77 similar events)
// Phase 1: matrix 169 rows 102 cols
[2022-06-10 03:26:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-10 03:26:05] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-06-10 03:26:05] [INFO ] Flow matrix only has 169 transitions (discarded 77 similar events)
// Phase 1: matrix 169 rows 102 cols
[2022-06-10 03:26:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 03:26:05] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/145 places, 246/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/145 places, 246/368 transitions.
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p0), (OR (NOT p2) p0), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=p0, acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=p0, acceptance={0} source=5 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 9}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=9 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=9 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=6, aps=[p1:(AND (GEQ s1 1) (GEQ s71 1)), p2:(AND (GEQ s0 1) (GEQ s47 1)), p0:(AND (GEQ s5 1) (GEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-07 finished in 754 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 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 136 transition count 344
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 136 transition count 344
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 136 transition count 338
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 129 transition count 320
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 129 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 129 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 125 transition count 306
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 125 transition count 306
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 121 transition count 292
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 121 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 118 transition count 282
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 118 transition count 282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 115 transition count 276
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 112 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 109 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 106 transition count 258
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 106 transition count 258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 104 transition count 254
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 104 transition count 254
Applied a total of 92 rules in 20 ms. Remains 104 /145 variables (removed 41) and now considering 254/368 (removed 114) transitions.
[2022-06-10 03:26:05] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 03:26:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-06-10 03:26:05] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 03:26:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:26:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:26:06] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2022-06-10 03:26:06] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 03:26:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:26:06] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/145 places, 254/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/145 places, 254/368 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-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 s83 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 325 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-09 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 136 transition count 344
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 136 transition count 344
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 136 transition count 338
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 129 transition count 320
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 129 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 129 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 124 transition count 302
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 124 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 119 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 115 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 115 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 111 transition count 264
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 111 transition count 264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 107 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 103 transition count 248
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 99 transition count 240
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 97 transition count 234
Applied a total of 108 rules in 66 ms. Remains 97 /145 variables (removed 48) and now considering 234/368 (removed 134) transitions.
[2022-06-10 03:26:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 03:26:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:26:06] [INFO ] Implicit Places using invariants in 113 ms returned []
[2022-06-10 03:26:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 03:26:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 03:26:06] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2022-06-10 03:26:06] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-10 03:26:06] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 03:26:06] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 03:26:06] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/145 places, 234/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/145 places, 234/368 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 847 reset in 182 ms.
Stack based approach found an accepted trace after 76645 steps with 635 reset with depth 22 and stack size 22 in 175 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-12 finished in 880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 137 transition count 346
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 137 transition count 346
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 137 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 131 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 131 transition count 326
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 131 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 127 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 127 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 123 transition count 296
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 120 transition count 288
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 120 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 117 transition count 282
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 114 transition count 276
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 111 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 108 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 107 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 107 transition count 262
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 107 transition count 258
Applied a total of 90 rules in 36 ms. Remains 107 /145 variables (removed 38) and now considering 258/368 (removed 110) transitions.
[2022-06-10 03:26:07] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-06-10 03:26:07] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:26:07] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2022-06-10 03:26:07] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-10 03:26:07] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:07] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/145 places, 258/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/145 places, 258/368 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 524 reset in 211 ms.
Product exploration explored 100000 steps with 504 reset in 207 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1352 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=169 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 12 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2022-06-10 03:26:08] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-06-10 03:26:08] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:08] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:26:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:26:08] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2022-06-10 03:26:08] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 03:26:08] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:08] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:26:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 258/258 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 6643 steps, including 4 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1107 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 491 reset in 193 ms.
Product exploration explored 100000 steps with 496 reset in 195 ms.
Built C files in :
/tmp/ltsmin8603698281302502352
[2022-06-10 03:26:09] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2022-06-10 03:26:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:26:09] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2022-06-10 03:26:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:26:09] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2022-06-10 03:26:09] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:26:09] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8603698281302502352
Running compilation step : cd /tmp/ltsmin8603698281302502352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 554 ms.
Running link step : cd /tmp/ltsmin8603698281302502352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8603698281302502352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5417703390072285070.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2022-06-10 03:26:25] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:26:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-06-10 03:26:25] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 03:26:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 03:26:25] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-06-10 03:26:25] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 03:26:25] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 03:26:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 03:26:25] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin7579649790396967954
[2022-06-10 03:26:25] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2022-06-10 03:26:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:26:25] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2022-06-10 03:26:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:26:25] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2022-06-10 03:26:25] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:26:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7579649790396967954
Running compilation step : cd /tmp/ltsmin7579649790396967954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 478 ms.
Running link step : cd /tmp/ltsmin7579649790396967954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7579649790396967954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13056210002166723231.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 03:26:40] [INFO ] Flatten gal took : 14 ms
[2022-06-10 03:26:40] [INFO ] Flatten gal took : 13 ms
[2022-06-10 03:26:40] [INFO ] Time to serialize gal into /tmp/LTL8419549325629793570.gal : 2 ms
[2022-06-10 03:26:40] [INFO ] Time to serialize properties into /tmp/LTL3890072777440103279.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8419549325629793570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3890072777440103279.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8419549...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((s0<1)||(l246<1))"))))
Formula 0 simplified : !GF"((s0<1)||(l246<1))"
Detected timeout of ITS tools.
[2022-06-10 03:26:55] [INFO ] Flatten gal took : 14 ms
[2022-06-10 03:26:55] [INFO ] Applying decomposition
[2022-06-10 03:26:55] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3704883045740704551.txt' '-o' '/tmp/graph3704883045740704551.bin' '-w' '/tmp/graph3704883045740704551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3704883045740704551.bin' '-l' '-1' '-v' '-w' '/tmp/graph3704883045740704551.weights' '-q' '0' '-e' '0.001'
[2022-06-10 03:26:55] [INFO ] Decomposing Gal with order
[2022-06-10 03:26:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 03:26:55] [INFO ] Removed a total of 430 redundant transitions.
[2022-06-10 03:26:55] [INFO ] Flatten gal took : 59 ms
[2022-06-10 03:26:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 10 ms.
[2022-06-10 03:26:55] [INFO ] Time to serialize gal into /tmp/LTL12670208637268451462.gal : 3 ms
[2022-06-10 03:26:55] [INFO ] Time to serialize properties into /tmp/LTL651815121178397442.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12670208637268451462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL651815121178397442.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1267020...245
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.s0<1)||(i8.u28.l246<1))"))))
Formula 0 simplified : !GF"((i0.u0.s0<1)||(i8.u28.l246<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14965118843846352382
[2022-06-10 03:27:10] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14965118843846352382
Running compilation step : cd /tmp/ltsmin14965118843846352382;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 368 ms.
Running link step : cd /tmp/ltsmin14965118843846352382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14965118843846352382;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b004-LTLFireability-13 finished in 78736 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 368/368 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 136 transition count 344
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 136 transition count 344
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 136 transition count 338
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 129 transition count 320
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 129 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 129 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 124 transition count 302
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 124 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 119 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 115 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 115 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 111 transition count 264
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 111 transition count 264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 107 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 103 transition count 248
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 99 transition count 240
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 97 transition count 234
Applied a total of 108 rules in 30 ms. Remains 97 /145 variables (removed 48) and now considering 234/368 (removed 134) transitions.
[2022-06-10 03:27:25] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 03:27:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 03:27:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-06-10 03:27:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 03:27:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 03:27:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 03:27:26] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-06-10 03:27:26] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 03:27:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2022-06-10 03:27:26] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 03:27:26] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/145 places, 234/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/145 places, 234/368 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-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 (GEQ s0 1) (GEQ s46 1))], 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 269 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-14 finished in 371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-06-10 03:27:26] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17294648025728506248
[2022-06-10 03:27:26] [INFO ] Computing symmetric may disable matrix : 368 transitions.
[2022-06-10 03:27:26] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:27:26] [INFO ] Applying decomposition
[2022-06-10 03:27:26] [INFO ] Computing symmetric may enable matrix : 368 transitions.
[2022-06-10 03:27:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:27:26] [INFO ] Computing Do-Not-Accords matrix : 368 transitions.
[2022-06-10 03:27:26] [INFO ] Flatten gal took : 21 ms
[2022-06-10 03:27:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:27:26] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17294648025728506248
Running compilation step : cd /tmp/ltsmin17294648025728506248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2757622225786368908.txt' '-o' '/tmp/graph2757622225786368908.bin' '-w' '/tmp/graph2757622225786368908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2757622225786368908.bin' '-l' '-1' '-v' '-w' '/tmp/graph2757622225786368908.weights' '-q' '0' '-e' '0.001'
[2022-06-10 03:27:26] [INFO ] Decomposing Gal with order
[2022-06-10 03:27:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 03:27:26] [INFO ] Removed a total of 635 redundant transitions.
[2022-06-10 03:27:26] [INFO ] Flatten gal took : 31 ms
[2022-06-10 03:27:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 11 ms.
[2022-06-10 03:27:26] [INFO ] Time to serialize gal into /tmp/LTLFireability13230306604438739139.gal : 3 ms
[2022-06-10 03:27:26] [INFO ] Time to serialize properties into /tmp/LTLFireability14190164448826436818.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13230306604438739139.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14190164448826436818.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.s0<1)||(i11.i0.u44.l246<1))"))))
Formula 0 simplified : !GF"((i0.u0.s0<1)||(i11.i0.u44.l246<1))"
Compilation finished in 740 ms.
Running link step : cd /tmp/ltsmin17294648025728506248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17294648025728506248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.035: Initializing POR dependencies: labels 369, guards 368
pins2lts-mc-linux64( 1/ 8), 0.177: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.177: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.177: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.253: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.255: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.271: There are 371 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.271: State length is 146, there are 371 groups
pins2lts-mc-linux64( 0/ 8), 0.271: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.271: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.271: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.271: Visible groups: 0 / 371, labels: 1 / 371
pins2lts-mc-linux64( 0/ 8), 0.271: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.271: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.311: [Blue] ~120 levels ~960 states ~4744 transitions
pins2lts-mc-linux64( 3/ 8), 0.363: [Blue] ~240 levels ~1920 states ~9312 transitions
pins2lts-mc-linux64( 3/ 8), 0.453: [Blue] ~480 levels ~3840 states ~18752 transitions
pins2lts-mc-linux64( 3/ 8), 0.617: [Blue] ~960 levels ~7680 states ~37632 transitions
pins2lts-mc-linux64( 3/ 8), 0.976: [Blue] ~1920 levels ~15360 states ~75392 transitions
pins2lts-mc-linux64( 3/ 8), 1.525: [Blue] ~3840 levels ~30720 states ~150912 transitions
pins2lts-mc-linux64( 3/ 8), 2.386: [Blue] ~7680 levels ~61440 states ~301952 transitions
pins2lts-mc-linux64( 3/ 8), 3.800: [Blue] ~15360 levels ~122880 states ~604032 transitions
pins2lts-mc-linux64( 3/ 8), 6.159: [Blue] ~30720 levels ~245760 states ~1208192 transitions
pins2lts-mc-linux64( 3/ 8), 10.619: [Blue] ~61440 levels ~491520 states ~2416512 transitions
pins2lts-mc-linux64( 3/ 8), 19.224: [Blue] ~122880 levels ~983040 states ~4833152 transitions
pins2lts-mc-linux64( 3/ 8), 36.590: [Blue] ~245760 levels ~1966080 states ~9666432 transitions
pins2lts-mc-linux64( 3/ 8), 71.245: [Blue] ~491520 levels ~3932160 states ~19332992 transitions
pins2lts-mc-linux64( 3/ 8), 141.185: [Blue] ~983040 levels ~7864320 states ~38666112 transitions
pins2lts-mc-linux64( 5/ 8), 148.421: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 148.574:
pins2lts-mc-linux64( 0/ 8), 148.575: Explored 6229019 states 36200008 transitions, fanout: 5.812
pins2lts-mc-linux64( 0/ 8), 148.575: Total exploration time 148.280 sec (148.150 sec minimum, 148.210 sec on average)
pins2lts-mc-linux64( 0/ 8), 148.575: States per second: 42008, Transitions per second: 244133
pins2lts-mc-linux64( 0/ 8), 148.575:
pins2lts-mc-linux64( 0/ 8), 148.575: State space has 34928974 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 148.575: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 148.575: blue states: 6229019 (17.83%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 148.575: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 148.575: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 148.575:
pins2lts-mc-linux64( 0/ 8), 148.575: Total memory used for local state coloring: 95.0MB
pins2lts-mc-linux64( 0/ 8), 148.575:
pins2lts-mc-linux64( 0/ 8), 148.575: Queue width: 8B, total height: 6229018, memory: 47.52MB
pins2lts-mc-linux64( 0/ 8), 148.575: Tree memory: 522.5MB, 15.7 B/state, compr.: 2.7%
pins2lts-mc-linux64( 0/ 8), 148.575: Tree fill ratio (roots/leafs): 26.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 148.575: Stored 371 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 148.575: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 148.575: Est. total memory use: 570.0MB (~1071.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17294648025728506248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17294648025728506248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-10 03:47:56] [INFO ] Flatten gal took : 16 ms
[2022-06-10 03:47:56] [INFO ] Time to serialize gal into /tmp/LTLFireability5896855258844605794.gal : 2 ms
[2022-06-10 03:47:56] [INFO ] Time to serialize properties into /tmp/LTLFireability14438027638176195585.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5896855258844605794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14438027638176195585.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((G(F("((s0<1)||(l246<1))"))))
Formula 0 simplified : !GF"((s0<1)||(l246<1))"
Detected timeout of ITS tools.
[2022-06-10 04:08:52] [INFO ] Flatten gal took : 268 ms
[2022-06-10 04:08:53] [INFO ] Input system was already deterministic with 368 transitions.
[2022-06-10 04:08:53] [INFO ] Transformed 145 places.
[2022-06-10 04:08:53] [INFO ] Transformed 368 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 04:08:53] [INFO ] Time to serialize gal into /tmp/LTLFireability6953435862386340722.gal : 4 ms
[2022-06-10 04:08:53] [INFO ] Time to serialize properties into /tmp/LTLFireability8587903740099360871.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6953435862386340722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8587903740099360871.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((s0<1)||(l246<1))"))))
Formula 0 simplified : !GF"((s0<1)||(l246<1))"

BK_TIME_CONFINEMENT_REACHED

--------------------
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-b004"
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-b004, 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-165472282200428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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