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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 17:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Jun 7 17:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Jun 7 17:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 391K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654835563741

Running Version 202205111006
[2022-06-10 04:32:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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 04:32:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 04:32:45] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-06-10 04:32:45] [INFO ] Transformed 306 places.
[2022-06-10 04:32:45] [INFO ] Transformed 840 transitions.
[2022-06-10 04:32:45] [INFO ] Parsed PT model containing 306 places and 840 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 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-b008-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 9 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 11) seen :4
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 04:32:46] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2022-06-10 04:32:46] [INFO ] Computed 4 place invariants in 20 ms
[2022-06-10 04:32:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:32:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:32:46] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-06-10 04:32:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:32:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:32:46] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2022-06-10 04:32:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-10 04:32:46] [INFO ] After 88ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2022-06-10 04:32:46] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-06-10 04:32:46] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 420 ms.
Support contains 12 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 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.8 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 188 transition count 550
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 188 transition count 550
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 117 place count 188 transition count 482
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 129 place count 176 transition count 458
Iterating global reduction 1 with 12 rules applied. Total rules applied 141 place count 176 transition count 458
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 161 place count 176 transition count 438
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 168 place count 169 transition count 424
Iterating global reduction 2 with 7 rules applied. Total rules applied 175 place count 169 transition count 424
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 182 place count 162 transition count 396
Iterating global reduction 2 with 7 rules applied. Total rules applied 189 place count 162 transition count 396
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 196 place count 155 transition count 382
Iterating global reduction 2 with 7 rules applied. Total rules applied 203 place count 155 transition count 382
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 152 transition count 370
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 152 transition count 370
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 211 place count 150 transition count 362
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 150 transition count 362
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 148 transition count 358
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 148 transition count 358
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 219 place count 146 transition count 354
Iterating global reduction 2 with 2 rules applied. Total rules applied 221 place count 146 transition count 354
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 223 place count 144 transition count 350
Iterating global reduction 2 with 2 rules applied. Total rules applied 225 place count 144 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 227 place count 142 transition count 346
Iterating global reduction 2 with 2 rules applied. Total rules applied 229 place count 142 transition count 346
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 231 place count 140 transition count 342
Iterating global reduction 2 with 2 rules applied. Total rules applied 233 place count 140 transition count 342
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 245 place count 140 transition count 330
Applied a total of 245 rules in 162 ms. Remains 140 /222 variables (removed 82) and now considering 330/648 (removed 318) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/222 places, 330/648 transitions.
Incomplete random walk after 1000002 steps, including 1735 resets, run finished after 1349 ms. (steps per millisecond=741 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2834742 steps, run timeout after 6001 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 2834742 steps, saw 1817169 distinct states, run finished after 6006 ms. (steps per millisecond=471 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 04:32:55] [INFO ] Flow matrix only has 226 transitions (discarded 104 similar events)
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:32:55] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 04:32:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 04:32:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:32:55] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 04:32:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 04:32:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:32:55] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 04:32:55] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-10 04:32:55] [INFO ] After 44ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 04:32:55] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-10 04:32:56] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 12 out of 140 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 330/330 transitions.
Applied a total of 0 rules in 11 ms. Remains 140 /140 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 330/330 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 330/330 transitions.
Applied a total of 0 rules in 9 ms. Remains 140 /140 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2022-06-10 04:32:56] [INFO ] Flow matrix only has 226 transitions (discarded 104 similar events)
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:32:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 04:32:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2022-06-10 04:32:56] [INFO ] Flow matrix only has 226 transitions (discarded 104 similar events)
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:32:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 04:32:56] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-10 04:32:56] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2022-06-10 04:32:56] [INFO ] Redundant transitions in 17 ms returned []
[2022-06-10 04:32:56] [INFO ] Flow matrix only has 226 transitions (discarded 104 similar events)
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:32:56] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 04:32:56] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 330/330 transitions.
Incomplete random walk after 1000001 steps, including 1858 resets, run finished after 1322 ms. (steps per millisecond=756 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 764 ms. (steps per millisecond=1308 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3072790 steps, run timeout after 6001 ms. (steps per millisecond=512 ) properties seen :{}
Probabilistic random walk after 3072790 steps, saw 1970435 distinct states, run finished after 6001 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 04:33:04] [INFO ] Flow matrix only has 226 transitions (discarded 104 similar events)
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:33:04] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 04:33:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 04:33:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:33:04] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 04:33:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 04:33:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:33:04] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 04:33:04] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-10 04:33:04] [INFO ] After 29ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 04:33:04] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-10 04:33:04] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 12 out of 140 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 330/330 transitions.
Applied a total of 0 rules in 9 ms. Remains 140 /140 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 330/330 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 330/330 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2022-06-10 04:33:04] [INFO ] Flow matrix only has 226 transitions (discarded 104 similar events)
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:33:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:33:05] [INFO ] Implicit Places using invariants in 77 ms returned []
[2022-06-10 04:33:05] [INFO ] Flow matrix only has 226 transitions (discarded 104 similar events)
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:33:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 04:33:05] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-10 04:33:05] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2022-06-10 04:33:05] [INFO ] Redundant transitions in 7 ms returned []
[2022-06-10 04:33:05] [INFO ] Flow matrix only has 226 transitions (discarded 104 similar events)
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:33:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:33:05] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 330/330 transitions.
Graph (trivial) has 184 edges and 140 vertex of which 24 / 140 are part of one of the 8 SCC in 7 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 124 transition count 192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 114 transition count 192
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 21 place count 114 transition count 168
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 69 place count 90 transition count 168
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 83 transition count 161
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 83 transition count 161
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 97 place count 83 transition count 147
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 129 place count 67 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 135 place count 61 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 141 place count 61 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 146 place count 56 transition count 109
Iterating global reduction 3 with 5 rules applied. Total rules applied 151 place count 56 transition count 109
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 51 transition count 99
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 51 transition count 99
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 166 place count 51 transition count 94
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 176 place count 46 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 46 transition count 97
Applied a total of 177 rules in 28 ms. Remains 46 /140 variables (removed 94) and now considering 97/330 (removed 233) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 97 rows 46 cols
[2022-06-10 04:33:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 04:33:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 04:33:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 04:33:05] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 04:33:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 04:33:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:33:05] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 04:33:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 04:33:05] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 04:33:05] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-10 04:33:05] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 04:33:05] [INFO ] Flatten gal took : 36 ms
[2022-06-10 04:33:05] [INFO ] Flatten gal took : 12 ms
[2022-06-10 04:33:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9163401272451893428.gal : 12 ms
[2022-06-10 04:33:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5670132292077749087.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/ReachabilityCardinality9163401272451893428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5670132292077749087.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5670132292077749087.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 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 109
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :109 after 1161
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1161 after 4.67088e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.67088e+06 after 6.45439e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.45439e+08 after 1.1984e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.1984e+10 after 1.33517e+11
Detected timeout of ITS tools.
[2022-06-10 04:33:20] [INFO ] Flatten gal took : 9 ms
[2022-06-10 04:33:20] [INFO ] Applying decomposition
[2022-06-10 04:33:20] [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/graph11146800572168076696.txt' '-o' '/tmp/graph11146800572168076696.bin' '-w' '/tmp/graph11146800572168076696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11146800572168076696.bin' '-l' '-1' '-v' '-w' '/tmp/graph11146800572168076696.weights' '-q' '0' '-e' '0.001'
[2022-06-10 04:33:20] [INFO ] Decomposing Gal with order
[2022-06-10 04:33:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 04:33:20] [INFO ] Removed a total of 130 redundant transitions.
[2022-06-10 04:33:20] [INFO ] Flatten gal took : 41 ms
[2022-06-10 04:33:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2022-06-10 04:33:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11765063191926234843.gal : 2 ms
[2022-06-10 04:33:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3406305198007344644.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/ReachabilityCardinality11765063191926234843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3406305198007344644.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality3406305198007344644.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 81
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :81 after 1035
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1035 after 4.26167e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.26167e+06 after 1.1502e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.1502e+07 after 3.73339e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.73339e+07 after 1.27846e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.27846e+08 after 4.86005e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2246783977332769622
[2022-06-10 04:33:36] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2246783977332769622
Running compilation step : cd /tmp/ltsmin2246783977332769622;'/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 246 ms.
Running link step : cd /tmp/ltsmin2246783977332769622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2246783977332769622;'/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' 'FunctionPointerPTb008ReachabilityFireability09==true'
LTSmin run took 436 ms.
Found Violation
[2022-06-10 04:33:36] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1388581471314069062
[2022-06-10 04:33:36] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2022-06-10 04:33:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:33:36] [INFO ] Applying decomposition
[2022-06-10 04:33:36] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2022-06-10 04:33:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:33:36] [INFO ] Flatten gal took : 33 ms
[2022-06-10 04:33:36] [INFO ] Flatten gal took : 52 ms
[2022-06-10 04:33:36] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2022-06-10 04:33:36] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 04:33:36] [INFO ] Input system was already deterministic with 330 transitions.
[2022-06-10 04:33:36] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1388581471314069062
Running compilation step : cd /tmp/ltsmin1388581471314069062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7157558036797126469.txt' '-o' '/tmp/graph7157558036797126469.bin' '-w' '/tmp/graph7157558036797126469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7157558036797126469.bin' '-l' '-1' '-v' '-w' '/tmp/graph7157558036797126469.weights' '-q' '0' '-e' '0.001'
[2022-06-10 04:33:36] [INFO ] Decomposing Gal with order
[2022-06-10 04:33:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 04:33:37] [INFO ] Removed a total of 557 redundant transitions.
[2022-06-10 04:33:37] [INFO ] Flatten gal took : 84 ms
[2022-06-10 04:33:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 44 ms.
[2022-06-10 04:33:37] [INFO ] Ran tautology test, simplified 0 / 1 in 299 ms.
[2022-06-10 04:33:37] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2388197284403675985.gal : 20 ms
[2022-06-10 04:33:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3447483545280442831.prop : 8 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/ReachabilityFireability2388197284403675985.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3447483545280442831.prop' '--nowitness'
[2022-06-10 04:33:37] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=0 took 22 ms
[2022-06-10 04:33:37] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=1 took 2 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability3447483545280442831.prop.
[2022-06-10 04:33:37] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=2 took 44 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 226 out of 330 initially.
// Phase 1: matrix 226 rows 140 cols
[2022-06-10 04:33:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 04:33:37] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 04:33:37] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=3 took 206 ms
[2022-06-10 04:33:37] [INFO ] Proved 140 variables to be positive in 210 ms
[2022-06-10 04:33:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b008-ReachabilityFireability-09
[2022-06-10 04:33:37] [INFO ] KInduction solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(SAT) depth K=0 took 24 ms
[2022-06-10 04:33:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b008-ReachabilityFireability-09
[2022-06-10 04:33:37] [INFO ] KInduction solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(SAT) depth K=1 took 52 ms
Compilation finished in 855 ms.
Running link step : cd /tmp/ltsmin1388581471314069062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1388581471314069062;'/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' 'FunctionPointerPTb008ReachabilityFireability09==true'
[2022-06-10 04:33:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b008-ReachabilityFireability-09
[2022-06-10 04:33:38] [INFO ] KInduction solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(SAT) depth K=2 took 687 ms
[2022-06-10 04:33:45] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=4 took 7765 ms
[2022-06-10 04:33:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b008-ReachabilityFireability-09
[2022-06-10 04:33:48] [INFO ] KInduction solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(SAT) depth K=3 took 10176 ms
[2022-06-10 04:33:59] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=5 took 14013 ms
[2022-06-10 04:34:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b008-ReachabilityFireability-09
[2022-06-10 04:34:20] [INFO ] KInduction solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(SAT) depth K=4 took 31831 ms
[2022-06-10 04:34:51] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=6 took 51974 ms
[2022-06-10 04:35:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b008-ReachabilityFireability-09
[2022-06-10 04:35:28] [INFO ] KInduction solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(SAT) depth K=5 took 67722 ms
[2022-06-10 04:36:28] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=7 took 97480 ms
[2022-06-10 04:37:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-b008-ReachabilityFireability-09
[2022-06-10 04:37:35] [INFO ] KInduction solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(SAT) depth K=6 took 127666 ms
[2022-06-10 04:40:25] [INFO ] BMC solution for property FunctionPointer-PT-b008-ReachabilityFireability-09(UNSAT) depth K=8 took 236726 ms
LTSmin run took 441360 ms.
Found Violation
FORMULA FunctionPointer-PT-b008-ReachabilityFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
[2022-06-10 04:40:59] [WARNING] Interrupting SMT solver.
[2022-06-10 04:40:59] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2022-06-10 04:40:59] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-10 04:40:59] [WARNING] Unexpected error occurred while running SMT. Was verifying FunctionPointer-PT-b008-ReachabilityFireability-09 SMT depth 9
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-10 04:40:59] [INFO ] During BMC, SMT solver timed out at depth 9
[2022-06-10 04:40:59] [INFO ] BMC solving timed out (3600000 secs) at depth 9
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-10 04:40:59] [WARNING] Unexpected error occurred while running SMT. Was verifying FunctionPointer-PT-b008-ReachabilityFireability-09 K-induction depth 7
Exception in thread "Thread-10" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-10 04:40:59] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 494389 ms.

BK_STOP 1654836059354

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

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