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-165472282200430.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FunctionPointer-PT-b004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282200430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.3K Jun 7 17:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 7 17:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 17:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Jun 7 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 391K Jun 6 12:11 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654831948824

Running Version 202205111006
[2022-06-10 03:32:30] [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 03:32:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 03:32:30] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-06-10 03:32:30] [INFO ] Transformed 306 places.
[2022-06-10 03:32:30] [INFO ] Transformed 840 transitions.
[2022-06-10 03:32:30] [INFO ] Parsed PT model containing 306 places and 840 transitions in 261 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 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-b004-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 10 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 13) seen :5
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 03:32:31] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2022-06-10 03:32:31] [INFO ] Computed 4 place invariants in 23 ms
[2022-06-10 03:32:31] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 03:32:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 03:32:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 03:32:32] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-06-10 03:32:32] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-10 03:32:32] [INFO ] After 176ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2022-06-10 03:32:32] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 4 ms to minimize.
[2022-06-10 03:32:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-06-10 03:32:32] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 307 ms.
[2022-06-10 03:32:33] [INFO ] After 1425ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 2761 ms.
Support contains 68 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 214 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 203 transition count 568
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 203 transition count 568
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 41 place count 203 transition count 550
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 197 transition count 538
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 197 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 195 transition count 534
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 195 transition count 534
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 194 transition count 530
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 194 transition count 530
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 193 transition count 528
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 193 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 192 transition count 524
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 192 transition count 524
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 191 transition count 520
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 191 transition count 520
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 191 transition count 506
Applied a total of 79 rules in 126 ms. Remains 191 /222 variables (removed 31) and now considering 506/648 (removed 142) transitions.
Finished structural reductions, in 1 iterations. Remains : 191/222 places, 506/648 transitions.
Incomplete random walk after 1000000 steps, including 2312 resets, run finished after 8311 ms. (steps per millisecond=120 ) properties (out of 3) seen :1
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 419 resets, run finished after 1122 ms. (steps per millisecond=891 ) properties (out of 2) seen :1
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 458 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 03:32:46] [INFO ] Flow matrix only has 336 transitions (discarded 170 similar events)
// Phase 1: matrix 336 rows 191 cols
[2022-06-10 03:32:46] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 03:32:46] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 03:32:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 03:32:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 03:32:46] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 03:32:46] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-10 03:32:46] [INFO ] After 21ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:32:46] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-10 03:32:46] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 9 out of 191 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 191/191 places, 506/506 transitions.
Graph (complete) has 770 edges and 191 vertex of which 165 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 165 transition count 458
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 144 transition count 378
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 144 transition count 378
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 111 place count 144 transition count 358
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 121 place count 134 transition count 336
Iterating global reduction 2 with 10 rules applied. Total rules applied 131 place count 134 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 135 place count 134 transition count 332
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 129 transition count 320
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 129 transition count 320
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 150 place count 124 transition count 304
Iterating global reduction 3 with 5 rules applied. Total rules applied 155 place count 124 transition count 304
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 121 transition count 298
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 121 transition count 298
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 118 transition count 288
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 118 transition count 288
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 115 transition count 282
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 115 transition count 282
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 176 place count 112 transition count 276
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 112 transition count 276
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 109 transition count 270
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 109 transition count 270
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 187 place count 107 transition count 266
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 107 transition count 266
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 191 place count 105 transition count 262
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 105 transition count 262
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 103 transition count 258
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 103 transition count 258
Applied a total of 197 rules in 71 ms. Remains 103 /191 variables (removed 88) and now considering 258/506 (removed 248) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/191 places, 258/506 transitions.
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 1297 ms. (steps per millisecond=771 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=1506 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1489023 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 1489023 steps, saw 926808 distinct states, run finished after 3002 ms. (steps per millisecond=496 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 03:32:51] [INFO ] Flow matrix only has 166 transitions (discarded 92 similar events)
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:32:51] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 03:32:51] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 03:32:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 03:32:51] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 03:32:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-10 03:32:51] [INFO ] After 18ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:32:51] [INFO ] After 31ms 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 03:32:51] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 9 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 258/258 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2022-06-10 03:32:51] [INFO ] Flow matrix only has 166 transitions (discarded 92 similar events)
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:32:51] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 03:32:51] [INFO ] Implicit Places using invariants in 74 ms returned []
[2022-06-10 03:32:51] [INFO ] Flow matrix only has 166 transitions (discarded 92 similar events)
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:32:51] [INFO ] Computed 3 place invariants in 31 ms
[2022-06-10 03:32:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-10 03:32:51] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2022-06-10 03:32:51] [INFO ] Redundant transitions in 27 ms returned []
[2022-06-10 03:32:51] [INFO ] Flow matrix only has 166 transitions (discarded 92 similar events)
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:32:51] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 03:32:51] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 258/258 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1453 ms. (steps per millisecond=688 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3427490 steps, run timeout after 6001 ms. (steps per millisecond=571 ) properties seen :{}
Probabilistic random walk after 3427490 steps, saw 2133080 distinct states, run finished after 6001 ms. (steps per millisecond=571 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 03:33:00] [INFO ] Flow matrix only has 166 transitions (discarded 92 similar events)
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:33:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 03:33:00] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 03:33:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 03:33:00] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 03:33:00] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-10 03:33:00] [INFO ] After 12ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:33:00] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 03:33:00] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 9 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 258/258 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 258/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2022-06-10 03:33:00] [INFO ] Flow matrix only has 166 transitions (discarded 92 similar events)
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:33:00] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 03:33:00] [INFO ] Implicit Places using invariants in 118 ms returned []
[2022-06-10 03:33:00] [INFO ] Flow matrix only has 166 transitions (discarded 92 similar events)
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:33:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 03:33:00] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-10 03:33:00] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2022-06-10 03:33:00] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-10 03:33:00] [INFO ] Flow matrix only has 166 transitions (discarded 92 similar events)
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:33:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 03:33:00] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 258/258 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 103 transition count 159
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 106 place count 96 transition count 159
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 106 place count 96 transition count 139
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 146 place count 76 transition count 139
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 180 place count 59 transition count 122
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 187 place count 52 transition count 108
Iterating global reduction 2 with 7 rules applied. Total rules applied 194 place count 52 transition count 108
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 200 place count 46 transition count 96
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 46 transition count 96
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 211 place count 41 transition count 86
Iterating global reduction 2 with 5 rules applied. Total rules applied 216 place count 41 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 219 place count 41 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 38 transition count 86
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 232 place count 38 transition count 79
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 38 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 37 transition count 79
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 37 transition count 78
Applied a total of 235 rules in 21 ms. Remains 37 /103 variables (removed 66) and now considering 78/258 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 37 cols
[2022-06-10 03:33:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 03:33:00] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 03:33:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 03:33:00] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 03:33:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 03:33:00] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:33:00] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-10 03:33:00] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 03:33:00] [INFO ] Flatten gal took : 30 ms
[2022-06-10 03:33:00] [INFO ] Flatten gal took : 11 ms
[2022-06-10 03:33:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15711368508831651595.gal : 6 ms
[2022-06-10 03:33:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6010532765176159400.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/ReachabilityCardinality15711368508831651595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6010532765176159400.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/ReachabilityCardinality6010532765176159400.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 120
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :120 after 87150
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :87150 after 1.93767e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.93767e+07 after 1.25615e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.25615e+09 after 5.4036e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.4036e+10 after 1.97266e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.97266e+12 after 6.69979e+13
Detected timeout of ITS tools.
[2022-06-10 03:33:15] [INFO ] Flatten gal took : 24 ms
[2022-06-10 03:33:15] [INFO ] Applying decomposition
[2022-06-10 03:33:15] [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/graph9133902868946503156.txt' '-o' '/tmp/graph9133902868946503156.bin' '-w' '/tmp/graph9133902868946503156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9133902868946503156.bin' '-l' '-1' '-v' '-w' '/tmp/graph9133902868946503156.weights' '-q' '0' '-e' '0.001'
[2022-06-10 03:33:16] [INFO ] Decomposing Gal with order
[2022-06-10 03:33:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 03:33:16] [INFO ] Removed a total of 70 redundant transitions.
[2022-06-10 03:33:16] [INFO ] Flatten gal took : 43 ms
[2022-06-10 03:33:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2022-06-10 03:33:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15537772211338064274.gal : 3 ms
[2022-06-10 03:33:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7662468147560101834.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/ReachabilityCardinality15537772211338064274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7662468147560101834.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/ReachabilityCardinality7662468147560101834.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 120
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :120 after 87150
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :87150 after 1.93767e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.93767e+07 after 1.25615e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.25615e+09 after 5.4036e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.4036e+10 after 1.97266e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.97266e+12 after 6.69979e+13
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12419271625888447076
[2022-06-10 03:33:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12419271625888447076
Running compilation step : cd /tmp/ltsmin12419271625888447076;'/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 230 ms.
Running link step : cd /tmp/ltsmin12419271625888447076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12419271625888447076;'/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' 'FunctionPointerPTb004ReachabilityCardinality05==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 03:33:46] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5687067071051474427
[2022-06-10 03:33:46] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2022-06-10 03:33:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:33:46] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2022-06-10 03:33:46] [INFO ] Applying decomposition
[2022-06-10 03:33:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:33:46] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2022-06-10 03:33:46] [INFO ] Flatten gal took : 24 ms
[2022-06-10 03:33:46] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 03:33:46] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5687067071051474427
Running compilation step : cd /tmp/ltsmin5687067071051474427;'/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'
[2022-06-10 03:33:46] [INFO ] Flatten gal took : 60 ms
[2022-06-10 03:33:46] [INFO ] Input system was already deterministic with 258 transitions.
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/graph9102216153270200801.txt' '-o' '/tmp/graph9102216153270200801.bin' '-w' '/tmp/graph9102216153270200801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9102216153270200801.bin' '-l' '-1' '-v' '-w' '/tmp/graph9102216153270200801.weights' '-q' '0' '-e' '0.001'
[2022-06-10 03:33:46] [INFO ] Decomposing Gal with order
[2022-06-10 03:33:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 03:33:46] [INFO ] Removed a total of 257 redundant transitions.
[2022-06-10 03:33:46] [INFO ] Flatten gal took : 76 ms
[2022-06-10 03:33:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 10 ms.
[2022-06-10 03:33:46] [INFO ] Ran tautology test, simplified 0 / 1 in 234 ms.
[2022-06-10 03:33:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4679623332816090353.gal : 10 ms
[2022-06-10 03:33:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16879175051734343313.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/ReachabilityCardinality4679623332816090353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16879175051734343313.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/ReachabilityCardinality16879175051734343313.prop.
[2022-06-10 03:33:46] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=0 took 52 ms
[2022-06-10 03:33:46] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=1 took 1 ms
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 897
[2022-06-10 03:33:46] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=2 took 33 ms
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :897 after 33834
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 166 out of 258 initially.
// Phase 1: matrix 166 rows 103 cols
[2022-06-10 03:33:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 03:33:46] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 03:33:46] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=3 took 152 ms
[2022-06-10 03:33:47] [INFO ] Proved 103 variables to be positive in 265 ms
[2022-06-10 03:33:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:33:47] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=0 took 5 ms
Compilation finished in 711 ms.
Running link step : cd /tmp/ltsmin5687067071051474427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5687067071051474427;'/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' 'FunctionPointerPTb004ReachabilityCardinality05==true'
[2022-06-10 03:33:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:33:47] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=1 took 47 ms
[2022-06-10 03:33:47] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=4 took 309 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33834 after 320508
[2022-06-10 03:33:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:33:48] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=2 took 1485 ms
[2022-06-10 03:33:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:33:49] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=3 took 720 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :320508 after 1.79746e+06
[2022-06-10 03:33:53] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=5 took 6659 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.79746e+06 after 8.40243e+06
[2022-06-10 03:34:00] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=6 took 6970 ms
[2022-06-10 03:34:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:34:02] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=4 took 13293 ms
[2022-06-10 03:34:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:34:03] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=5 took 832 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.40243e+06 after 3.60477e+07
[2022-06-10 03:34:23] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=7 took 22170 ms
[2022-06-10 03:34:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:34:37] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=6 took 34377 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.60477e+07 after 1.48748e+08
[2022-06-10 03:35:23] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=8 took 60781 ms
[2022-06-10 03:35:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:35:27] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=7 took 49768 ms
[2022-06-10 03:36:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:36:42] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=8 took 74818 ms
[2022-06-10 03:37:02] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=9 took 98831 ms
[2022-06-10 03:38:59] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=10 took 116831 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.48748e+08 after 6.0316e+08
[2022-06-10 03:39:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:39:40] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=9 took 178105 ms
[2022-06-10 03:42:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:42:09] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=10 took 148644 ms
[2022-06-10 03:43:54] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=11 took 294730 ms
Detected timeout of ITS tools.
[2022-06-10 03:54:12] [INFO ] Applying decomposition
[2022-06-10 03:54:12] [INFO ] Flatten gal took : 55 ms
[2022-06-10 03:54:12] [INFO ] Decomposing Gal with order
[2022-06-10 03:54:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l8 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l16 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l20 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l26 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l28 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l32 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l34 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l35 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l36 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l37 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l38 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l42 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l43 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l44 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l45 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l46 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l47 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l89 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l90 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l91 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l92 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l93 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l94 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l95 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l96 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l97 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l98 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l99 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l100 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l101 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l102 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l103 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l105 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l112 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l114 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l118 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l119 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l130 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l134 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l135 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l144 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l146 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l150 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l151 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l152 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l159 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l160 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l162 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l167 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l168 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l184 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l195 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l203 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l215 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l223 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l231 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l232 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l248 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l272 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l273 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l274 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l275 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l276 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l277 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l278 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [INFO ] Could not find partition element corresponding to l279 in partition [s0, s2, s4, l106, l107, l111, l138, l143],[s1, s3, s5, l88, l110, l136, l142, l158],[l0, l24, l30, l39, l40],[l104, l120, l128],[l154, l170],[l224, l240],[l176, l239, l247],[l255, l256],[l33, l41],[l123, l166],

[2022-06-10 03:54:12] [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 03:54:12] [INFO ] Flatten gal took : 32 ms
[2022-06-10 03:54:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14055703441239871734.gal : 2 ms
[2022-06-10 03:54:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7475399876520778897.prop : 28 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/ReachabilityCardinality14055703441239871734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7475399876520778897.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/ReachabilityCardinality7475399876520778897.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 946
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :946 after 54209
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :54209 after 1.04458e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.04458e+06 after 2.63857e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.63857e+06 after 5.72708e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.72708e+06 after 1.18567e+07
[2022-06-10 03:54:50] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=12 took 656157 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.18567e+07 after 2.40694e+07
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Initializing POR dependencies: labels 259, guards 258
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.094: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 5/ 8), 0.117: "FunctionPointerPTb004ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.117: "FunctionPointerPTb004ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.117: "FunctionPointerPTb004ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.117: "FunctionPointerPTb004ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.119: "FunctionPointerPTb004ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.117: "FunctionPointerPTb004ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.117: "FunctionPointerPTb004ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.119: "FunctionPointerPTb004ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.120: There are 259 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.120: State length is 103, there are 258 groups
pins2lts-mc-linux64( 0/ 8), 0.120: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.120: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.120: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.120: Visible groups: 0 / 258, labels: 1 / 259
pins2lts-mc-linux64( 0/ 8), 0.120: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.120: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.181: ~7 levels ~960 states ~4528 transitions
pins2lts-mc-linux64( 0/ 8), 0.213: ~8 levels ~1920 states ~9960 transitions
pins2lts-mc-linux64( 0/ 8), 0.290: ~9 levels ~3840 states ~20120 transitions
pins2lts-mc-linux64( 2/ 8), 0.393: ~5 levels ~7680 states ~33552 transitions
pins2lts-mc-linux64( 2/ 8), 0.553: ~6 levels ~15360 states ~66584 transitions
pins2lts-mc-linux64( 7/ 8), 0.919: ~11 levels ~30720 states ~108880 transitions
pins2lts-mc-linux64( 6/ 8), 1.567: ~9 levels ~61440 states ~242792 transitions
pins2lts-mc-linux64( 6/ 8), 2.669: ~11 levels ~122880 states ~478880 transitions
pins2lts-mc-linux64( 6/ 8), 4.675: ~12 levels ~245760 states ~950632 transitions
pins2lts-mc-linux64( 6/ 8), 8.544: ~14 levels ~491520 states ~1962896 transitions
pins2lts-mc-linux64( 3/ 8), 15.552: ~14 levels ~983040 states ~4127120 transitions
pins2lts-mc-linux64( 3/ 8), 28.627: ~15 levels ~1966080 states ~8317320 transitions
pins2lts-mc-linux64( 7/ 8), 54.265: ~22 levels ~3932160 states ~15757352 transitions
pins2lts-mc-linux64( 7/ 8), 106.707: ~24 levels ~7864320 states ~31576184 transitions
pins2lts-mc-linux64( 7/ 8), 212.606: ~26 levels ~15728640 states ~63784176 transitions
pins2lts-mc-linux64( 7/ 8), 420.966: ~28 levels ~31457280 states ~127197968 transitions
pins2lts-mc-linux64( 7/ 8), 844.685: ~30 levels ~62914560 states ~253077608 transitions
pins2lts-mc-linux64( 2/ 8), 1366.374: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1366.401:
pins2lts-mc-linux64( 0/ 8), 1366.401: mean standard work distribution: 3.9% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1366.401:
pins2lts-mc-linux64( 0/ 8), 1366.401: Explored 96255854 states 402703534 transitions, fanout: 4.184
pins2lts-mc-linux64( 0/ 8), 1366.401: Total exploration time 1366.280 sec (1366.260 sec minimum, 1366.266 sec on average)
pins2lts-mc-linux64( 0/ 8), 1366.401: States per second: 70451, Transitions per second: 294744
pins2lts-mc-linux64( 0/ 8), 1366.401: Ignoring proviso: 1
pins2lts-mc-linux64( 0/ 8), 1366.401:
pins2lts-mc-linux64( 0/ 8), 1366.401: Queue width: 8B, total height: 37962460, memory: 289.63MB
pins2lts-mc-linux64( 0/ 8), 1366.401: Tree memory: 1088.9MB, 8.5 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 1366.401: Tree fill ratio (roots/leafs): 99.0%/25.0%
pins2lts-mc-linux64( 0/ 8), 1366.401: Stored 258 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1366.401: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1366.401: Est. total memory use: 1378.5MB (~1313.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5687067071051474427;'/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' 'FunctionPointerPTb004ReachabilityCardinality05==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5687067071051474427;'/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' 'FunctionPointerPTb004ReachabilityCardinality05==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)
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.40694e+07 after 4.84474e+07
[2022-06-10 03:59:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 03:59:15] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=11 took 1026577 ms
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.84474e+07 after 9.71546e+07
[2022-06-10 04:01:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 04:01:14] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=12 took 118448 ms
[2022-06-10 04:02:28] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=13 took 457953 ms
[2022-06-10 04:07:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 04:07:45] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=13 took 391367 ms
[2022-06-10 04:13:51] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=14 took 682649 ms
Detected timeout of ITS tools.
[2022-06-10 04:14:37] [INFO ] Flatten gal took : 20 ms
[2022-06-10 04:14:37] [INFO ] Input system was already deterministic with 258 transitions.
[2022-06-10 04:14:37] [INFO ] Transformed 103 places.
[2022-06-10 04:14:37] [INFO ] Transformed 258 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 04:14:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3536918027927002363.gal : 9 ms
[2022-06-10 04:14:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13489779485564088003.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/ReachabilityCardinality3536918027927002363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13489779485564088003.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...365
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality13489779485564088003.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 30
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :30 after 565
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :565 after 3876
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3876 after 75139
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75139 after 1.00166e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.00166e+06 after 2.5128e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.5128e+10 after 3.70162e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.70162e+14 after 6.21311e+18
[2022-06-10 04:17:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 04:17:54] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=14 took 608852 ms
[2022-06-10 04:22:54] [INFO ] BMC solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(UNSAT) depth K=15 took 543924 ms
[2022-06-10 04:24:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b004-ReachabilityCardinality-05
[2022-06-10 04:24:00] [INFO ] KInduction solution for property FunctionPointer-PT-b004-ReachabilityCardinality-05(SAT) depth K=15 took 366094 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.21311e+18 after 8.50556e+22

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

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