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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.3K Jun 7 17:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 7 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Jun 7 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 7 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Jun 7 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 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-b128-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654846180740

Running Version 202205111006
[2022-06-10 07:29:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 07:29:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 07:29:42] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-06-10 07:29:42] [INFO ] Transformed 306 places.
[2022-06-10 07:29:42] [INFO ] Transformed 840 transitions.
[2022-06-10 07:29:42] [INFO ] Parsed PT model containing 306 places and 840 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10019 steps, including 3 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :2
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-10 07:29:42] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2022-06-10 07:29:42] [INFO ] Computed 4 place invariants in 21 ms
[2022-06-10 07:29:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 07:29:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-10 07:29:43] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-10 07:29:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 07:29:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 07:29:43] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2022-06-10 07:29:43] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-10 07:29:43] [INFO ] After 259ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2022-06-10 07:29:43] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :6
Attempting to minimize the solution found.
Minimization took 133 ms.
[2022-06-10 07:29:43] [INFO ] After 914ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 6 different solutions.
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 20938 ms.
Support contains 30 out of 222 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 194 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 194 transition count 605
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 64 place count 174 transition count 489
Iterating global reduction 1 with 20 rules applied. Total rules applied 84 place count 174 transition count 489
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 130 place count 174 transition count 443
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 168 transition count 431
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 168 transition count 431
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 166 transition count 427
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 166 transition count 427
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 164 transition count 419
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 164 transition count 419
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 163 transition count 417
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 163 transition count 417
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 168 place count 163 transition count 401
Applied a total of 168 rules in 107 ms. Remains 163 /222 variables (removed 59) and now considering 401/648 (removed 247) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/222 places, 401/648 transitions.
Incomplete random walk after 1000077 steps, including 2 resets, run finished after 9259 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1610 ms. (steps per millisecond=621 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties (out of 4) seen :1
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1493 ms. (steps per millisecond=669 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1756 ms. (steps per millisecond=569 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-06-10 07:30:20] [INFO ] Flow matrix only has 264 transitions (discarded 137 similar events)
// Phase 1: matrix 264 rows 163 cols
[2022-06-10 07:30:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 07:30:20] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 07:30:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 07:30:20] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 07:30:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 07:30:21] [INFO ] After 42ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 07:30:21] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-10 07:30:21] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7910 ms.
Support contains 23 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 401/401 transitions.
Graph (complete) has 663 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 160 transition count 393
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 160 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 159 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 159 transition count 391
Applied a total of 7 rules in 33 ms. Remains 159 /163 variables (removed 4) and now considering 391/401 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/163 places, 391/401 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8209 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1459 ms. (steps per millisecond=685 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1734 ms. (steps per millisecond=576 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 5919614 steps, run timeout after 36001 ms. (steps per millisecond=164 ) properties seen :{1=1}
Probabilistic random walk after 5919614 steps, saw 3743288 distinct states, run finished after 36002 ms. (steps per millisecond=164 ) properties seen :1
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2022-06-10 07:31:17] [INFO ] Flow matrix only has 259 transitions (discarded 132 similar events)
// Phase 1: matrix 259 rows 159 cols
[2022-06-10 07:31:17] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 07:31:17] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 07:31:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 07:31:18] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 07:31:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 07:31:18] [INFO ] After 29ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 07:31:18] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-10 07:31:18] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3192 ms.
Support contains 22 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 391/391 transitions.
Applied a total of 0 rules in 13 ms. Remains 159 /159 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 391/391 transitions.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 5586 ms. (steps per millisecond=179 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3720333 steps, run timeout after 24001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 3720333 steps, saw 2318471 distinct states, run finished after 24002 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-10 07:31:53] [INFO ] Flow matrix only has 259 transitions (discarded 132 similar events)
// Phase 1: matrix 259 rows 159 cols
[2022-06-10 07:31:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 07:31:53] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 07:31:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 07:31:53] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 07:31:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 07:31:53] [INFO ] After 27ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 07:31:53] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-10 07:31:54] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3400 ms.
Support contains 22 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 391/391 transitions.
Applied a total of 0 rules in 13 ms. Remains 159 /159 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 391/391 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 391/391 transitions.
Applied a total of 0 rules in 15 ms. Remains 159 /159 variables (removed 0) and now considering 391/391 (removed 0) transitions.
[2022-06-10 07:31:57] [INFO ] Flow matrix only has 259 transitions (discarded 132 similar events)
// Phase 1: matrix 259 rows 159 cols
[2022-06-10 07:31:57] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 07:31:57] [INFO ] Implicit Places using invariants in 100 ms returned []
[2022-06-10 07:31:57] [INFO ] Flow matrix only has 259 transitions (discarded 132 similar events)
// Phase 1: matrix 259 rows 159 cols
[2022-06-10 07:31:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 07:31:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 07:31:57] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2022-06-10 07:31:57] [INFO ] Redundant transitions in 29 ms returned []
[2022-06-10 07:31:57] [INFO ] Flow matrix only has 259 transitions (discarded 132 similar events)
// Phase 1: matrix 259 rows 159 cols
[2022-06-10 07:31:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 07:31:57] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 391/391 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5775 ms. (steps per millisecond=173 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1231 ms. (steps per millisecond=812 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 2) seen :1
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2022-06-10 07:32:06] [INFO ] Flow matrix only has 259 transitions (discarded 132 similar events)
// Phase 1: matrix 259 rows 159 cols
[2022-06-10 07:32:06] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 07:32:06] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:32:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 07:32:06] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 07:32:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 07:32:06] [INFO ] After 15ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 07:32:06] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-10 07:32:06] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 229 ms.
Support contains 8 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 391/391 transitions.
Graph (complete) has 649 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 151 transition count 373
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 151 transition count 373
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 19 place count 151 transition count 369
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 147 transition count 359
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 147 transition count 359
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 143 transition count 349
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 143 transition count 349
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 140 transition count 339
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 140 transition count 339
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 137 transition count 333
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 137 transition count 333
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 134 transition count 323
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 134 transition count 323
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 131 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 131 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 128 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 128 transition count 311
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 125 transition count 305
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 125 transition count 305
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 123 transition count 301
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 123 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 121 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 121 transition count 297
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 119 transition count 293
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 119 transition count 293
Applied a total of 83 rules in 41 ms. Remains 119 /159 variables (removed 40) and now considering 293/391 (removed 98) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/159 places, 293/391 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1344 ms. (steps per millisecond=744 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2915115 steps, run timeout after 6001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 2915115 steps, saw 1814382 distinct states, run finished after 6001 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 07:32:15] [INFO ] Flow matrix only has 192 transitions (discarded 101 similar events)
// Phase 1: matrix 192 rows 119 cols
[2022-06-10 07:32:15] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 07:32:15] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:32:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 07:32:15] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 07:32:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-10 07:32:15] [INFO ] After 10ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 07:32:15] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-10 07:32:15] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 222 ms.
Support contains 8 out of 119 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 119/119 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 119/119 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2022-06-10 07:32:15] [INFO ] Flow matrix only has 192 transitions (discarded 101 similar events)
// Phase 1: matrix 192 rows 119 cols
[2022-06-10 07:32:15] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 07:32:15] [INFO ] Implicit Places using invariants in 74 ms returned []
[2022-06-10 07:32:15] [INFO ] Flow matrix only has 192 transitions (discarded 101 similar events)
// Phase 1: matrix 192 rows 119 cols
[2022-06-10 07:32:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 07:32:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-10 07:32:15] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2022-06-10 07:32:15] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 07:32:15] [INFO ] Flow matrix only has 192 transitions (discarded 101 similar events)
// Phase 1: matrix 192 rows 119 cols
[2022-06-10 07:32:15] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 07:32:15] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 293/293 transitions.
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 119 transition count 182
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 121 place count 109 transition count 182
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 121 place count 109 transition count 156
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 173 place count 83 transition count 156
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 2 with 30 rules applied. Total rules applied 203 place count 68 transition count 141
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 210 place count 61 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 217 place count 61 transition count 127
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 55 transition count 115
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 55 transition count 115
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 235 place count 49 transition count 103
Iterating global reduction 2 with 6 rules applied. Total rules applied 241 place count 49 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 246 place count 49 transition count 98
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 256 place count 44 transition count 117
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 268 place count 44 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 269 place count 43 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 270 place count 43 transition count 104
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 280 place count 43 transition count 94
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 281 place count 43 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 282 place count 42 transition count 93
Applied a total of 282 rules in 31 ms. Remains 42 /119 variables (removed 77) and now considering 93/293 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 93 rows 42 cols
[2022-06-10 07:32:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 07:32:16] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 07:32:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 07:32:16] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 07:32:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 07:32:16] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 07:32:16] [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 4 ms.
[2022-06-10 07:32:16] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 07:32:16] [INFO ] Flatten gal took : 33 ms
[2022-06-10 07:32:16] [INFO ] Flatten gal took : 11 ms
[2022-06-10 07:32:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16446057237715154350.gal : 10 ms
[2022-06-10 07:32:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12006870728921731944.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16446057237715154350.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12006870728921731944.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...321
Loading property file /tmp/ReachabilityCardinality12006870728921731944.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 55
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :55 after 189
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :189 after 630
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :630 after 2345
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2345 after 48395
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :48395 after 7.71794e+07
Detected timeout of ITS tools.
[2022-06-10 07:32:31] [INFO ] Flatten gal took : 11 ms
[2022-06-10 07:32:31] [INFO ] Applying decomposition
[2022-06-10 07:32:31] [INFO ] Flatten gal took : 7 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/graph14601984060087886113.txt' '-o' '/tmp/graph14601984060087886113.bin' '-w' '/tmp/graph14601984060087886113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14601984060087886113.bin' '-l' '-1' '-v' '-w' '/tmp/graph14601984060087886113.weights' '-q' '0' '-e' '0.001'
[2022-06-10 07:32:31] [INFO ] Decomposing Gal with order
[2022-06-10 07:32:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 07:32:31] [INFO ] Removed a total of 82 redundant transitions.
[2022-06-10 07:32:31] [INFO ] Flatten gal took : 41 ms
[2022-06-10 07:32:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2022-06-10 07:32:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1249365470844404877.gal : 4 ms
[2022-06-10 07:32:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18167317137090023920.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1249365470844404877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18167317137090023920.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...320
Loading property file /tmp/ReachabilityCardinality18167317137090023920.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 55
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :55 after 189
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :189 after 630
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :630 after 2345
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2345 after 48395
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :48395 after 7.71794e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1207885205422280582
[2022-06-10 07:32:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1207885205422280582
Running compilation step : cd /tmp/ltsmin1207885205422280582;'/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 382 ms.
Running link step : cd /tmp/ltsmin1207885205422280582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1207885205422280582;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'FunctionPointerPTb128ReachabilityCardinality03==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 07:33:01] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3445597267424341540
[2022-06-10 07:33:01] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2022-06-10 07:33:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:33:01] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2022-06-10 07:33:01] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:33:01] [INFO ] Applying decomposition
[2022-06-10 07:33:01] [INFO ] Flatten gal took : 27 ms
[2022-06-10 07:33:01] [INFO ] Flatten gal took : 46 ms
[2022-06-10 07:33:01] [INFO ] Input system was already deterministic with 293 transitions.
[2022-06-10 07:33:01] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2022-06-10 07:33:01] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 07:33:01] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3445597267424341540
Running compilation step : cd /tmp/ltsmin3445597267424341540;'/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/graph2417020863866500069.txt' '-o' '/tmp/graph2417020863866500069.bin' '-w' '/tmp/graph2417020863866500069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2417020863866500069.bin' '-l' '-1' '-v' '-w' '/tmp/graph2417020863866500069.weights' '-q' '0' '-e' '0.001'
[2022-06-10 07:33:01] [INFO ] Decomposing Gal with order
[2022-06-10 07:33:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 07:33:02] [INFO ] Removed a total of 57 redundant transitions.
[2022-06-10 07:33:02] [INFO ] Flatten gal took : 55 ms
[2022-06-10 07:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 3 ms.
[2022-06-10 07:33:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5584529483161672177.gal : 3 ms
[2022-06-10 07:33:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2688583553676382933.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5584529483161672177.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2688583553676382933.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2022-06-10 07:33:02] [INFO ] Ran tautology test, simplified 0 / 1 in 237 ms.
[2022-06-10 07:33:02] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=0 took 7 ms
[2022-06-10 07:33:02] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=1 took 1 ms

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
[2022-06-10 07:33:02] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=2 took 36 ms
Loading property file /tmp/ReachabilityCardinality2688583553676382933.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
[2022-06-10 07:33:02] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=3 took 93 ms
SDD proceeding with computation,1 properties remain. new max is 8
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 192 out of 293 initially.
// Phase 1: matrix 192 rows 119 cols
[2022-06-10 07:33:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 07:33:02] [INFO ] Computed 3 place invariants in 2 ms
SDD size :31 after 1062
[2022-06-10 07:33:02] [INFO ] Proved 119 variables to be positive in 295 ms
[2022-06-10 07:33:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:33:02] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=0 took 30 ms
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1062 after 191157
[2022-06-10 07:33:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:33:02] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=1 took 126 ms
Compilation finished in 931 ms.
Running link step : cd /tmp/ltsmin3445597267424341540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3445597267424341540;'/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' '-i' 'FunctionPointerPTb128ReachabilityCardinality03==true'
[2022-06-10 07:33:03] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=4 took 1149 ms
[2022-06-10 07:33:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:33:04] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=2 took 1453 ms
[2022-06-10 07:33:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:33:05] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=3 took 1759 ms
[2022-06-10 07:33:13] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=5 took 9920 ms
[2022-06-10 07:33:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:33:15] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=4 took 9415 ms
[2022-06-10 07:33:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:33:24] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=5 took 8904 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :191157 after 5.69627e+08
[2022-06-10 07:33:31] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=6 took 18551 ms
[2022-06-10 07:33:58] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=7 took 27005 ms
[2022-06-10 07:34:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:34:00] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=6 took 36368 ms
[2022-06-10 07:34:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:34:37] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=7 took 37274 ms
[2022-06-10 07:34:56] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=8 took 57631 ms
[2022-06-10 07:35:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:35:25] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=8 took 47557 ms
[2022-06-10 07:35:58] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=9 took 61478 ms
[2022-06-10 07:37:51] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=10 took 113392 ms
[2022-06-10 07:38:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:38:15] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=9 took 170202 ms
[2022-06-10 07:41:50] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=11 took 238911 ms
[2022-06-10 07:42:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:42:45] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=10 took 269467 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.69627e+08 after 1.37388e+14
[2022-06-10 07:44:01] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=12 took 131112 ms
[2022-06-10 07:49:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:49:03] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=11 took 378569 ms
[2022-06-10 07:52:33] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=13 took 512359 ms
Detected timeout of ITS tools.
[2022-06-10 07:54:08] [INFO ] Applying decomposition
[2022-06-10 07:54:08] [INFO ] Flatten gal took : 88 ms
[2022-06-10 07:54:08] [INFO ] Decomposing Gal with order
[2022-06-10 07:54:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l16 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l24 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l26 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l28 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l30 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l33 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l34 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l35 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l36 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l37 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l38 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l39 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l41 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l43 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l44 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l45 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l46 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l47 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l59 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l89 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l90 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l91 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l92 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l93 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l94 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l95 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l96 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l97 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l98 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l99 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l100 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l101 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l102 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l103 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l112 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l114 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l116 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l117 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l118 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l128 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l130 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l132 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l133 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l134 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l144 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l146 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l149 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l150 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l152 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l154 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l157 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l158 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l160 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l162 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l165 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l166 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l168 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l176 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l185 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l189 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l195 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l215 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l223 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l224 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l226 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l229 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l230 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l256 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l261 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l272 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l273 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l274 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l275 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l276 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l277 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l278 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [INFO ] Could not find partition element corresponding to l279 in partition [s0, s2, s4, l104, l106, l108, l136, l138, l140, l234, l248],[s1, s3, s5, l88, l109, l110, l141, l142, l184],[l0, l8, l42],[l20, l32, l40],[l51, l67],[l238, l246, l254],[l203, l232, l240],[l237, l245],[l253, l269],[l148, l199],[l242, l262],

[2022-06-10 07:54:08] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: Index -1 out of bounds for length 19
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:564)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:231)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:116)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-10 07:54:09] [INFO ] Flatten gal took : 69 ms
[2022-06-10 07:54:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18052828035768267481.gal : 4 ms
[2022-06-10 07:54:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality932667362618020085.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18052828035768267481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality932667362618020085.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/ReachabilityCardinality932667362618020085.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1084
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1084 after 212661
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :212661 after 9.33842e+08
[2022-06-10 07:56:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 07:56:16] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=12 took 432682 ms
[2022-06-10 08:02:42] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=14 took 608420 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Initializing POR dependencies: labels 294, guards 293
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.219: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 0.235: "FunctionPointerPTb128ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.235: "FunctionPointerPTb128ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.235: "FunctionPointerPTb128ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.239: "FunctionPointerPTb128ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.239: "FunctionPointerPTb128ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.241: "FunctionPointerPTb128ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.242: There are 294 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.242: State length is 119, there are 293 groups
pins2lts-mc-linux64( 0/ 8), 0.242: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.242: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.242: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.242: Visible groups: 0 / 293, labels: 1 / 294
pins2lts-mc-linux64( 0/ 8), 0.242: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.242: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.242: "FunctionPointerPTb128ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.235: "FunctionPointerPTb128ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.287: ~7 levels ~960 states ~4648 transitions
pins2lts-mc-linux64( 0/ 8), 0.335: ~9 levels ~1920 states ~10928 transitions
pins2lts-mc-linux64( 0/ 8), 0.403: ~10 levels ~3840 states ~23792 transitions
pins2lts-mc-linux64( 0/ 8), 0.508: ~12 levels ~7680 states ~49872 transitions
pins2lts-mc-linux64( 1/ 8), 0.714: ~6 levels ~15360 states ~68544 transitions
pins2lts-mc-linux64( 1/ 8), 1.157: ~7 levels ~30720 states ~149736 transitions
pins2lts-mc-linux64( 1/ 8), 2.055: ~8 levels ~61440 states ~320776 transitions
pins2lts-mc-linux64( 1/ 8), 3.619: ~10 levels ~122880 states ~637880 transitions
pins2lts-mc-linux64( 1/ 8), 6.311: ~11 levels ~245760 states ~1235288 transitions
pins2lts-mc-linux64( 1/ 8), 11.762: ~13 levels ~491520 states ~2636664 transitions
pins2lts-mc-linux64( 1/ 8), 22.385: ~14 levels ~983040 states ~5674720 transitions
pins2lts-mc-linux64( 7/ 8), 41.874: ~13 levels ~1966080 states ~11387416 transitions
pins2lts-mc-linux64( 1/ 8), 81.297: ~16 levels ~3932160 states ~22419816 transitions
pins2lts-mc-linux64( 1/ 8), 155.543: ~18 levels ~7864320 states ~43870584 transitions
pins2lts-mc-linux64( 1/ 8), 322.188: ~19 levels ~15728640 states ~92251456 transitions
pins2lts-mc-linux64( 7/ 8), 659.987: ~18 levels ~31457280 states ~190844848 transitions
pins2lts-mc-linux64( 1/ 8), 1431.305: ~21 levels ~62914560 states ~383061048 transitions
pins2lts-mc-linux64( 1/ 8), 1934.958: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1935.032:
pins2lts-mc-linux64( 0/ 8), 1935.032: mean standard work distribution: 7.5% (states) 1.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 1935.032:
pins2lts-mc-linux64( 0/ 8), 1935.032: Explored 75268707 states 507351080 transitions, fanout: 6.741
pins2lts-mc-linux64( 0/ 8), 1935.032: Total exploration time 1934.790 sec (1934.720 sec minimum, 1934.749 sec on average)
pins2lts-mc-linux64( 0/ 8), 1935.032: States per second: 38903, Transitions per second: 262225
pins2lts-mc-linux64( 0/ 8), 1935.032: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 1935.032:
pins2lts-mc-linux64( 0/ 8), 1935.032: Queue width: 8B, total height: 58948612, memory: 449.74MB
pins2lts-mc-linux64( 0/ 8), 1935.032: Tree memory: 1151.8MB, 9.0 B/state, compr.: 1.9%
pins2lts-mc-linux64( 0/ 8), 1935.032: Tree fill ratio (roots/leafs): 99.0%/49.0%
pins2lts-mc-linux64( 0/ 8), 1935.032: Stored 295 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1935.032: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1935.032: Est. total memory use: 1601.6MB (~1473.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3445597267424341540;'/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' '-i' 'FunctionPointerPTb128ReachabilityCardinality03==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3445597267424341540;'/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' '-i' 'FunctionPointerPTb128ReachabilityCardinality03==true'
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)
[2022-06-10 08:05:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 08:05:51] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=13 took 575410 ms
[2022-06-10 08:07:11] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=15 took 269248 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9.33842e+08 after 3.87652e+14
[2022-06-10 08:10:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b128-ReachabilityCardinality-03
[2022-06-10 08:10:06] [INFO ] KInduction solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(SAT) depth K=14 took 254030 ms
[2022-06-10 08:11:08] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=16 took 236523 ms
Detected timeout of ITS tools.
[2022-06-10 08:15:15] [INFO ] Flatten gal took : 21 ms
[2022-06-10 08:15:15] [INFO ] Input system was already deterministic with 293 transitions.
[2022-06-10 08:15:15] [INFO ] Transformed 119 places.
[2022-06-10 08:15:15] [INFO ] Transformed 293 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 08:15:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12491650526399931041.gal : 2 ms
[2022-06-10 08:15:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16806032956867250398.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12491650526399931041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16806032956867250398.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...366
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality16806032956867250398.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1087
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1087 after 228518
[2022-06-10 08:16:42] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=17 took 334581 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :228518 after 1.85413e+09
[2022-06-10 08:22:23] [INFO ] BMC solution for property FunctionPointer-PT-b128-ReachabilityCardinality-03(UNSAT) depth K=18 took 340628 ms

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-b128"
export BK_EXAMINATION="ReachabilityCardinality"
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-b128, examination is ReachabilityCardinality"
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-165472282300470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b128.tgz
mv FunctionPointer-PT-b128 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;